Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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 S_5 character table by fixed-tabloid reconstruction

Example

Take n=5 and order the partitions in James's dictionary order (5),(4,1),(3,2),(3,1,1),(2,2,1),(2,1,1,1),(15) for both rows and columns, a linear extension of dominance with the most dominant partition first; this column order is the reverse of the usual one: here the degrees appear in the last column. Counting the elements of the Young subgroups Sλ by cycle type gives A=(2430202015101060836100223410002031000012100000110000001), with M=diag⁡(120/∣Cρ∣) for the class sizes ∣Cρ∣=24,30,20,20,15,10,1. Solving the Gram equation BTB=AMAT of Fixed-tabloid reconstruction of the character table (Fox–Mullineux) for the nonnegative upper-triangular matrix B gives B=(∣Sν∣Kλν) with diagonal (120,24,12,6,4,2,1) and nonzero entries B(4,1),(3,1,1)=12, B(3,2),(2,2,1)=8, B(2,2,1),(2,1,1,1)=4, etc.; explicitly, B=(120241264210241212864001268650006466000044500000240000001). Then C=B(AT)−1 is the character table C=(1111111−10−110240−11−11151000−20601−1−11−15−10110−241−1−111−11) and det⁡C=∏λ⊢5∏iλi=5⋅4⋅6⋅3⋅4⋅2⋅1=2880; e.g. ⟨χ(3,2),χ(2,2,1)⟩=1120(24⋅0+30⋅(−1)+20⋅(−1)+20⋅1+15⋅1+10⋅(−1)+1⋅25)=0.

Facts & Assumptions

Given: The partitions of 5 in the dictionary order above, the standard Young subgroups Sλ≤S5 (Young subgroups, tabloids, and permutation modules), the conjugacy classes of S5 indexed by cycle type with sizes ∣Cρ∣ (The conjugacy classes of Sn are indexed by the tuples (c1,…,cn) with ∑kck=n), and the integers aλρ=∣Sλ∩Cρ∣, zρ=∏iimi(ρ)mi(ρ)! of Fixed-tabloid reconstruction of the character table (Fox–Mullineux).

[F1]

The centralizer order is zρ=∣CS5(ρ)∣ and ∣Cρ∣=120/zρ (If σ∈Sn has ck cycles of length k, then ∣CSn(σ)∣=∏k=1nkckck!).

[F2]

Sλ is the direct product of the symmetric groups of the blocks of λ, of order ∏iλi!, and its elements are the tuples of permutations of the blocks, so the cycle type of an element is the union of the cycle types of its block permutations (Young subgroups, tabloids, and permutation modules, The conjugacy classes of Sn are indexed by the tuples (c1,…,cn) with ∑kck=n).

[F3]

