Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-02
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.

Modular Specht modules need not be simple, and form heads can vanish

Statement refuted

Every nonzero modular Specht module Skλ⊆Mkλ is simple, and its invariant-form quotient Dλ=Skλ/Rλ is nonzero; in particular the Gram matrix and its quotient detect nonzero Specht modules in every characteristic.

Facts & Assumptions

Given: A prime p and a splitting p-modular system (K,O,k) for Sn (A splitting p-modular system for a finite group is a p-modular system whose fraction and residue fields split the needed group algebras), with the base-changed Specht module Skλ⊆Mkλ and its quotient Dλ=Skλ/Rλ (Integral Specht lattice and base change, Modular Specht form and radical quotient). For the first witness p=3, n=3, λ=(2,1) and the two standard tableaux t=123, u=132; for the second witness p=2, n=4, λ=(2,2).

[F1]

The standard polytabloids form a basis of Skλ over every field k, and dim⁡kSkλ is the number of standard λ-tableaux (Integral Specht lattice and base change, Tableaux and standard tableaux). In particular dim⁡kSk(2,1)=2 with basis et,eu, and dim⁡kSk(2,2)=2 with basis the polytabloids of the standard tableaux 12/34 and 13/24.

[F2]

The (2,1)-tabloids are the three tabloids v1,v2,v3, where vi is the tabloid whose singleton second row is {i}; they form a k-basis of Mk(2,1), and σ acts by relabelling the entries, so σ⋅vi=vσ(i) (Young subgroups, tabloids, and permutation modules).

[F3]

For a tableau t one has κt=∑γ∈Ctsgn⁡(γ)γ and et=κt⋅{t}; here Ct={1,(13)} for t=12/3 and Cu={1,(12)} for u=13/2, and (13)⋅t and (12)⋅u both have singleton second row {1} (Column antisymmetrizers, polytabloids, and Specht modules). Consequently et=v3−v1 and eu=v2−v1 in Mk(2,1), for every field k.

[F4]

The integral tabloid form β has the tabloids as an orthonormal basis; its scalar extension βk is symmetric and nondegenerate, and Rλ=Skλ∩(Skλ)⊥ with dim⁡kDλ=rank⁡k(Gλ mod p) (Integral tabloid form and Specht Gram matrix, Modular Specht form and radical quotient).

[F5]

The example Specht Gram rank for shape (2,2) computes G(2,2)=(4224) and its reductions: rank⁡2(G(2,2) mod 2)=0, while dim⁡kSk(2,2)=2 in every characteristic.

[F6]

For a p-modular system as above, Dλ≠0 if and only if λ is p-regular (Nonzero modular Specht quotient criterion).

[F7]

A k[Sn]-module is simple when it is nonzero and has no proper nonzero submodule; a subspace closed under the action is a submodule (Simple module: a nonzero module with no proper nonzero submodule, Submodule of a module).

Counterexample

technique · direct
1.1givenF1F2F3F7algebra

Take k of characteristic 3 and λ=(2,1), so n=3. By [F1] and [F3] the module Sk(2,1) has k-basis et=v3−v1, eu=v2−v1, and et+eu=(v3−v1)+(v2−v1)=v1+v2+v3−3v1=v1+v2+v3=:w because 3v1=0 in characteristic 3. In particular w∈Sk(2,1) and w≠0, since its coefficients at the basis vectors v1,v2,v3 are all 1. For every σ∈S3 one has σ⋅w=vσ(1)+vσ(2)+vσ(3)=w by [F2], so the one-dimensional subspace kw⊆Sk(2,1) is a submodule. It is proper because dim⁡kSk(2,1)=2 by [F1]. Hence Sk(2,1) has a proper nonzero submodule and is not simple by [F7]; the characteristic-3 witness is a nonzero two-dimensional modular Specht module with a one-dimensional trivial submodule.

1.2givenF4F5F6algebra

Take k of characteristic 2 and λ=(2,2), so n=4. By [F5] the reduction of the integral Gram matrix G(2,2) modulo 2 is the zero matrix, of rank 0; by the dimension formula of [F4] this gives dim⁡kD(2,2)=rank⁡2(G(2,2) mod 2)=0, so D(2,2)=0 while Sk(2,2)≠0 of dimension 2 by [F5]. Equivalently, (2,2) has the part 2 occurring twice and is 2-singular, so [F6] also predicts D(2,2)=0. Thus the Gram quotient of a nonzero modular Specht module can vanish.

2.1givenF6step 1.1step 1.2∎

Step 1.1 exhibits a nonzero modular Specht module that is not simple, and step 1.2 exhibits a nonzero modular Specht module whose invariant-form quotient is zero; the two failures are independent, since the first occurs for a p-regular label (where D(2,1)≠0 by [F6]) and the second for a p-singular one. Hence the statement refuted fails in both clauses, and no field-independent appeal to the ordinary-case simplicity or to nonvanishing of the form quotient is available in prime characteristic.

Remarks

  • The quotient in the characteristic-3 witness. Quotienting Sk(2,1) by kw leaves a one-dimensional module; from (12)⋅et=v3−v2 and v3−v2+et=2v3−v1−v2=3v3−w≡0 one computes (12)⋅(et+kw)=−et+kw in characteristic 3, so the transposition acts by −1 on the quotient and the quotient is the sign representation. With step 1.1 this is the factor list [Sk(2,1)]=[D(3)]+[D(2,1)] at p=3, matching the decomposition matrix of James Example 12.4 for S3 (Dominance unitriangularity of the symmetric-group decomposition matrix).
  • What is not claimed about the characteristic-2 witness. Step 1.2 only refutes nonvanishing of the form quotient for Sk(2,2); nothing here asserts that Sk(2,2) is or is not simple in characteristic 2.
  • No detection criterion is claimed. The reduction of the Gram matrix computes dim⁡kDλ and hence detects whether Dλ≠0 (Modular Specht form and radical quotient); it does not detect reducibility of Skλ, as the characteristic-3 witness shows, where D(2,1)≠0 and yet Sk(2,1) is reducible.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

34 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