Alphabeta Math
DefinitionDefinition: AI-adaptedProof: 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.

The regular-partition label convention and the Mullineux crystal involution

Definition

A partition is regular if each positive part occurs with multiplicity <e, and restricted if λr−λr+1<e for every r. Conjugation C:λ↦λ′ is the comparison map between the regular and the restricted models; it sends the residue i to −i. It is not the same-model sign involution.

On the regular basic crystal of The empty component is the highest weight crystal B(Λ0) define M by negating all colors of a lowering path from the empty partition: M(fib)=f−iM(b) for every edge, M(∅)=∅. The restricted sign involution is the conjugate CMC−1.

Facts & Assumptions

Given: The regular basic crystal with its lowering edges fi, the reflection τ of the Cartan datum with τ(αi)=α−i, and the simple integrable module V(Λ0).

[F1]

The regular labels form exactly the empty component of the Fock crystal, connected and generated from the vacuum by the lowering edges fi (The empty component is the highest weight crystal B(Λ0), The crystal of the level-one Fock space is the good-node partition graph).

[F2]

The datum reflection τ fixes Λ0 and δ and sends αi to α−i; it preserves all defining relations, and twisting the normalized simple integrable highest weight module by τ again gives the same normalized highest weight module (The cyclic affine type A Cartan datum and its residues, The integrable quantum highest weight module exists and is unique).

[F3]

The conjugation C reverses the content c−r↦−(c−r) and preserves addable/removable polarity, so it mirrors the signature with all residues negated (Partitions, English diagrams, and conjugation, Good and cogood nodes by residue-signature reduction).

Verification

technique · build the involution from the datum reflection, prove path independence and weight compatibility, and distinguish it from conjugation
1.1F1F2givenalgebra

Well-definedness and involution. Let v0 be the normalized highest vector. Twist V(Λ0) by the diagram automorphism τ; the defining relations are preserved and the twisted highest weight is again Λ0, so the uniqueness in [F2] gives a Q(q)-linear map Jτ with Jτv0=v0 and Jτ(xv)=τ(x)Jτ(v). Its square is a module map fixing the cyclic generator, hence is the identity. The unique i-string decomposition is carried to the −i-string decomposition, so Jτf~i=f~−iJτ and likewise for e~i. The canonical A0-lattice is the span of the iterated Kashiwara lowering words on v0, not the span of ordinary divided-generator words (The canonical crystal B(λ) is a highest weight crystal of highest weight λ); therefore Jτ preserves that lattice and its crystal residue set. Its induced involution is M. Applying this fixed residue map to any lowering path proves path independence.

2.1step 1.1F2algebra

Weight compatibility. Since τ(Λ0)=Λ0, τ(δ)=δ and τ(αi)=α−i, the involution satisfies wt M=τ(wt), and it is an involution of the regular label set; no affine longest element formula is used.

3.1step 1.1step 2.1F3givenalgebra

Conjugation versus Mullineux. By [F3] conjugation sends residue i to −i and compares the regular and restricted models, so it is a model dictionary rather than a self-map of the regular set: for e≥3 the conjugate of a regular partition is generally restricted and not regular, and for e=2 the reflection acts trivially while conjugation changes partitions visibly, so the two maps are distinct. The restricted sign involution CMC−1 is the transport of M, and dominance on equal-size partitions is the published prefix-sum order, reversed by conjugation; horizontal-strip inclusion is not dominance.

4.1step 1.1step 2.1step 3.1∎

Conclusion. Regular means part multiplicities <e, restricted means adjacent differences <e, conjugation is the regular/restricted comparison sending i to −i, and the Mullineux involution M is the well-defined same-model involution obtained from the datum reflection with weight action τ, distinct from both conjugation and the adjoint transpose.

Depends on

Used by

Dependency tree · two levels

43 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