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.
Equal removable-hook counts do not replace the core test
Statement refuted
The number of removable -hooks of a partition determines its -core; in particular two partitions of with the same number of removable -hooks lie in the same -block of the symmetric group.
Facts & Assumptions
Given: The prime and the partitions and of , with their Young diagrams and hook lengths (Hook, arm, leg, and hook length of a box).
For a node of , its hook length is (Hook, arm, leg, and hook length of a box). A removable rim strip is a nonempty edge-connected skew diagram containing no block whose deletion leaves a partition (Removable border strips and their height). Node hooks correspond bijectively to removable rim strips, preserving size; hence the number of removable -strips equals the number of node hooks of length (Hooks of a partition correspond bijectively to removable border strips).
-core and abacus: for a -set of the top-packed set is obtained by sliding every bead up as far as possible on its own runner, , and is the terminal partition of every maximal sequence of removals of removable border strips of size ; a partition is an -core exactly when it has no hook of length (The e-core, the e-quotient, and the e-weight, Beta-sets, the shift, and the e-runner abacus of a partition, The e-core is independent of the rim hook removal order).
Nakayama: two Specht modules of over a splitting field of characteristic lie in the same block if and only if their labels have the same -core (Nakayama block classification for symmetric groups).
Counterexample
The partition . Its hook-length diagram is the single row , so by [F1] the unique hook of length is , a horizontal rim hook of size spanning the nodes whose removal leaves the partition ; hence has exactly one removable -hook. Its -set is , a single bead on runner at row ; top-packing slides it to row , so and , a -core since and has hook lengths .
The partition . Its hook-length diagram is in the first row and in the second, so by [F1] the unique hook of length is , whose rim hook is the horizontal strip with complement ; hence also has exactly one removable -hook. Its -set is , with on runner at row and on runner at row ; top-packing slides the bead to the position , so and , a -core since has hook lengths .
The two partitions therefore have the same number (one) of removable -hooks, but their -cores are the distinct partitions and of size ; by [F3] the Specht modules and lie in different blocks of for every splitting field of characteristic . The top-packed abacus test of [F2] distinguishes the two configurations (one bead on runner versus beads on runners and ), while the local removable-hook count does not, so no such count can replace the core test.
Both partitions have -weight , so even the weight may agree while the blocks differ; the invariant that separates them is the runner distribution of the beads, not the number of removable hooks.
Depends on
- Removable border strips and their height
- Hooks of a partition correspond bijectively to removable border strips
- The e-core is independent of the rim hook removal order
- The e-core, the e-quotient, and the e-weight
- Nakayama block classification for symmetric groups
- Hook, arm, leg, and hook length of a box
- Beta-sets, the shift, and the e-runner abacus of a partition
Used by
Nothing in the library uses this result yet.
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
- Stacey Law (lecturer), notes by Leonard Tomczak, Representation Theory of Symmetric Groups, Cambridge Part III Michaelmas 2022 lecture notes, complete 76-page PDF (standard reference, not scraped)
- Andrew Mathas, Hecke algebras and Schur algebras of the symmetric group, complete 79-page prepublication manuscript (1998; expanded AMS University Lecture Series 15 edition, 1999) (standard reference, not scraped)