Kλν counts semistandard tableaux of shape λ and content ν (Semistandard tableaux and Kostka numbers), and bλν=∣Sν∣Kλν in the notation of the theorem, whose uniqueness statement identifies the matrix B (Fixed-tabloid reconstruction of the character table (Fox–Mullineux), Young's rule for complex permutation modules).

[F4]

The character inner product is ⟨φ,ψ⟩=1120∑ρ∣Cρ∣ φ(Cρ)ψ(Cρ)‾ (The standard inner product on cf(G), Virtual characters and the character ring R(G) of a finite group), and the entries of C are the values of the irreducible characters χλ (The character table of a finite group).

Verification

technique · direct
1.1F1givenalgebra

The class sizes and M. By [F1], zρ=∏iimi(ρ)mi(ρ)! evaluates to 5,4,6,6,8,12,120 on the classes (5),(4,1),(3,2),(3,1,1),(2,2,1),(2,1,1,1),(15): for instance z(3,1,1)=3⋅12⋅2!=6 and z(2,2,1)=22⋅2!⋅1=8. Hence ∣Cρ∣=120/zρ is 24,30,20,20,15,10,1 and M=diag⁡(5,4,6,6,8,12,120).

1.2F2givenalgebra

The matrix A. By [F2] the cycle types in Sλ are obtained by combining the cycle types of the blocks. The single-block counts used are: in S1, type 1: 1; in S2, types 12,2: 1,1; in S3, types 13,2⋅1,3: 1,3,2; in S4, types 14,2⋅12,3⋅1,22,4: 1,6,8,3,6; and in S5 the counts are the class sizes 1,10,15,20,20,30,24 of types 15,2⋅13,22⋅1,3⋅12,3⋅2,4⋅1,5. Combining block counts for each λ (for example, in S(3,2)=S3×S2 the identity gives one element of type 15; a 3-cycle together with the identity gives the 2 elements of type 3⋅12; a 3-cycle with the transposition gives the 2 elements of type 3⋅2; a transposition in S3 combined with the identity, or the identity in S3 combined with the transposition of S2, gives the 3+1=4 elements of type 2⋅13; and a transposition in S3 combined with the transposition in S2 gives the 3 elements of type 22⋅1) yields exactly the displayed matrix A.

1.3F3givenalgebra

The matrix B. By [F3] the entry bλν is ∣Sν∣ times the number of semistandard tableaux of shape λ and content ν; the diagonal is bνν=∣Sν∣=∏iνi!=(120,24,12,6,4,2,1), and the displayed nonzero entries are confirmed by the corresponding counts: b(4,1),(3,1,1)=6⋅2=12, because a semistandard tableau of shape (4,1) and content (3,1,1) must place 2 or 3 in the single lower cell and then is determined; b(3,2),(2,2,1)=4⋅2=8 and b(2,2,1),(2,1,1,1)=2⋅2=4 are checked the same way. The whole displayed matrix B satisfies the Gram equation with the displayed A and M: each entry of BTB is the finite sum ∑λbλνbλμ, and comparing with ∑ρzρaνρaμρ gives, for example, (BTB)(15),(15)=12+42+52+62+52+42+12=120=z(15)=(AMAT)(15),(15) and (BTB)(4,1),(3,2)=24⋅12+24⋅12=576=6⋅8⋅2+8⋅3⋅3+12⋅6⋅4+120=(AMAT)(4,1),(3,2). By the uniqueness clause of [F3] the nonnegative upper-triangular matrix with this Gram matrix and positive diagonal is B, so no other matrix can occur.

2.1step 1.3F3F4algebra

The character table. Multiplying B on the right by the inverse transpose of A gives the displayed C; equivalently, CAT=B, and this is the identity ∑ρχλ(Cρ) aνρ=bλν of the theorem. Two full rows of the product check it: the row (5) consists of ones, and ∑ρaνρ=∣Sν∣=b(5),ν for every ν; for the row (3,2)=(0,−1,1,−1,1,1,5) one gets ∑ρχ(3,2)(Cρ)a(3,2),ρ=0⋅0+(−1)⋅0+1⋅2+(−1)⋅2+1⋅3+1⋅4+5⋅1=12=b(3,2),(3,2) and ∑ρχ(3,2)(Cρ)a(4,1),ρ=(−1)⋅6+(−1)⋅8+1⋅3+1⋅6+5⋅1=0=b(3,2),(4,1); the remaining rows are verified by the same finite sums from the displayed A and B. By the theorem's determinant formula, det⁡C=∏λ⊢5∏iλi=5⋅4⋅6⋅3⋅4⋅2⋅1=2880, the product of all parts of all partitions of 5.

3.1step 1.1step 2.1F4algebra∎

The orthogonality spot check of the example statement: with the class sizes of step 1.1 and the rows of C, ⟨χ(3,2),χ(2,2,1)⟩=1120(24⋅0⋅0+30⋅(−1)⋅1+20⋅1⋅(−1)+20⋅(−1)⋅(−1)+15⋅1⋅1+10⋅1⋅(−1)+1⋅5⋅5)=1120(0−30−20+20+15−10+25)=0, and ⟨χ(3,2),χ(3,2)⟩=1120(30⋅1+20⋅1+20⋅1+15⋅1+10⋅1+25⋅1)=1; the entries are real, so the conjugate in [F4] plays no role. Thus the displayed table is orthonormal on the checked pairs, as a character table must be.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

50 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