Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 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.

Field antisymmetrizers have rank-one own-shape image and detect dominance

Statement

Let F be any field, n≥0, and λ⊢n with λ-tableau t. Then

κt MFλ=F et,et≠0,

a rank-one image over F. If μ⊢n and κtMFμ≠0, then λ dominates μ. The statements include fields of characteristic two and the case n=0; no division by a group order and no averaging occurs.

Facts & Assumptions

Given: A field F, an integer n≥0, partitions λ,μ⊢n, a λ-tableau t, and the field-valued tabloid modules MFλ, MFμ obtained by base change from the integral ones.

[F1]

MZλ and MZμ are the free Z-modules on the tabloids and MFλ≅F⊗ZMZλ, with the tabloids as F-basis (Integral Specht lattice and base change).

[F2]

κt=∑γ∈Ctsgn⁡(γ)γ, et=κt⋅{t}, and Ct∩Rt={1}, so the coefficient of {t} in et is 1 and et≠0 over every coefficient ring (Column antisymmetrizers, polytabloids, and Specht modules).

[F3]

The μ-tabloids form a basis of MFμ and Rs is the stabilizer of the tabloid {s} (Young subgroups, tabloids, and permutation modules).

[F4]

If two entries in one row of {s} lie in one column of t, then κt⋅{s}=0 (Column collision cancels antisymmetrization).

[F5]

If every row of a μ-tableau s meets every column of t in at most one entry, then λ⊵μ; and if λ=μ there are ρ∈Rs, γ∈Ct with ρ⋅s=γ⋅t (Basic row-column incidence lemma).

[F6]

λ⊵μ means that every prefix sum of λ is at least the corresponding prefix sum of μ (Dominance order on partitions).

[F7]

Over C, κtMCλ=Cet with et≠0, and if κtMCμ≠0 then λ⊵μ (The antisymmetrizer image in its own tabloid module is one-dimensional, Nonzero antisymmetrizer image detects dominance).

Proof

technique · direct
1.1givenF2algebra

For γ,δ∈Ct the sign is multiplicative, so in the group algebra over any ring κtγ=sgn⁡(γ)κt and in particular κt2=∣Ct∣κt; and κt acts F-linearly on MFλ through the group action. Moreover the coefficient of {t} in et is 1 by [F2], so et≠0 over F.

1.2givenF3F4algebra

Let {s} be a μ-tabloid whose row contains two entries x,y lying in one column of t, so that τ=(xy)∈Ct. Writing Z for a set of left coset representatives of ⟨τ⟩ in Ct gives the integral group-algebra identity κt=∑z∈Zsgn⁡(z)z(1−τ); since τ∈Rs fixes the tabloid {s} by [F3], applying this to {s} gives κt{s}=∑z∈Zsgn⁡(z)(z{s}−zτ{s})=0. This is an identity between integral vectors, so it holds in MZμ and hence over F: the collision criterion of [F4] is field-independent.

2.1givenF3F5step 1.1step 1.2algebra

Suppose κt{s}≠0 for a μ-tabloid {s}. Then step 1.2 shows no row of {s} contains two entries from one column of t, i.e. every row of a representing tableau meets every column of t in at most one entry; by [F5] this gives λ⊵μ, and when λ=μ it gives ρ∈Rs, γ∈Ct with ρ⋅s=γ⋅t. In the equal-shape case κt{s}=κt{ρ⋅s}=κtγ⋅{t}=sgn⁡(γ)κt{t}=sgn⁡(γ)et by step 1.1.

3.1givenF1F2step 2.1algebra

Every element of MFλ is an F-combination of λ-tabloids, and by step 2.1 each κt{s} is either 0 or ±et; hence κtMFλ⊆Fet. Since et=κt{t}≠0 lies in the image, κtMFλ=Fet, as asserted.

3.2givenF1F6step 2.1

If κtMFμ≠0, some μ-tabloid {s} satisfies κt{s}≠0, so step 2.1 gives λ⊵μ in the order of [F6].

4.1givenF2F5F7step 3.1step 3.2∎

Over C the conclusions of steps 3.1 and 3.2 are exactly the published statements [F7]; the present proof rederives them over an arbitrary field from the integral collision identity of step 1.2 and the combinatorial lemma [F5], both of which involve only coefficients 0,±1, so the argument applies in characteristic two. For n=0 the empty tableau has κt=1 and et={∅}≠0, the only partition is ∅ with ∅⊵∅, and the three displayed claims hold.

Depends on

Used by

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