Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-28
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 irreducible representation of a finite abelian group over a splitting field is one-dimensional

Statement

Let G be a finite abelian group and let k be a splitting field for G. Then every irreducible representation of G over k has degree 1.

Facts & Assumptions

Given: A finite abelian group G, a splitting field k for G, and an irreducible representation ρ:GGL(V) over k.

[L1]

Over a splitting field, every endomorphism of an irreducible representation is scalar (Over a splitting field, every G-endomorphism of an irreducible representation is scalar).

[L2]

A representation is irreducible exactly when every nonzero invariant subspace is the whole space (Subrepresentations, direct sums of representations, and irreducibility).

Proof

technique · direct
1.1

Because G is abelian, for every g,hG one has ρ(g)ρ(h)=ρ(gh)=ρ(hg)=ρ(h)ρ(g). So each operator ρ(g) commutes with every ρ(h) and therefore lies in EndG(V).

L1L2givenalgebra
2.1

By [L1], each ρ(g) is a scalar operator. Hence for every nonzero vV, the line kv is stable under every ρ(g) and is therefore a nonzero subrepresentation.

step 1.1L1L2given
3.1

Irreducibility from [L2] forces that nonzero line to be all of V. Therefore V is one-dimensional.

step 2.1L2

Depends on

Used by

Dependency tree · two levels

10 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