Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-sol)audited 2026-09-30
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.

Column antisymmetrizers, polytabloids, and Specht modules

Definition

Let n≥0, let λ⊢n, and let t be a λ-tableau (Partitions, English diagrams, and conjugation, Tableaux and standard tableaux). Use the left action of Sn on tableaux, tabloids, and Mλ (Young subgroups, tabloids, and permutation modules). For each γ∈Ct, let sgn⁡(γ) be its inversion sign in Sn. The order-preserving relabelling ιn:{1,…,n}→{0,…,n−1}, i↦i−1, carries each inversion pair (i,j) bijectively to (i−1,j−1); thus this sign is exactly the published inversion sign on the finite ordinal (Inversions, inversion number, the sign sgn⁡(σ)=(−1)inv⁡(σ), and even and odd permutations). For n=0, both groups are trivial and the sign is 1.

The column antisymmetrizer, polytabloid, and Specht space are κt:=∑γ∈Ctsgn⁡(γ)γ∈C[Sn],et:=κt⋅{t}∈Mλ,Sλ:=span⁡C{es:s is a λ-tableau}. The elements of the sum are in the finite subgroup Ct, and each acts by the declared left action on the tabloid basis, so these are well-defined finite expressions.

For every tableau, Ct∩Rt={1}: a permutation in both stabilizers preserves the row and column of each entry, and each row-column intersection contains at most one node. Thus γ{t} are distinct as γ ranges over Ct, and the coefficient of {t} in et is 1. In particular, et≠0. When n=0, the empty tableau has Ct={1}, so κt=1, et={∅}, and S∅=C.

Depends on

Used by

Dependency tree · two levels

10 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