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.
The cyclic fixed-space data recovers an rational character
Example
Let , , and be the usual rational characters of . Their fixed-space dimensions on the cyclic subgroups , , and are
Hence a character is recovered uniquely from its cyclic fixed-space data.
Facts & Assumptions
Given: The group , its cyclic subgroups , , and , and a rational character .
Cyclic fixed-space data determines a rational virtual character (Cyclic fixed-space dimensions detect rational virtual characters).
For a representation , the fixed subspace is the subspace of vectors fixed by every element of (The fixed subspace of a representation).
On , the one-dimensional sign representation acts trivially on and by on a transposition, while the two-dimensional standard representation is fixed pointwise by the identity, has a one-dimensional fixed line for a transposition, and has no nonzero fixed vector for a -cycle.
Verification
By [F2] and [A1], the trivial representation has fixed-space dimensions on , the sign representation has , and the standard representation has . This is exactly the displayed table.
Therefore the cyclic fixed-space data of is . The coefficient matrix has determinant , so these three numbers determine , , and uniquely.
Thus the cyclic fixed-space data recovers the rational character , which is the concrete instance of [F1].
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
12 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
- Tammo tom Dieck, Representation Theory, Theorem (4.5.3) (standard reference, not scraped)
- Tammo tom Dieck, Representation Theory, Section 4.4 Example (4.4.5) (standard reference, not scraped)