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 Brauer table of S3 in characteristic two
Example
In a splitting -modular system for , the trivial module and the natural two-dimensional module have Brauer rows and on the classes of and ; these exhaust the simple modules.
Facts & Assumptions
Given: A splitting 2-modular system, with the matrices over the prime field embedded in k.
Lift the eigenvalues individually to obtain Brauer values (Lifted modular trace on p-regular elements).
Distinct simple Brauer characters are independent on p-regular conjugacy classes (Irreducible Brauer characters are independent on p-regular elements).
Verification
Set and . Direct multiplication gives , , and . The six matrices are distinct. Acting on the three nonzero vectors of embeds this group in ; its size six identifies it with .
The polynomial of r is , with distinct nontrivial cube roots in k. An invariant line for r must be one of its eigenlines. From , t sends the -eigenline to the -eigenline, which is different. Hence no line is invariant under both; the two-dimensional representation is simple, and the same argument holds over every extension field.
Writing , the identity has value 2 and r has value , since and . The trivial representation has values 1,1. Thus the determinant is , nonzero in K and with residue 1 in k.
The p-regular permutations are the identity and the two conjugate 3-cycles, hence give exactly two classes. By independence at most two nonisomorphic simple modules can have characters on this two-dimensional space of class functions. The two already exhibited are nonisomorphic by dimension and simple, so exhaust the possibilities.
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
- Webb, A Course in Finite Group Representation Theory, Section 10.1 pp.169–171 and Theorem 10.2.2 p.176 (standard reference, not scraped)