Alphabeta Math
TheoremStatement: Literature-sourcedProof: Literature-sourcedprecheck passaudited 2026-09-07
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.

Absolute irreducibility via the endomorphism division algebra

Statement

Let F have characteristic 0, G be finite, and V be an irreducible finite-dimensional F-representation. Then V is absolutely irreducible if and only if DV=F (via scalar endomorphisms).

Facts & Assumptions

Given: F, G, and V as in the statement.

[L1]

Base change gives EFDVEndG(EFV) for every field extension E/F (Base change for intertwiner spaces).

[L2]

Over a finite splitting field, scalar extension of V is a common multiple of one Galois orbit of absolutely irreducible constituents (Scalar extension of an irreducible finite-group representation).

Proof

technique · direct
1.1

Choose a finite splitting field E/F. If V is absolutely irreducible, then EFV is irreducible, so its endomorphism algebra is E. By [L1], EFDVE, and comparing F-dimensions gives DV=F.

L1choose
1.2

Conversely assume DV=F. Then [L1] makes EndG(EFV) one-dimensional over E.

L1given
2.1

In the decomposition of [L2], either a multiplicity exceeds one or two inequivalent constituents occur whenever EFV is reducible; either case supplies a non-scalar projection endomorphism. This contradicts step 1.2, so EFV is irreducible and V is absolutely irreducible.

L2step 1.2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

13 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