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 be a complex affine algebraic group and , , a right comodule as in Classical complex affine algebraic actions and rational modules. Every finite subset of is contained in a finite-dimensional subcomodule . Evaluation of gives a linear -action, and its restriction to every such is algebraic; hence is a rational -module and is the directed union of finite-dimensional rational submodules. This proof is choice-free.
Facts & Assumptions
Given: A right -comodule and its coassociativity and counit identities; has the group coordinate maps in Classical complex affine algebraic actions and rational modules.
Proof
Write with the linearly independent, eliminating redundancies from a finite tensor expression, and put . The counit gives . With , coassociativity gives . Apply to the first factor: the right side is zero and independence of the gives . Thus , since the kernel of is over a field. Indeed write any finite tensor expression with independent second-factor coefficients; its image under is zero exactly when each first-factor coefficient lies in . This proves the kernel assertion without an infinite basis.
Sums of finitely many are finite-dimensional subcomodules, so they contain any prescribed finite subset; sums of two such subcomodules also show directedness. Evaluating coassociativity at gives , and evaluating the counit gives , so is the inverse of . Choose a finite basis of and write . The matrix entries are regular functions on , and its determinant is invertible at each point. Its inverse determinant is regular: the inverse matrix is the regular matrix , so determinants multiply to 1 as functions in . Therefore is a morphism to , 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
- Michel Brion, Introduction to actions of algebraic groups (2010) (standard reference, not scraped)
- Philippe Gille, Introduction to reductive group schemes over rings, full notes retrieved 2026-10-02 (standard reference, not scraped)
- J. S. Milne, Algebraic Groups (2022) (standard reference, not scraped)