Alphabeta Math
TheoremStatement: 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.

A finitely generated affine group scheme has a faithful finite-dimensional representation

Statement

Assume the Axiom of Choice. Let k be a field and let A be a finitely generated commutative Hopf algebra over k (Commutative Hopf algebras over a field); put G=Spec⁡A, an affine group scheme of finite type over k (Group schemes of finite type over a field). Then there are a nonzero finite-dimensional k-vector space V and a closed immersion of group schemes G↪GL⁡V (Closed immersions of schemes); choosing a basis identifies GL⁡V with GL⁡n over k. Equivalently, G admits a faithful finite-dimensional rational representation, and one can be chosen as a subrepresentation of the regular representation (A,Δ). Moreover the same conclusion holds for every affine group scheme of finite type over k; that form additionally uses An affine scheme of finite type over a field has a finitely generated coordinate ring. AC supplies affine quasi-compactness for the finite-type scheme assertions; the finite-subcomodule construction and surjective coefficient-ring calculation are choice-free.

Facts & Assumptions

[F1]

The regular coaction Δ ⁣:A→A⊗kA makes A an A-comodule, a rational representation of G corresponds to an A-comodule structure, and the associated morphism G→GL⁡n of a finite-dimensional comodule with basis e1,…,en and coefficients Δ(ej)=∑iei⊗aij has comorphism xij↦aij; the coefficients satisfy Δ(aij)=∑lail⊗alj and ε(aij)=δij. (Rational representations and comodules of an affine group scheme, Rational representations of an affine group scheme are comodules of its coordinate Hopf algebra)

[F2]

Every finite subset of a comodule lies in a finite-dimensional subcomodule. (Every element of a comodule lies in a finite-dimensional subcomodule)

[F3]

The antipode identity gives ∑lS(ail)alj=ε(aij)=∑lailS(alj), so a square matrix with these entries has two-sided inverse (S(aij)) and unit determinant; the coordinate ring of GL⁡n is k[xij,d−1] with points the invertible matrices. (Commutative Hopf algebras over a field, A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit, The general linear group scheme and its coordinate ring)

[F4]

A surjective homomorphism B→A of commutative rings induces a closed immersion Spec⁡A→Spec⁡B. (A surjective ring map induces a closed immersion of affine spectra)

[F5]

An affine group scheme of finite type over k has finitely generated coordinate ring; this is the declared use of AC. (An affine scheme of finite type over a field has a finitely generated coordinate ring, The Axiom of Choice)

Proof

Given: AC, a field k, a finitely generated commutative Hopf algebra A over k, and G=Spec⁡A.

1.1F1F2

Choose finitely many k-algebra generators g1,…,gm of A. By [F1] the coaction Δ makes A a comodule over itself, the regular representation, so by [F2] there is a finite-dimensional subcomodule V⊆A containing 1,g1,…,gm. Since ε(1A)=1k≠0, one has 1A≠0; hence V≠0 because it contains 1.

2.1F1F3step 1.1

Choose a basis e1,…,en of V and write Δ(ej)=∑iei⊗aij with aij∈A. By [F1] the coefficient identities Δ(aij)=∑lail⊗alj and ε(aij)=δij hold, and by the antipode identity of [F3] the matrix (aij) over A has two-sided inverse (S(aij)), so det⁡(aij) is a unit. Hence Φ ⁣:k[xij,d−1]→A, xij↦aij, d−1↦det⁡(aij)−1, is a well-defined k-algebra homomorphism, and by [F1] it is the comorphism of the rational representation r ⁣:G→GL⁡n associated with the subcomodule V⊆A.

3.1F1step 1.1step 2.1algebra

The image of Φ contains every aij=Φ(xij), and the counit identity (ε⊗id⁡)Δ=id⁡ gives ej=∑iε(ei)aij∈im⁡Φ; hence V⊆im⁡Φ. Since im⁡Φ is a k-subalgebra of A containing 1 and all generators g1,…,gm of A, it is all of A: Φ is surjective.

4.1F1F4step 2.1step 3.1algebra

By [F4] the morphism Spec⁡Φ ⁣:G→GL⁡n is a closed immersion. It is a morphism of group schemes: on R-points it is the group homomorphism rR (with GL⁡n(R) the invertible matrices), and two k-morphisms of affine schemes are equal exactly when they induce the same maps on R-points for every commutative k-algebra R, because the functor of points is fully faithful by the Yoneda lemma (The Yoneda bijection Nat⁡(C(a,−),F)≅F(a) is natural in both a and F, Affine schemes are contravariantly equivalent to commutative rings). Applying this to the morphisms mGL⁡n∘(r×r) and r∘mG and to the unit and inverse identities yields the three defining identities of a group-scheme morphism (Morphisms and closed subgroup schemes of group schemes). The representation is faithful: surjectivity of Φ makes g↦g∘Φ injective on R-points for every commutative k-algebra R, so each rR is injective. Choosing a basis identifies GL⁡V with GL⁡n and realizes the representation on the nonzero finite-dimensional space V, a subrepresentation of the regular representation.

5.1F5step 4.1given∎

If G is any affine group scheme of finite type over k, then A=O(G) is a finitely generated k-algebra by [F5], using the assumed AC; steps 1.1-4.1 apply verbatim and produce the faithful finite-dimensional representation. The algebraic construction from a finitely generated Hopf algebra is choice-free: the coefficient calculation is finite, [F4] is choice-free, and [F2] uses only finite tensor expressions. AC is used to regard the constructed affine group objects, including GL⁡n, as finite-type schemes via affine quasi-compactness.

Depends on

Used by

Dependency tree · two levels

86 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