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 and let with -quotient and -core (The e-core, the e-quotient, and the e-weight). Then there is a bijection from the set of hooks of of -divisible length onto the set of hooks of the multipartition , that is, onto , such that where the right-hand side means that the hook is removed from the single component of that contains it. On the -abacus, is the rescaling , of a bead-gap pair lying on a common runner , 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 , a partition , a normalised -set of , so that , with runner label sets , top-packed set and quotient components as in The e-core, the e-quotient, and the e-weight.
For a -set of a partition the hooks of correspond bijectively to the bead-gap pairs of , with , and , the hook of having length ; the hook has -divisible length if and only if ; and removing the hook of replaces by , a -set for the partition with that hook removed (Hooks are bead-gap pairs on the abacus).
For the runner label set is a -set for the partition , and position of the abacus lies on runner at row , so that the beads of are exactly the beads of on runner (The e-core, the e-quotient, and the e-weight, Beta-sets, the shift, and the e-runner abacus of a partition).
The chosen -set is normalised, ; 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
Write a hook of -divisible length in its bead-gap form with , , and . By we have ; write the common residue as and The bead is a bead of on runner and the gap is a gap of on runner .
Applying step 1.1 conversely, a bead and a gap with give the bead-gap pair of with and . Hence the hook of attached to the bead-gap pair of the -set is well defined, and is bijective onto the hooks of because both sides are in bijection with the bead-gap pairs of whose two positions share a runner, respectively with the union over of the bead-gap pairs of ; the length identity is .
For the removal identity, let be the -set of from [F1], again of size and hence normalised by [F3]. Because and lie on runner , the beads of on a runner are exactly the beads of on runner , and the beads on runner have row labels . Consequently, computing the quotient from the normalised sets by [F2], and the last partition is with its hook removed, by [F1] applied to the -set of . This is exactly the assertion .
Steps 2.1 and 3.1 together exhibit the required bijection with the length and removal identities, and the description of 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.