Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Trigonalizable algebraic groups

Definition

Let k be a field. An affine algebraic group G over k (an affine group scheme of finite type over k, Affine schemes and their coordinate rings, Group schemes of finite type over a field) is trigonalizable if every simple rational representation of G (Rational representations and comodules of an affine group scheme) has dimension 1 over k.

Equivalently, by the criterion proved as Trigonalizable groups, invariant flags and embeddings into T_n, every finite-dimensional rational representation of G admits a basis in which G acts through upper triangular matrices, i.e. the representation is isomorphic to one factoring through the upper triangular group scheme Tn of some GLn.

Both unipotent groups (Unipotent algebraic groups and unipotent representations) and diagonalizable groups are trigonalizable: for a unipotent group every simple representation is trivial of dimension one by definition, and for a diagonalizable group the character eigenspace decomposition exhibits every simple representation as one-dimensional. The formulation by simple representations is the one used in the induction proving Lie-Kolchin; the flag formulation is the one used to embed trigonalizable groups into Tn.

Depends on

Used by

Dependency tree · two levels

22 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