Cartier duality and Deligne's order theorem (BB-DELIGNE) #
This file develops the abstract Hopf-algebraic layer (Layer A of plan-deligne.md) of
Deligne's theorem: a finite locally free commutative group scheme of rank N is killed
by N. The route is Tate's, from J. Tate, Finite flat group schemes (in Cornell–Silverman–
Stevens, Modular Forms and Fermat's Last Theorem), §3.8, book pp. 143–145.
The mathematical content of §3.8, in the affine/Hopf-algebra picture G = Spec A, R the base
ring, A a finite locally free R-Hopf algebra of rank n:
A' := Hom_R(A, R)is the Cartier dual — itself a commutativeR-Hopf algebra whenAis cocommutative (equivalentlyGcommutative), finite locally free of the same rankn. In mathlib this convolution algebra isWithConv (A →ₗ[R] R)(LinearMap.convAlgebra, andLinearMap.convCommRingunderIsCocomm R A).- A
B-point ofG, i.e. anR-algebra mapA → B, is a group-like elementλofA'_B := WithConv (A →ₗ[R] B)— a unit whose convolution powersλ^kare the multiplesk • Qof the point. (Tate p. 144: "G(R) = Hom_(R-alg)(A,R) ⊂ Hom_(R-mod)(A,R) = A'identifiesG(R)with the multiplicative group of group-like elements ofA'.") - The free rank-
nleftA'-moduleA' ⊗_R Acarries operatorsτ = id ⊗ τ_λ,ρ(right mult byid),ℓ(right mult byλ ⊗ 1) withτ ρ τ⁻¹ ρ⁻¹ = ℓ(Prop 3.8.1), andℓis the scalar matrixλ · Iₙ. - Since
A'is commutative,det : GLₙ(A') → (A')ˣkills the commutator, sodet(λ · Iₙ) = λⁿ = 1(Tate p. 144). Equivalentlyn • Q = 0.
This file proves the pieces bottom-up. The determinant step (leaf T-D5f) is pure matrix
algebra over a commutative ring and is complete; the point↔convolution-unit dictionary
(T-D5c) and the Cartier-dual algebra (T-D5a) are discharged from mathlib's convolution
API; the operator/commutator package (T-D5d/e, Prop 3.8.1) and the final assembly
(T-D5g) remain. The geometric bridge (Layer B) lives in
ModularCurves.GroupScheme.DeligneOrder.
See .mathlib-quality/plan-deligne.md for the full ticket board and verbatim source quotes.
Layer A leaf T-D5f — the determinant step #
The determinant homomorphism GLₙ(S) → Sˣ over a commutative ring S kills commutators;
applied to the scalar matrix λ · Iₙ = A B A⁻¹ B⁻¹ this gives λⁿ = 1. In Deligne's proof
S = A' is the (commutative) Cartier dual, λ the group-like element attached to a point,
and n the rank of G — so this leaf is exactly the last two sentences of Tate §3.8 (p. 144):
"we can use the determinant homomorphism GLₙ(A') → (A')* to conclude that λⁿ = 1."
The determinant of a unit matrix and of its inverse multiply to 1: det ↑A · det ↑A⁻¹ = 1.
A packaging of Matrix.det_mul + Units.mul_inv used repeatedly below.
(T-D5f — determinant step, Tate §3.8 p. 144.) Over a commutative ring S, if the scalar
matrix λ • Iₙ is a commutator A · B · A⁻¹ · B⁻¹ of invertible n × n matrices, then λⁿ = 1.
Proof: det is multiplicative and S is commutative, so det(A B A⁻¹ B⁻¹) = 1; and
det(λ • Iₙ) = λⁿ by Matrix.det_smul. This is the leaf discharged purely from mathlib
(Matrix.det_smul, Matrix.det_mul, Matrix.det_one, Units.mul_inv).
(T-D5f′ — determinant step, endomorphism form.) The same as
pow_eq_one_of_smul_one_eq_commutator but phrased with LinearMap.det on a free finite module
M (rank n), which is the form the geometric operators τ, ρ, ℓ of §3.8 naturally take: if
λ • id_M is a commutator P Q P⁻¹ Q⁻¹ of S-linear automorphisms of M, then λⁿ = 1.
Proof: LinearMap.det is a monoid hom killing commutators over the commutative ring S, and
det(λ • id_M) = λ^(finrank M) = λⁿ (LinearMap.det_smul, LinearMap.det_id).
The Cartier dual algebra and points as group-like elements #
We fix a commutative R-Hopf algebra A (= 𝒪(G)), cocommutative (G commutative), and a
test R-algebra B. Tate's A'_B is mathlib's WithConv (A →ₗ[R] B): the convolution
algebra of R-linear maps A → B, whose product is dual to the comultiplication of A.
(T-D5a — Cartier dual algebra, Tate §3.8 p. 143.) The Cartier dual A' = Hom_R(A, R)
(i.e. Module.Dual R A) with its convolution product, as a commutative R-algebra. This is
mathlib's WithConv (A →ₗ[R] R); the instances LinearMap.convAlgebra and (under IsCocomm R A,
i.e. G commutative) LinearMap.convCommRing supply the R-algebra and commutativity.
Equations
- ModularCurves.CartierDual R A = WithConv (A →ₗ[R] R)
Instances For
(T-D5c — points as convolution elements, Tate §3.8 p. 144.) A B-point φ : A →ₐ[R] B,
viewed in A'_B = WithConv (A →ₗ[R] B) as the group-like element λ_φ. The group law of
G(B) is convolution, so the k-th convolution power (pointConv φ)^k is k • Q.
Equations
Instances For
The convolution inverse of a point is the point composed with the antipode: this is the
Hopf-algebra identity ∑ φ(a₍₁₎) · φ(S a₍₂₎) = φ(∑ a₍₁₎ · S a₍₂₎) = φ(ε(a) • 1) = ε_B(a),
i.e. λ_φ · (λ_φ ∘ S) = 1 in A'_B. (Tate p. 144: "λ is group-like iff it is invertible in
A' and the map λ : A → R is multiplicative … invertible iff λ(1) = 1.")
(T-D5c — corollary.) A B-point φ is a unit in A'_B (its convolution inverse
being φ ∘ S). This is the statement that the points of G are group-like elements of A',
in particular invertible — needed so λ_φ · Iₙ ∈ GLₙ(A'_B) in the determinant step. Requires
G commutative (IsCocomm R A) so that A'_B is a commutative ring.
The commutator package (Prop 3.8.1) and the final assembly — REMAINING #
The heart of §3.8: on the free rank-n left A'-module A' ⊗_R A, the scalar λ · Iₙ is a
commutator, so det gives λⁿ = 1. Prop 3.8.1 (leaf T-D5e, itself resting on the operator
τ_λ of T-D5d) is stated in the concrete existential form the determinant step consumes; it is
sorry here and proved in its sub-tickets. The assembly deligne_pointConv_pow (T-D5g) then
combines it with pow_eq_one_of_smul_one_eq_commutator.
General right-multiplication lemmas (Hopf-free) #
The commutator computation of Prop 3.8.1 rests on two facts about right multiplication in a
commutative S-algebra M, neither involving Hopf algebras:
- conjugating
R_u(right mult by a unitu) by anS-algebra automorphismτgivesR_{τ(u)}, soτ R_u τ⁻¹ R_{u}⁻¹ = R_{u⁻¹ · τ(u)}(mulRight_conj_mulRight_inv); - over
M = S ⊗_R A, right multiplication byλ ⊗ 1is the scalarλ • id(mulRight_tmul_one).
Conjugating right-multiplication R_u by an S-algebra automorphism τ and then
composing with R_{u⁻¹} yields right-multiplication by u⁻¹ · τ(u):
τ ∘ R_u ∘ τ⁻¹ ∘ R_{u⁻¹} = R_{u⁻¹ · τ(u)}. Pure ring theory (map_mul, associativity).
Over M = S ⊗_R A, right multiplication by λ ⊗ 1 is the scalar λ • id_M
(R_{λ⊗1} = λ • id). This is the identification ℓ = λ • Iₙ of Tate §3.8 (p. 144).
(T-D5e-τ chain link 1.) The scalar tower R → B → A'_B: the R- and B-algebra
structures on S = WithConv (A →ₗ[R] B) are compatible (transported through the ofConv
bijection via WithConv.ofConv_smul). This unblocks pointAlgHom (the point as an
R-algebra map A → S) and hence the automorphism τ.
(T-D5e-τ chain link 2.) The B-point φ as an R-algebra map into S = A'_B
(via the tower R → B → S). Feeds translationTarget/τ.
Equations
- ModularCurves.CartierDual.pointAlgHom φ = (IsScalarTower.toAlgHom R B (WithConv (A →ₗ[R] B))).comp φ
Instances For
(T-D5e-τ chain link 3.) g : A →ₐ[R] S ⊗_R A, a ↦ ∑ ptS(a₍₁₎) ⊗ a₍₂₎, where ptS
is pointAlgHom φ. This is the R-algebra map that defines the right-translation automorphism
τ of M = S ⊗_R A through the tensor-product universal property.
Equations
Instances For
(T-D5e-τ chain link 4.) The right-translation S-algebra endomorphism of M = S ⊗_R A,
s ⊗ a ↦ ∑ (s · ptS(a₍₁₎)) ⊗ a₍₂₎, obtained from translationTarget by the tensor-product
universal property (Algebra.TensorProduct.liftEquiv). Promoted to an automorphism τ in
deligne_operators via the convolution-inverse point.
Equations
- One or more equations did not get rendered due to their size.
Instances For
(T-D5e-τ ingredient — the base-changed right translation.) For a B-point φ, the
R-algebra map A → B ⊗_R A, a ↦ ∑ φ(a₍₁₎) ⊗ a₍₂₎ = (φ ⊗ id)(Δ a). This is the coordinate
form of Tate's right-translation operator τ_λ base-changed to B (Tate §3.8 p. 144: "τ_λ is
the automorphism of the R-algebra A corresponding to right translation by λ"). It is an algebra
hom because Δ = comulAlgHom and φ ⊗ id are; the automorphism τ of M = A'_B ⊗_R A and the
identity τ(u) = u·(λ⊗1) are built on it (sub-tickets T-D5e-τ, T-D5e-3.8.2).
Equations
Instances For
The comparison iso Ψ : A'_B ⊗_R A ≅ A'_{B⊗A} (T-D5e-core, coevaluation engine) #
Tate's Lemma 3.8.2 and the coevaluation unit u = 𝟙 ∈ M are cleanest through the natural
identification of the free-module operators with honest convolution maps. For A finite free over
R, the linear map
Ψ : (A →ₗ[R] B) ⊗_R A → (A →ₗ[R] B ⊗_R A), f ⊗ a ↦ (x ↦ f x ⊗ a)
(mathlib's rTensorHomEquivHomRTensor) is an isomorphism, and — with M = A'_B ⊗_R A
carrying the tensor-of-algebras product and T = A'_{B⊗_R A} the convolution product — it is an
R-algebra isomorphism M ≅ T. Under Ψ the coevaluation u = ∑ᵢ eᵢ' ⊗ eᵢ becomes the
universal point pointConv (includeRight) of T (hence a unit, by isUnit_pointConv), and Tate's
Lemma 3.8.2 becomes the cocommutativity identity ∑ φ(x₍₁₎) ⊗ x₍₂₎ = ∑ φ(x₍₂₎) ⊗ x₍₁₎.
Ψ as an R-linear equivalence A'_B ⊗_R A ≃ A'_{B⊗A}, f ⊗ a ↦ (x ↦ f x ⊗ a), from
mathlib's rTensorHomEquivHomRTensor (an equivalence since A is finite free) bridged through the
WithConv type synonym on both sides.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Ψ preserves the unit: 1_M = 1_S ⊗ 1_A ↦ 1_T (both send x ↦ ε(x) • (1 ⊗ 1)).
Ψ is multiplicative: it carries the tensor-of-algebras product on M = A'_B ⊗_R A to the
convolution product on T = A'_{B⊗A}. On generators both sides send
x ↦ ∑ (f x₍₁₎ · g x₍₂₎) ⊗ (a·c) (the convolution Sweedler sum), by convMul_apply on each
side.
(T-D5e-core — the comparison algebra isomorphism.) Ψ : M = A'_B ⊗_R A ≅ T = A'_{B⊗A}
as an R-algebra equivalence. Tensor-of-algebras product ↦ convolution product.
Equations
Instances For
The right-translation automorphism τ (T-D5e-τ auto-ness) #
τ = translationEndo φ is promoted to an A'_B-algebra automorphism with inverse
translationEndo φ', φ' = φ ∘ S. The two compositions reduce (via Algebra.TensorProduct.ext)
to translationEndo φ (translationTarget φ' a) = 1 ⊗ a, which is monoid algebra in the
commutative linear-convolution ring A'_M = WithConv (A →ₗ[R] M): writing
Pψ = pointConv(a ↦ ptS ψ(a) ⊗ 1),
η = pointConv includeRight, one has translationTarget φ = Pφ ⋆ η and
translationEndo φ ∘ translationTarget ψ = Pψ ⋆ Pφ ⋆ η, with Pφ' = Pφ⁻¹ (the antipode is the
convolution inverse, mul_pointConv_antipode_eq_one).
A →ₐ[R] M, a ↦ ptS φ(a) ⊗ 1 — the "constant in the A-factor" leg of the right translation
(here ptS = pointAlgHom φ). Its pointConv is Tate's Pφ.
Equations
Instances For
translationEndo φ (s ⊗ a') = (s ⊗ 1) · translationTarget φ a' (from the tensor-lift on
generators; Algebra.ofId S M s = s ⊗ 1).
translationTarget φ a = ∑ ptS φ(a₍₁₎) ⊗ a₍₂₎ in any Sweedler representation of a.
(T-D5e-τ, L1.) In A'_M,
translationEndo φ ∘ translationTarget ψ = Pψ ⋆ (translationTarget φ as a point): both send
a ↦ ∑ (ptS ψ(a₍₁₎) ⊗ 1) · translationTarget φ(a₍₂₎).
(T-D5e-τ, L2.) translationTarget φ = Pφ ⋆ η in A'_M, η = pointConv includeRight:
both send a ↦ ∑ (ptS φ(a₍₁₎) ⊗ 1)(1 ⊗ a₍₂₎) = ∑ ptS φ(a₍₁₎) ⊗ a₍₂₎.
leftPointHom (φ ∘ S) = leftPointHom φ ∘ S (the antipode passes through the point).
(T-D5e-τ inverse.) Pφ ⋆ Pφ' = 1 in A'_M (φ' = φ ∘ S): the antipode gives the
convolution inverse of the left-point (mul_pointConv_antipode_eq_one).
(T-D5e-τ crux.) translationEndo φ (translationTarget ψ a) = 1 ⊗ a whenever the left-points
of ψ and φ are convolution-inverse (Pψ ⋆ Pφ = 1). Both antipode compositions of the
right-translation reduce to this.
(T-D5e-τ — the right-translation automorphism.) τ = translationEndo φ promoted to an
A'_B-algebra automorphism of M = A'_B ⊗_R A, with inverse translationEndo (φ ∘ S). Both
compositions reduce (via Algebra.TensorProduct.ext and translationEndo_tmul) to the crux
translationEndo _ (translationTarget _ a) = 1 ⊗ a.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The coevaluation unit u and Lemma 3.8.2 (T-D5e-core) #
u = ∑ᵢ eᵢ' ⊗ eᵢ ∈ M (eᵢ a basis of A, eᵢ' the dual coordinate pushed into A'_B via
R → B) is Tate's coevaluation element 𝟙 ∈ G(A). Under Ψ it becomes the universal point
pointConv (includeRight) of T — hence a unit (isUnit_pointConv). Tate's Lemma 3.8.2
τ(u) = u · (λ ⊗ 1) becomes, after applying Ψ,
pointConv (rightTranslationAlgHom φ) = pointConv includeRight ⋆ pointConv (includeLeft ∘ φ),
i.e. ∑ φ(a₍₁₎) ⊗ a₍₂₎ = ∑ φ(a₍₂₎) ⊗ a₍₁₎: cocommutativity (comm_comul).
(T-D5e-core — the coevaluation element u = 𝟙 ∈ G(A).) ∑ᵢ eᵢ' ⊗ eᵢ ∈ M, with eᵢ
the chosen basis of the finite free A and eᵢ' its dual coordinate embedded R → B.
Equations
- One or more equations did not get rendered due to their size.
Instances For
(T-D5e-core, key A.) Ψ(u) = pointConv (includeRight): under the comparison iso the
coevaluation is the universal point a ↦ 1 ⊗ a of T (dual-basis collapse
∑ᵢ eᵢ'(x) • eᵢ = x).
rightTranslationAlgHom φ a = ∑ φ(a₍₁₎) ⊗ a₍₂₎ in any Sweedler representation of a.
translationEndo φ (f ⊗ a) = ∑ (φ(a₍₁₎) • f) ⊗ a₍₂₎ (convolution with the point-element is a
scalar action; f · ptS φ(a₍₁₎) = φ(a₍₁₎) • f).
(T-D5e-core generator formula.) Ψ(τ (f ⊗ a))(x) = (f(x) ⊗ 1) · (∑ φ(a₍₁₎) ⊗ a₍₂₎) — the
key that makes the coevaluation computation basis-free: x enters only through f(x), and the
right-translation ∑ φ(a₍₁₎) ⊗ a₍₂₎ is undivided.
(T-D5e-core, LHS of Lemma 3.8.2.) Ψ(τ u) = pointConv (rightTranslationAlgHom φ): applying
τ to the coevaluation and pushing through Ψ gives the point a ↦ ∑ φ(a₍₁₎) ⊗ a₍₂₎, by the
generator formula and the dual-basis collapse
∑ᵢ eᵢ'(x) • rightTranslation(eᵢ) = rightTranslation x.
(T-D5e-core, RHS of Lemma 3.8.2.) Ψ(λ ⊗ 1) = pointConv (includeLeft ∘ φ), the point
a ↦ φ(a) ⊗ 1 of T.
(T-D5e-core — Tate's Lemma 3.8.2, τ(u) = u · (λ ⊗ 1).) The sole remaining ingredient of
Deligne's proof. After applying the comparison iso Ψ (injective) it becomes the cocommutativity
identity ∑ φ(a₍₁₎) ⊗ a₍₂₎ = ∑ φ(a₍₂₎) ⊗ a₍₁₎ (comm_comul): both sides are
(φ ⊗ id)(Δ a) since Δ is cocommutative.
(Hopf core of Prop 3.8.1 = Lemma 3.8.2, Tate §3.8 p. 144 — SORRIED sub-ticket T-D5e-core.)
The operators underlying Deligne's commutator: for a B-point φ (with λ = pointConv φ), there
is a unit u of the ring M = A'_B ⊗_R A — the coevaluation element ∑ eᵢ' ⊗ eᵢ, i.e.
id ∈ G(A) under A' ⊗ A ≅ End_R A — and an A'_B-algebra automorphism τ of M — namely
id_{A'} ⊗ τ_λ, from the right-translation automorphism τ_λ = (λ ⊗ id) ∘ Δ on A — satisfying
τ(u) = u · (λ ⊗ 1). This last equation is Tate's Lemma 3.8.2 specialised to φ = τ_λ
("(id_{A'} ⊗ φ)(id) = (id_A ⊗ φ')(id)"), the sole remaining ingredient of Deligne's proof.
Proof (T-D5e-core, sorry-free): u is the coevaluation coev = ∑ᵢ eᵢ' ⊗ eᵢ — a unit because
the comparison iso Ψ = psiAlgEquiv : M ≅ A'_{B⊗A} carries it to the universal point
pointConv (includeRight), which isUnit_pointConv shows invertible; τ = translationEquiv φ is
the right-translation automorphism; and τ(u) = u · (λ ⊗ 1) is coev_relation, which under Ψ
becomes cocommutativity ∑ φ(a₍₁₎) ⊗ a₍₂₎ = ∑ φ(a₍₂₎) ⊗ a₍₁₎. All pieces live in the
DeligneLeaf section above.
(T-D5e — Proposition 3.8.1, Tate §3.8 p. 144.) On the free rank-n left-A'-module
M := A'_B ⊗_R A, the scalar map λ • id_M — which is right multiplication by λ ⊗ 1 — is the
commutator τ ρ τ⁻¹ ρ⁻¹, where ρ is right multiplication by the coevaluation unit u = 𝟙 ∈ M
and τ = id_{A'} ⊗ τ_λ is the ring automorphism of M induced by right translation τ_λ on A.
The key relation (Lemma 3.8.2 with φ = τ_λ) is τ(u) = u · (λ ⊗ 1), whence for a ring
automorphism τ, τ ρ τ⁻¹ = R_{τ(u)} and R_{τ(u)} ρ⁻¹ = R_{u⁻¹ · τ(u)} = R_{λ⊗1} = λ • id.
Stated in the form the determinant step (pow_eq_one_of_smul_id_eq_commutator) consumes: over
S := A'_B = WithConv (A →ₗ[R] B) and the free S-module M = S ⊗_R A, there exist units
P Q of End_S M (i.e. S-linear automorphisms of M) with λ • id_M = P Q P⁻¹ Q⁻¹. Proof
deferred to the sub-tickets T-D5e1–e5 (tensor module, τ_λ, right-mult operators, Lemma 3.8.2,
commutator identity).
(T-D5g — Deligne's order theorem, group-like form; Tate §3.8 pp. 144–145.) For a
cocommutative Hopf algebra A finite free over R, any B-point φ : A →ₐ[R] B satisfies
(pointConv φ)^n = 1, where n is the S-rank of M = S ⊗_R A (S := A'_B) — which for a
nontrivial base equals the order finrank R A of G. Equivalently n • Q = 0: Deligne's
theorem that a commutative finite flat group scheme is killed by its order. Assembled from the
commutator λ • id_M = P Q P⁻¹ Q⁻¹ (Prop 3.8.1, exists_commutator_eq_pointConv_smul_one) and
the determinant step (pow_eq_one_of_smul_id_eq_commutator).
The rank n is taken as finrank S (S ⊗_R A) (supplied by the caller) rather than reduced to
finrank R A: the reduction finrank S (S ⊗_R A) = finrank R A needs StrongRankCondition on
both rings (i.e. a nontrivial base), which the geometric consumer (Layer B) provides in context.
See deligne_pointConv_pow_finrank for that reduced form.
(T-D5g, reduced form.) For a nontrivial base ring R (so finrank is well-behaved),
Deligne's theorem reads (pointConv φ)^(finrank R A) = 1: the point is killed by the order
finrank R A of G. Uses Module.finrank_baseChange (finrank S (S ⊗_R A) = finrank R A),
which requires StrongRankCondition R — supplied here by [Nontrivial R] via
commRing_strongRankCondition.
(T-D5g, point-group form — the Layer-B consumable.) Deligne's order theorem stated in
mathlib's convolution group of points WithConv (A →ₐ[R] B) (a CommGroup for A commutative
cocommutative, inverse via the antipode): a B-point φ : A →ₐ[R] B of a finite-free commutative
cocommutative Hopf algebra satisfies (toConv φ)^(finrank R A) = 1. This is n • [point] = 0 in
the point group — the exact form the geometric bridge (RelEffCartierDiv.IsSubgroup, Layer B)
consumes once it identifies the curve's group law on a subgroup divisor with convolution of points.
Obtained from deligne_pointConv_pow_finrank by transporting along the injective forgetful
AlgHom → LinearMap (mathlib's AlgHom.toLinearMap_convPow/toLinearMap_convOne).
Mathlib-upstream candidate alongside the linear form.