Alphabeta Math
RemarkRemark: Literature-sourcedProof: 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.

The crystal identification does not elementarily identify the cellular simple labels

Statement

At level one, distinguish the cellular labels D(μ), the nonzero Murphy cell-form quotients (the dual-Specht heads at q=1), from the inductive labels D˙(μ) defined by D˙(∅)=F,D˙(μ)=hd⁡(FiD˙(e~iμ)) for any defined good deletion e~iμ. Here F is any field, the Hecke parameter is invertible with finite quantum characteristic e≥2, and μ is e-restricted. At q=1, e=p and the functors are those of Generalized Jucys-Murphy primary idempotents and the residue-summand functors Ei, Fi; the general Hecke functors are constructed in General Hecke residue branching endpoints from normalized Schur cells. The group label convention is fixed by p-regular and p-restricted labels under transpose and sign.

The equality D˙(μ)≅D(μ) and independence of the chosen deletion follow at level one from the proved cellular branching endpoints and induction on rank, as explained below. They do not follow from the combinatorial inverse property alone (Good-node deletion and cogood-node addition operators). This local comparison uses no Fock-space classification.

The historical warning in Kleshchev's survey §11.2, equation (11.1), concerns the broader cyclotomic labelling theorem for restricted multipartitions. The survey attributes its proof to Ariki and a later graded argument, and describes both as relying on the wider theory. That warning does not preclude the finite level-one comparison here. Identifying the resulting graph with the canonical crystal B(Λ0) is a separate result of General Hecke cellular simple labels match the basic crystal ↗, using the independent Fock-component suppliers and their declared Axiom of Choice. Neither that identification nor Fock reachability is a premise of the cellular branching proofs on this page.

Remarks

Every nonempty e-restricted shape has a good deletion. Its bottom removable corner has residue μh−h, while the only boundary corner below it is the addable (h+1,1) of residue −h. Since 0<μh<e, that bottom minus cannot cancel, so a surviving minus exists. The finite signature argument in General Hecke residue branching endpoints from normalized Schur cells proves that good deletion remains restricted and that its inverse is the prescribed cogood addition. For the group specialization, reachability is also supplied by Every p-restricted partition is reached from the empty partition by cogood additions.

Now induct on rank. At rank zero both modules are F. For each allowed predecessor ν=e~iμ, induction gives D˙(ν)≅D(ν). The cellular induction endpoint is hd⁡(FiD(ν))≅D(f~iν)=D(μ). Thus every allowed deletion yields the same isomorphism class, and the bottom-corner argument ensures that a deletion exists. The argument is finite and choice-free; in the group specialization its induction endpoint is also The cogood node gives the simple socle and head of the residue induction.

Depends on

Used by

Dependency tree · two levels

40 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