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: nonisomorphic finite groups always have different character tables
Statement
The statement "nonisomorphic finite groups always have different character tables" is false: the quaternion group and the dihedral group are nonisomorphic finite groups with the same character table.
Facts & Assumptions
Given: The groups and , both of order .
The character table of has five rows with values , , , , and on the classes of , , , , (The character table of ).
The character table of has five rows with values , , , , and on the classes of , , , , (The character table of ).
is the only element of order in ( is a subgroup of with eight elements, and is its only element of order ).
In , the elements and both have order ( with inversion action has order and the dihedral relations).
Refutation
The row sets of [F1] and [F2] are identical as multisets of tuples, so after a row permutation the two tables agree entry for entry.
By [F3], has exactly one element of order , while by [F4] has at least the two elements and of order . The number of elements of order is invariant under isomorphism, so the two groups are not isomorphic.
The two tables have the same number of rows and columns with the same class sizes , , , , , so they are the same character table up to the labelling of the groups.
Steps 2.1 and 1.2 exhibit nonisomorphic finite groups with the same character table, so the claimed statement is refuted.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
22 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
- Peter Webb, A Course in Finite Group Representation Theory, Chapter 3 (standard reference, not scraped)