Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-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 restricted-partition component is the basic crystal in the symmetric-group convention

Statement

Fix a finite integer e≥2. In the symmetric-group convention of The symmetric-group level-one residue and partition-label convention:

  1. The empty component of the transported full Fock crystal Fsym is exactly the set of e-restricted partitions, its operators are the modular good-node deletions and cogood-node additions, its weight function is wt⁡(λ)=Λ0−∑imi(λ)αi, the counts εi, φi are the numbers of normal and of conormal i-nodes, and the component is B(Λ0): every e-restricted shape is reached from the empty partition by successive cogood additions.
  2. The full Fsym has all partitions as vertices and is reducible; its transported field decomposition is Fsym≅⨁k≥0V(Λ0−kδ)⊕p(k) with p(k) the number of partitions of k, so its other vertices are exactly the non-restricted shapes.
  3. In the symmetric-group regime (algebraically closed field k of characteristic p>0, Hecke parameter ξ=1, so e=p is prime) the e-restricted labels λ are the simple kSd-modules in the dual-Specht convention, and for every i with εi(λ)>0 soc⁡(E−iDλ′)=D(e~iλ)′, where Dλ′ is the James-labelled simple, E−i the residue-summand functor after the sign twist, and D(e~iλ)′ the James label of the deleted shape. That is, the standard E−i is the residue functor twisted by the sign representation.
  4. At quantum characteristic e=0 (colors Z) every level-one partition is a label of the empty sl∞ crystal, there are no same-content corner cancellations, and no finite affine datum, weight formula or Hecke module statement is made.

General finite-e Hecke crystal labels remain valid, but they are not called symmetric-group modules of "characteristic e". The axiom of choice is used exactly as declared in the contract, through the highest-weight decomposition of the full Fock module; the vertex-set identification and signature reachability in part 1 are choice-free. The proof below also uses the declared choice-bearing supplier to identify the component with the canonical highest-weight crystal.

Facts & Assumptions

Given: For parts 1–3, a finite integer e≥2 and the conventions of The symmetric-group level-one residue and partition-label convention; for part 3, an algebraically closed field k of characteristic p>0 with ξ=1, so e=p. For part 4, use the boundary e=0 instead.

[F1]

Fsym is the relabelled Fock space with JMλ=∣λ′⟩, transported operators Eisym=J−1E−iQGJ, Fisym=J−1F−iQGJ, and weight wt⁡(Mλ)=Λ0−∑imi(λ)αi; its vertices are all partitions; λ is e-restricted if and only if λ′ is e-regular; the empty partition is fixed by the dictionary (The symmetric-group level-one residue and partition-label convention).

[F2]

Conjugation intertwines the modular operators on e-restricted labels with the normalized Fock operators on the empty component with negated colors, Ce~iλ=e~−iQGCλ and Cf~iλ=f~−iQGCλ, including zero values; εi(λ)=ε−i(λ′), φi(λ)=φ−i(λ′), and wt⁡(λ′)=τ(wt⁡(λ)) (The QG Fock-crystal arrows are the modular good-node operators).

[F3]

Assume the axiom of choice as declared there (The Axiom of Choice). The empty component of the full partition Fock crystal is the canonical B(Λ0), with exactly the e-regular labels; its module is M=Uq∣empty⟩ and it occurs once; and FQG=⨁k≥0V(Λ0−kδ)⊕p(k) is a locally weight-finite indexed direct sum with p(k) the number of partitions of k, whence ch⁡FQG=ch⁡V(Λ0)∏r≥1(1−exp⁡(−rδ))−1; a highest crystal label need not be a highest field standard vector (The empty component is the highest weight crystal B(Λ0)).

[F4]

For a field k of characteristic p>0, every p-restricted partition is obtained from the empty partition by successive cogood additions, and every nonempty p-restricted partition has a good node; the argument is choice-free (Every p-restricted partition is reached from the empty partition by cogood additions).

[F5]

For k of characteristic p>0, μ p-restricted and εi(μ)>0, the residue-summand functor Ei of Generalized Jucys-Murphy primary idempotents and the residue-summand functors Ei, Fi satisfies soc⁡EiD(μ)≅hd⁡EiD(μ)≅D(μ∖A) with A the good i-node, and the total multiplicity of D(μ∖A) in EiD(μ) is εi(μ) (The good node gives the simple socle and head of the residue restriction). Here D(μ) is the simple module of the p-restricted label μ in the dual-Specht convention, and Ei is the projection of the restriction onto the summand whose Jucys-Murphy content ends in i; in particular Res⁡M=⨁iEiM.

[F6]

For p-regular μ the James-labelled simple and the dual-Specht simple are related by Dμ≅D(μ′)⊗sgn⁡ (p-regular and p-restricted labels under transpose and sign); the Jucys-Murphy elements are Lr=∑s<r(s r)∈kSd (The Jucys-Murphy elements of the symmetric group algebra) and each transposition acts on the sign representation (The sign representation of Sn and the restriction Res⁡HG(V) of a representation to a subgroup) by −1; the socle of a finite-dimensional module is its largest semisimple submodule (The radical, socle, head, and Loewy series of a finite-dimensional module).

[F7]

For the source boundary e=0 the ground datum is the quantum characteristic convention of Kleshchev's survey (printed p. 6), under which no positive integer e with 1+ξ+⋯+ξe−1=0 exists and the colors form Z; for level l=1 Example 3.2(ii) of the survey (printed p. 19) has vacuous inequalities, so every partition is a label of the crystal, and the restricted signature reduces with no cancellable pair because distinct corners of one partition have distinct contents, as recorded in The symmetric-group level-one residue and partition-label convention.

