False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29

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.

FALSE: every value of an irreducible complex character is real

Statement

The statement "every value of an irreducible complex character is real" is false: the nontrivial one-dimensional characters of $A_{4}$ take the primitive cube root of unity $ω = e^{2 π i / 3}$ , which is not real, on the $3$ -cycles.

Facts & Assumptions

Given: The group $A_{4}$ , a primitive cube root of unity $ω$ , and the irreducible character $χ$ of the character table with $χ ((123)) = ω$ .

[F1]

The character table of $A_{4}$ contains the irreducible character $χ$ with $χ ((123)) = ω$ and $χ ((132)) = ω^{2}$ (The character table of $A_{4}$ ).

[A1]

A primitive cube root of unity $ω$ satisfies $ω \notin R$ : its imaginary part is nonzero.

Refutation

technique · construct

1.1F1given

By [F1], the irreducible character $χ$ of $A_{4}$ satisfies $χ ((123)) = ω$ .

2.1A1step 1.1

By [A1], $ω \notin R$ , so this value of the irreducible character $χ$ is not real.

3.1step 2.1discharge-construct: counterexample∎

Hence the claimed statement, that every value of an irreducible complex character is real, is refuted by the character $χ$ at $(123)$ .

Depends on

The character table of $A_4$

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 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 3.5 (standard reference, not scraped)