False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-30

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.

Restriction of an irreducible complex representation is always irreducible

Statement

False claim: if a complex representation of $G$ is irreducible, then its restriction to every subgroup is irreducible.

Facts & Assumptions

Given: The irreducible degree-two character $χ_{2}$ of $S_{3}$ and the subgroup $A_{3} \leq S_{3}$ .

[F1]

The restriction of $χ_{2}$ to $A_{3}$ is $θ + \overline{θ}$ (Restricting that degree-two $S_{3}$ character to the three-cycle subgroup gives the two nontrivial linear characters).

Refutation

technique · direct

1.1givenalgebra

The character $χ_{2}$ is irreducible on $S_{3}$ by the example that constructs it.

2.1F1step 1.1

But [F1] writes its restriction to $A_{3}$ as the sum of two distinct nontrivial characters, so the restricted representation is reducible.

3.1step 2.1∎

Therefore restriction does not preserve irreducibility in general.

Depends on

Restricting that degree-two $S_3$ character to the three-cycle subgroup gives the two nontrivial linear characters

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

3 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

Pavel Etingof et al., Introduction to Representation Theory, Section 4.11 (standard reference, not scraped)