Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Every affine-group comodule is a union of finite-dimensional rational submodules

Statement

Let G be a complex affine algebraic group and c:V→V⊗H, H=C[G], a right comodule as in Classical complex affine algebraic actions and rational modules. Every finite subset of V is contained in a finite-dimensional subcomodule W. Evaluation of c gives a linear G-action, and its restriction to every such W is algebraic; hence V is a rational G-module and is the directed union of finite-dimensional rational submodules. This proof is choice-free.

Facts & Assumptions

Given: A right H-comodule c and its coassociativity and counit identities; H has the group coordinate maps in Classical complex affine algebraic actions and rational modules.

Proof

1.1givenalgebra

Write c(v)=∑i=1nvi⊗hi with the hi linearly independent, eliminating redundancies from a finite tensor expression, and put Wv=span⁡(v1,…,vn). The counit gives v=∑iε(hi)vi∈Wv. With q:V→V/Wv, coassociativity gives ∑ic(vi)⊗hi=∑ivi⊗Δ(hi). Apply q to the first factor: the right side is zero and independence of the hi gives (q⊗id⁡)c(vi)=0. Thus c(vi)∈Wv⊗H, since the kernel of q⊗id⁡ is Wv⊗H over a field. Indeed write any finite tensor expression with independent second-factor coefficients; its image under q⊗id⁡ is zero exactly when each first-factor coefficient lies in Wv. This proves the kernel assertion without an infinite basis.

2.1step 1.1givenalgebra∎

Sums of finitely many Wv are finite-dimensional subcomodules, so they contain any prescribed finite subset; sums of two such subcomodules also show directedness. Evaluating coassociativity at g,h gives r(g)r(h)=r(gh), and evaluating the counit gives r(e)=id⁡, so r(g−1) is the inverse of r(g). Choose a finite basis of W and write c(wj)=∑iwi⊗aij. The matrix entries aij are regular functions on G, and its determinant is invertible at each point. Its inverse determinant is regular: the inverse matrix is the regular matrix (S(aij)), so determinants multiply to 1 as functions in H. Therefore g↦(aij(g)) is a morphism to GL(W), proving rationality. Only finite bases and finite elimination were used.

Depends on

Used by

Dependency tree · two levels

4 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