Proof

technique · direct
1.1givenF1F2F3

The conjugation dictionary identifies the vertex sets of the two components. By [F1] transposition is a bijection from the e-restricted onto the e-regular partitions, fixing the empty partition, and by [F3] the vertex set of the empty component of the full Fock crystal is exactly the set of e-regular partitions. Hence the J−1-image of the empty component is exactly the e-restricted set, with the empty partition corresponding to the vacuum, and by [F2] the transported modular operators on these labels are the transported normalized Fock operators e~isym=J−1e~−iQGJ, f~isym=J−1f~−iQGJ.

2.1givenF2F3F4step 1.1

The transported component is connected and generated from the vacuum. The empty component of [F3] is the canonical B(Λ0), hence connected and generated from its highest vertex by the f~QG; transporting along the bijection of step 1.1, the e-restricted labels form one connected component of the transported crystal, generated from the empty partition by the operators f~isym, that is, by modular cogood additions. In particular every e-restricted shape is reached from the empty partition by successive cogood additions, and dually by successive good deletions; for e=p prime this is also the choice-free statement of [F4], whose good and cogood nodes are the modular ones by [F2].

2.2givenF1F2step 1.1

The weight function is the transported one. By [F1] the weight of Mλ is Λ0−∑imi(λ)αi with mi(λ) the number of residue-i nodes, and by [F2] it transforms under conjugation as wt⁡(λ′)=τ(wt⁡(λ)); the vacuum ∅ has weight Λ0 since mi(∅)=0. The modular εi(μ) and φi(μ) are by construction the numbers of surviving − and +, that is, of normal removable and conormal addable i-nodes in the sense of the modular signature.

3.1givenstep 1.1step 2.1step 2.2

This proves part 1 of the Statement: the empty component of Fsym is exactly the e-restricted partitions (step 1.1), its operators are the modular good deletions and cogood additions (step 1.1), its weight is Λ0−∑imi(λ)αi (step 2.2), ε, φ count normal and conormal nodes (step 2.2), and it is B(Λ0) with every restricted shape reached from the empty partition by cogood additions (step 2.1).

4.1givenF3F4step 1.1step 2.1step 3.1

For part 2, the full Fsym has all partitions as vertices and its module is the transport of the modules of [F3], so its field decomposition is Fsym≅⨁k≥0V(Λ0−kδ)⊕p(k) with p(k) ordinary partition numbers; this direct sum is infinite, so Fsym is reducible whenever at least two summands are nonzero (for instance the summands V(Λ0) and V(Λ0−δ)). Since the empty component is exactly the e-restricted shapes by step 3.1, every other vertex of the full crystal is a non-restricted shape, and conversely each non-restricted shape lies outside the empty component. The axiom of choice is inherited through [F3], both here for the field decomposition and in steps 1.1-2.1 for the canonical highest-weight-crystal identification. The transport itself introduces no choice. The vertex-set identification and reachability can also be read directly from the choice-free partition-graph supplier of [F2], and [F4] gives the prime-case reachability without choice.

4.2givenF5F6step 3.1

Part 3, the James labels and the socle formula. Let k be of characteristic p>0 and e=p; e-restricted λ are exactly the labels D(λ) of the simple kSd-modules in the dual-Specht convention, and for p-regular λ′ the published dictionary gives Dλ′≅D(λ)⊗sgn⁡ by [F6]. Suppose εi(λ)>0 and let A be the good i-node, so that e~iλ=λ∖A and, by [F5], soc⁡EiD(λ)≅D(λ∖A). Tensoring with sgn⁡ negates the Jucys-Murphy action: for v⊗w in M⊗sgn⁡, Lr(v⊗w)=∑s<r((s r)v)⊗((s r)w)=−Lrv⊗w because each (s r) acts by −1 on sgn⁡ by [F6]; hence the content vector of the sign twist is the negative, and by [F5] the residue summands satisfy E−i(M⊗sgn⁡)≅(EiM)⊗sgn⁡. The twist is an exact invertible endofunctor (its square is the identity on isomorphism classes), so it preserves socles and simples; applying it to soc⁡EiD(λ)≅D(λ∖A) gives soc⁡(E−i(D(λ)⊗sgn⁡))≅D(λ∖A)⊗sgn⁡, and the two published re-identifications D(λ)⊗sgn⁡≅Dλ′ and D(λ∖A)⊗sgn⁡≅D(λ∖A)′ of [F6] yield soc⁡E−iDλ′≅D(e~iλ)′; this is the stated formula, and it exhibits E−i as the sign twist of the residue functor Ei.

5.1givenF7step 3.1step 4.2∎

Part 4, the boundary and the naming caveats. At e=0 the colors are Z and, by [F7] together with the distinct-content computation recorded in the convention item The symmetric-group level-one residue and partition-label convention, each residue class contains at most one corner of a partition, so no signature contains a cancellable pair; every partition reaches the empty partition by good deletions, and the source's restricted set for level 1 is all partitions. No finite affine datum, charge, weight formula or symmetric-group module statement is made in this boundary; and for a general finite e≥2 the crystal labels of parts 1 and 2 are Hecke labels, valid for any quantum characteristic e, not only for prime e as in part 3.

Depends on

Used by

Dependency tree · two levels

54 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