Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: 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.

Equal removable-hook counts do not replace the core test

Statement refuted

The number of removable p-hooks of a partition determines its p-core; in particular two partitions of n with the same number of removable p-hooks lie in the same p-block of the symmetric group.

Facts & Assumptions

Given: The prime p=3 and the partitions λ=(5) and μ=(4,1) of 5, with their Young diagrams and hook lengths (Hook, arm, leg, and hook length of a box).

[F1]

For a node (i,j) of [ν], its hook length is hi,j(ν)=νi−j+νj′−i+1 (Hook, arm, leg, and hook length of a box). A removable rim strip is a nonempty edge-connected skew diagram containing no 2×2 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 p-strips equals the number of node hooks of length p (Hooks of a partition correspond bijectively to removable border strips).

[F2]

e-core and abacus: for a β-set X of ν the top-packed set X(e) is obtained by sliding every bead up as far as possible on its own runner, Ce(ν)=P(X(e)), and Ce(ν) is the terminal partition of every maximal sequence of removals of removable border strips of size e; a partition is an e-core exactly when it has no hook of length e (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).

[F3]

Nakayama: two Specht modules of k[Sn] over a splitting field k of characteristic p lie in the same block if and only if their labels have the same p-core (Nakayama block classification for symmetric groups).

Counterexample

technique · direct
1.1givenF1F2construct

The partition (5). Its hook-length diagram is the single row 5,4,3,2,1, so by [F1] the unique hook of length 3 is H1,3(5), a horizontal rim hook of size 3 spanning the nodes (1,3),(1,4),(1,5) whose removal leaves the partition (2); hence (5) has exactly one removable 3-hook. Its β-set is Xλ={b1}={5}, a single bead on runner 2 at row 1; top-packing slides it to row 0, so X(3)={2} and C3((5))=P({2})=(2), a 3-core since 2<3 and (2) has hook lengths 2,1.

1.2givenF1F2construct

The partition (4,1). Its hook-length diagram is 5,3,2,1 in the first row and 1 in the second, so by [F1] the unique hook of length 3 is H1,2(4,1), whose rim hook is the horizontal strip (1,2),(1,3),(1,4) with complement (1,1); hence (4,1) also has exactly one removable 3-hook. Its β-set is Xμ={b1,b2}={5,1}, with 5 on runner 2 at row 1 and 1 on runner 1 at row 0; top-packing slides the bead 5 to the position 2, so X(3)={2,1} and C3((4,1))=P({2,1})=(1,1), a 3-core since (1,1) has hook lengths 2,1.

2.1F2F3step 1.1step 1.2∎

The two partitions therefore have the same number (one) of removable 3-hooks, but their 3-cores are the distinct partitions (2) and (1,1) of size 2; by [F3] the Specht modules Sk(5) and Sk(4,1) lie in different blocks of k[S5] for every splitting field k of characteristic 3. The top-packed abacus test of [F2] distinguishes the two configurations (one bead on runner 2 versus beads on runners 2 and 1), while the local removable-hook count does not, so no such count can replace the core test.

Both partitions have 3-weight 1, 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

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