Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

Multiplicative type groups split over a finite Galois extension

Statement

Assume the Axiom of Choice. Let ks be a separable closure of an arbitrary field k. Every finite-type group of multiplicative type over k is diagonalizable over ks, and over a finite Galois subextension L/k of ks/k.

Facts & Assumptions

[F1]

Multiplicative type has the full fpqc group-scheme convention of Groups of multiplicative type and tori. Assuming AC, Affineness of a field form of a diagonalizable group proves affineness and splitting over a field.

[A1]

Assume The Axiom of Choice; its use is precisely the affine field-descent interface in F1.

[F2]

Finite coalgebra pieces and their split duals are supplied by Finite coalgebra pieces of a multiplicative coordinate algebra.

[F3]

Monomials are all characters, and finite algebra generation is equivalent to finite group generation: Split diagonalizable groups are dual to abelian groups.

[F4]

Normal separable finite extensions are Galois: Equivalent characterizations of a finite Galois extension. The separable closure ks is fixed as part of the given data; this item does not construct it.

Proof

Given: AC and a finite-type group scheme G of multiplicative type. By F1 write G=Spec⁡A and choose a field extension K/k splitting it.

1.1F1A1F2F4algebra

The affineness and splitting data supplied by F1 give A and the extension K, so the calculation below takes place in the coordinate algebra of G over the splitting field. For a finite subcoalgebra C⊂A, the finite algebra E=C∗ is commutative (commutators vanish after the faithful extension to K) and satisfies E⊗K≅Kd by F2. For each a∈E, let fa be its minimal polynomial over k. The independent powers preceding its degree stay independent under extension, so fa is also the minimal polynomial over K. In Kd, that polynomial is the product of the distinct linear factors associated to the coordinate values of a. Thus fa is separable over k. Choose a finite algebra generating set of E, for example a vector-space basis. Over ks, each generator has a split squarefree minimal polynomial, whose Lagrange interpolation idempotents decompose the algebra into factors on which that generator is a scalar. Repeating with the finitely many generators decomposes E⊗ks into factors generated only by scalars, hence copies of ks. Dualizing shows that C⊗ks is spanned by group-like elements. Every element of A belongs to a finite subcoalgebra by F2, so A⊗ks is spanned by its group-like elements.

2.1step 1.1F3algebra

Distinct group-like elements in any coalgebra are linearly independent. Otherwise take a shortest relation, write one as g=∑i=1raigi with the gi independent and all ai≠0, and compare Δ(g) with g⊗g. In the independent tensor family gi⊗gj, the off-diagonal coefficients give aiaj=0 for i≠j, so r=1; the diagonal and counit then give a1=1, contrary to distinctness. In a Hopf algebra the group-like elements form an abelian group under multiplication with inverse S. Therefore their spanning and independence identify A⊗ks with ks[M] as a Hopf algebra. F3 implies that M is finitely generated.

3.1F3F4step 2.1algebra∎

Choose finite generators m1,…,mr of M. Their corresponding group-like elements are finite sums of tensors, so all their coefficients lie in a finite separable extension of k. Enlarge it inside ks by adjoining all roots of the finitely many separable minimal polynomials of its generators. This gives a finite normal separable extension L, which is Galois by F4. The corresponding group-like elements and their inverses define a Hopf map L[M]→A⊗L which becomes the isomorphism of step 2.1 after extension to ks. A map of vector spaces is injective and surjective if it becomes so after field extension: kernels and cokernels tensor exactly, and a nonzero vector stays nonzero. Thus the map is already an isomorphism over L.

Depends on

Used by

Dependency tree · two levels

24 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