Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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 e-quotient controls the hooks of e-divisible length

Statement

Let e≥2 and let λ⊢n with e-quotient Qe(λ)=(λ(0),…,λ(e−1)) and e-core Ce(λ) (The e-core, the e-quotient, and the e-weight). Then there is a bijection f from the set of hooks of λ of e-divisible length onto the set of hooks of the multipartition Qe(λ), that is, onto ⨆i=0e−1{hooks of λ(i)}, such that ∣H∣=e ∣f(H)∣andQe(λ∖H)=Qe(λ)∖f(H), where the right-hand side means that the hook f(H) is removed from the single component of Qe(λ) that contains it. On the e-abacus, f is the rescaling b=b′e+i, g=g′e+i of a bead-gap pair (b,g) lying on a common runner i, followed by the bead-gap dictionary of the runner (Hooks are bead-gap pairs on the abacus).

Here and in the quotient components, removing a hook means deleting its corresponding rim border strip as in Hooks are bead-gap pairs on the abacus(ii), rather than its arm-and-leg node set.

No choice principle is used.

Facts & Assumptions

Given: An integer e≥2, a partition λ⊢n, a normalised β-set X={h1>⋯>hm} of λ, so that e∣m=∣X∣, with runner label sets Xi(e), top-packed set X(e) and quotient components λ(i)=P(Xi(e)) as in The e-core, the e-quotient, and the e-weight.

[F1]

For a β-set Y of a partition μ the hooks of μ correspond bijectively to the bead-gap pairs (b,g) of Y, with b∈Y, g∉Y and 0≤g<b, the hook of (b,g) having length b−g; the hook has e-divisible length if and only if b≡g(mode); and removing the hook of (b,g) replaces Y by (Y∖{b})∪{g}, a β-set for the partition μ with that hook removed (Hooks are bead-gap pairs on the abacus).

[F2]

For i∈{0,…,e−1} the runner label set Xi(e) is a β-set for the partition λ(i)=P(Xi(e)), and position ae+i of the abacus lies on runner i at row a, so that the beads of Xi(e) are exactly the beads of X on runner i (The e-core, the e-quotient, and the e-weight, Beta-sets, the shift, and the e-runner abacus of a partition).

[F3]

The chosen β-set is normalised, e∣m; the removal of a hook does not change the number of beads, so the new β-set remains normalised (The e-core, the e-quotient, and the e-weight).

Proof

technique · direct
1.1F1F2

Write a hook H=Hi,j(λ) of e-divisible length in its bead-gap form (b,g) with b∈X, g∉X, 0≤g<b and h:=∣H∣=b−g. By e∣h we have b≡g(mode); write the common residue as s∈{0,…,e−1} and b=b′e+s,g=g′e+s,b′=b−se>g′=g−se≥0. The bead b is a bead of X on runner s and the gap g is a gap of X on runner s.

2.1F1F2step 1.1

Applying step 1.1 conversely, a bead b′∈Xs(e) and a gap g′∉Xs(e) with 0≤g′<b′ give the bead-gap pair (b,g)=(b′e+s,g′e+s) of X with e∣(b−g) and b−g=e(b′−g′). Hence f(H):= the hook of λ(s) attached to the bead-gap pair (b′,g′) of the β-set Xs(e) is well defined, and f is bijective onto the hooks of ⨆iλ(i) because both sides are in bijection with the bead-gap pairs of X whose two positions share a runner, respectively with the union over s of the bead-gap pairs of Xs(e); the length identity is ∣H∣=b−g=e(b′−g′)=e∣f(H)∣.

3.1F1F2F3step 1.1step 2.1

For the removal identity, let X′=(X∖{b})∪{g} be the β-set of λ∖H from [F1], again of size m and hence normalised by [F3]. Because b and g lie on runner s, the beads of X′ on a runner t≠s are exactly the beads of X on runner t, and the beads on runner s have row labels (Xs(e)∖{b′})∪{g′}. Consequently, computing the quotient from the normalised sets by [F2], λ′(t)=P((X′)t(e))=λ(t) (t≠s),λ′(s)=P((Xs(e)∖{b′})∪{g′}), and the last partition is λ(s) with its hook f(H) removed, by [F1] applied to the β-set Xs(e) of λ(s). This is exactly the assertion Qe(λ∖H)=Qe(λ)∖f(H).

4.1step 1.1step 2.1step 3.1∎

Steps 2.1 and 3.1 together exhibit the required bijection f with the length and removal identities, and the description of f on the abacus is the rescaling of step 1.1 followed by the bead-gap dictionary of the runner in step 2.1.

Depends on

Used by

Dependency tree · two levels

8 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