Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 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 group has degree at most ∣G∣

Statement

Let G be a finite group and let V be an irreducible representation of G over a field k. Then deg⁡(V)≤∣G∣.

Facts & Assumptions

Given: A finite group G, a field k, and an irreducible representation V of G over k.

[L1]

The group algebra k[G] has dimension ∣G∣ over k (If G is finite then dim⁡kk[G]=∣G∣).

[L2]

The representation V is a quotient of the regular representation (Every irreducible representation of a finite group is a quotient of the regular representation).

Proof

technique · direct
1.1L2given

By [L2], there is a surjective linear map q:k[G]→V.

2.1step 1.1L1

The images under q of the ∣G∣ basis vectors of k[G] span V, so V has a spanning set with ∣G∣ elements by [L1].

3.1step 2.1L3L4∎

Let B be a basis of V. Then B is linearly independent, and step 2.1 together with [L3] shows that ∣B∣≤∣G∣. By [L4], ∣B∣=deg⁡(V). Therefore deg⁡(V)≤∣G∣.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

27 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