Alphabeta Math
RemarkRemark: AI-adaptedProof: Not applicablePipeline-generated
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.

Block weight is not the same as numerical defect

Remark

Weight is combinatorial. For finite e≥2, the e-weight we(λ) of a label λ⊢n is the number of e-hooks that have to be removed from λ to reach its e-core, it equals the size ∣Qe(λ)∣ of the e-quotient, and it satisfies n=∣λ∣=∣Ce(λ)∣+e we(λ) (The core-quotient size formula defines the weight). In particular, we(λ)=(n−∣Ce(λ)∣)/e is determined by n and the e-core. Thus, for a fixed algebra HF,q(Sn), by Type-A Hecke Specht modules are in the same block iff their labels have the same e-core it is an invariant of the block of Sλ; for e=p it is the combinatorial p-weight of the block.

Numerical defect is block-theoretic. The numerical defect of a block is defined from its defect group: for the block bimodule kGb a defect group is a p-subgroup D≤G for which the diagonal ΔD is a vertex, its order pd defines the numerical defect d, and defect zero means D=1 (Defect group and numerical defect of a block). It is a p-adic order invariant of the block algebra in the fixed splitting modular system and is defined by a vertex computation, not by hook combinatorics.

The two invariants must not be identified without a theorem and an explicit range. The weight records how many hooks of length divisible by e the label carries, while the numerical defect records the order of a vertex of the block bimodule; nothing on this page proves that the two numbers agree, and they are defined from entirely different data. The only case settled here is weight zero: if wp(λ)=0 then λ is a p-core, and the classification forces the block to have a single Specht label, Cartan matrix (1), a projective simple module, a full matrix algebra structure and trivial defect group, so the numerical defect is also zero (Weight-zero symmetric-group blocks are defect zero). For w>0 no assertion about the defect group of a weight-w symmetric-group block, and no identification of w with the numerical defect, is made on this page. The printed defect-group computation for weight-w blocks (defect νp((pw)!), with defect group a Sylow p-subgroup of Spw) is deliberately not asserted here, because no counted proof source for it is registered with this batch; supplying it is outside this page's proof route and remains an open obligation for a later page of the track.

No choice principle is used in the statements recorded above.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

28 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