Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

A smooth group of multiplicative type is the only closed subscheme containing all its finite subgroups

Statement

Assume the Axiom of Choice. Let k be an algebraically closed field and let G be a smooth algebraic group of multiplicative type over k, say G=D(M) with M finitely generated. Put Nk={n≥1:n⋅1k≠0}: this is all positive integers in characteristic zero and the positive integers prime to p in characteristic p>0. For every integer n≥1 let Gn=ker⁡(n⋅:G→G) be the kernel of multiplication by n; it is a finite closed subgroup scheme. If Z⊆G is a closed subscheme with Z(k)⊇⋃n∈NkGn(k), then Z=G.

The Axiom of Choice is inherited from the classification of groups of multiplicative type and from the schematically-dense-points lemma.

Facts & Assumptions

Given: The Axiom of Choice, an algebraically closed field k, a smooth finite-type group scheme G of multiplicative type over k, and a closed subscheme Z⊆G containing the k-points of all Gn with n∈Nk.

[F1]

Assume AC. Over an algebraically closed field, G↦X∗(G) is a contravariant equivalence between finite-type groups of multiplicative type and finitely generated abelian groups, and the inverse sends M to D(M); for k algebraically closed the Galois action is trivial, so G≅Dk(M)=Spec⁡k[M] with M=X∗(G) finitely generated. (Multiplicative type groups and Galois character modules)

[F2]

The group algebra k[M] has k-basis the group-like elements em (m∈M) with emen=em+n, and for every k-algebra R one has Dk(M)(R)=Hom⁡(M,R×). (Diagonalizable groups and their character modules)

[F3]

Every finitely generated abelian group decomposes as Zr⊕Z/(n1)⊕⋯⊕Z/(nt) with 1<n1∣⋯∣nt. (The fundamental theorem of finitely generated abelian groups from PID modules)

[F4]

If B1,B2 are commutative k-algebras and M=M1⊕M2, then k[M]≅k[M1]⊗kk[M2] by e(m1,m2)↔em1⊗em2; since Spec⁡ turns tensor products into fibre products, Dk(M)≅Dk(M1)×kDk(M2). (Diagonalizable groups and their character modules, Affine fibre products are spectra of tensor products)

[F5]

Smoothness of X→Spec⁡k at a point x includes geometric regularity of the fibre; the fibre of G→Spec⁡k is G itself, so for every x∈G the local ring OG,x is regular, hence a domain by [F6]; a scheme all of whose local rings are reduced is reduced. (Smooth morphism of schemes, The reduction of a scheme)

[F6]

Assume AC. Every regular local ring is an integral domain. (regular local domain induction)

[F7]

Assume AC. If X is reduced finite type over a field with no nontrivial finite separable extension and S⊆X(k) is dense, then every closed subscheme Z⊆X with Z(k)⊇S equals X. (Rational points of smooth finite-type schemes over a separably closed field are schematically dense, Tori correspond exactly to torsion-free character lattices)

Proof

Given: The Axiom of Choice, an algebraically closed field k, a smooth finite-type group G of multiplicative type over k, and a closed subscheme Z⊆G with Z(k)⊇Gn(k) for every n∈Nk.

1.1F1F2F3F4

By [F1] write G=Dk(M) with M finitely generated, so O(G)=k[M]. By [F3] fix the decomposition M=Zr⊕Z/(n1)⊕⋯⊕Z/(nt) with 1<n1∣⋯∣nt; write F=Z/(n1)⊕⋯⊕Z/(nt) and N=nt when t≥1, and N=1, F=0 when t=0. By [F4], applied repeatedly, k[M]≅k[Zr]⊗kk[F] and G≅Gmr×kDk(F), while by [F2] the group algebra k[Z/(n)]≅k[u]/(un−1) and O(Gm)=k[Z].

1.2F5F6

I claim that G is reduced. By [F5] every local ring OG,x is regular, hence a domain by [F6], and therefore reduced; a scheme whose local rings are all reduced is reduced.

2.1step 1.1step 1.2algebra

I claim that no ni is divisible by p=char⁡k; in characteristic zero this is vacuous, so suppose p>0 and suppose p∣ni for some i; write ni=pvm with v≥1 and p∤m. Then in k[u] one has uni−1=(um−1)pv, and um−1≠0 is a nonzero nilpotent in k[u]/(uni−1) because (um−1)pv=uni−1=0; hence k[Z/(ni)] is not reduced. By [step 1.1], k[M]≅k[Zr]⊗kk[F] and k[F] has k[Z/(ni)] as a tensor factor, so a nonzero nilpotent of k[Z/(ni)] produces a nonzero nilpotent 1⊗z of k[M]; this contradicts [step 1.2], since O(G)=k[M] reduced means k[M] is reduced. Hence p∤∣F∣.

3.1F2step 1.1step 2.1algebra

I claim that for every integer j with N∣j and j∈Nk one has Gj(k)=μj(k)r×Dk(F)(k), where Dk(F)(k)=∏iμni(k). Indeed G(k)=Hom⁡(M,k×)≅(k×)r×Dk(F)(k) by [F2], and Gj(k) is the set of characters χ of M with χj=1, i.e. Hom⁡(M/jM,μj(k)). Since M/jM≅(Z/j)r⊕⨁iZ/gcd⁡(j,ni)≅(Z/j)r⊕F, and μj(k) contains all ni-th roots of unity because ni∣j and j∈Nk with k algebraically closed, this set is μj(k)r×∏iμni(k).

4.1step 1.1step 2.1step 3.1

I claim that T:=⋃j∈NkGj(k) is dense in ∣G∣. By [step 3.1], T contains (⋃jμj(k))r×Dk(F)(k), where j runs over the multiples of N in Nk. The inner union is the set of all roots of unity whose order lies in Nk: it is infinite, and an infinite subset of Gm(k)=k× is dense in Gm because a nonzero polynomial has finitely many roots; its r-fold Cartesian power is dense in Gmr: a Laurent polynomial vanishing on that grid is zero, by induction on r and comparison of coefficients after fixing the other variables in the infinite set. Thus (⋃jμj(k))r is dense in Gmr. By [step 2.1] the ni lie in Nk, so k[Z/(ni)]≅kni and every point of the finite group Dk(F)≅∏iμni is a k-point, while G≅Gmr×kDk(F) by [step 1.1]; a product of a dense subset with the full point set of the second factor is dense. Hence T is dense in ∣G∣.

5.1F7step 1.2step 4.1∎

By [step 4.1] the set T⊆Z(k) is dense in the reduced finite-type k-scheme G, and k is algebraically closed, so [F7] applies with S=T and gives Z=G.

Depends on

Used by

Dependency tree · two levels

45 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources