Alphabeta Math
LemmaStatement: 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.

Fixed-residue node cubes realize the actual Fock strings

Statement

For the declared charge-0 node operators and a fixed residue i and partition λ, the orbit obtained by toggling the addable/removable i-cells of λ is a finite Boolean cube: the availability of one such cell is unchanged by every other i-toggle, including e=2. Order the i-slots by decreasing content, call a vertex state + when the slot is empty (addable) and − when it is occupied (removable), so that the state word records the configuration. Then the node operators on this cube are exactly the tensor power V(1)⊗k of the two-vertex rank-one string with the fixed coproduct and K-exponent q#+−#−; in particular the raw A0-partition span is stable under the actual normalized string operators. On the residue classes bμ:=∣μ⟩+qF0 in F0/qF0, f applies to the first surviving + and e to the last surviving − in decreasing-content order, equivalently f to the last + and e to the first − in increasing-content order, with ε,φ the surviving minus/plus counts; if the required sign is absent, the residue operator is zero. These are congruences modulo qF0, not equalities on standard field vectors. The standard partition form is the normalized rank-one polarization, and all divided E- and F-powers have Laurent-integral matrices.

Facts & Assumptions

Given: The partition Fock space with node formulas and content order, the fixed residue i, and the rank-one tensor crystal of the vector module.

[F1]

A corner's addability/removability is determined by its horizontal and vertical neighbours, whose residues are i±1 and never i for e≥2; toggling another i-cell does not change any such neighbour (The node order and the signed exponents Nil and Nir, Removable and addable nodes).

[F2]

On the two-vertex rank-one string the operators have coefficients 1, E(2)=F(2)=0, and the tensor rule is the fixed-coproduct rule with the strict f/non-strict e comparison (Divided-power commutation and the simple Uqi(sl2) string modules, The crystal basis of a tensor product and the two-case operator rule).

[F3]

The node operators are the stable prefix operators; their coefficients are qNir and q−Nil and the exponents agree with the tensor cube weights (Semi-infinite wedges are indexed by partitions and the action gives the node formulas, The node order and the signed exponents Nil and Nir).

Proof

technique · show the $i$-slots are independent, identify the node action with the tensor cube, and apply the rank-one tensor rule
1.1F1givenalgebra

Independence of the i-slots. If two i-cells are toggled, the neighbours determining each corner's availability are of residues i±1, and the toggled cell has residue i, so it is not a neighbour of any other i-cell; hence toggling one i-cell never changes the availability of another, every subset of the finitely many slots is realizable, and the orbit is a Boolean cube with 2k distinct partition diagrams.

2.1step 1.1F3givenalgebra

The cube is the rank-one tensor power. In decreasing-content order, the j-th slot's toggling multiplies by q+1 or q−1 according to occupancy and the iterated coproduct coefficient at slot j is q∑slots before jweight for f and q−∑slots after jweight for e; these are exactly Nir and −Nil by [F3], so the map from tensor bit vectors to partitions is a rank-one module isomorphism onto the cube.

3.1step 2.1F2F3givenalgebra

The string rule, lattice and divided powers. The tensor crystal theorem [F2] gives stability of the A0-span of the cube basis under the normalized string operators. On the residue basis modulo q, unrolling its strict/non-strict comparison cancels +− in decreasing order, with f acting on the first surviving + and e on the last surviving −; reversing the order cancels −+ and selects the last + / first −. For divided powers, write ϵs=1 on an empty slot and −1 on an occupied slot. If a empty slots are filled by Fi(a), the coefficient is the Laurent monomial q∑t selected∑s<tϵs−a(a−1)/2: the a! orders of distinct toggles contribute the asymmetric factorial at q−2, which divided by [a]! is q−a(a−1)/2. Repeated toggles vanish. Likewise emptying a occupied slots by Ei(a) has coefficient q−∑t selected∑s>tϵs−a(a−1)/2. These formulas prove Laurent integrality. Define the standard partition form by making cube words orthonormal. For an edge λ→μ and N=Ni(λ), its two coefficients satisfy Nir+Nil=N−1, so qNir=qN−1q−Nil. This verifies (Fix,y)=(x,q−1KiEiy) and, by transposition, (Eix,y)=(x,qFiKi−1y); together with diagonal Ki this is the normalized rank-one polarization for the fixed coproduct.

4.1step 1.1step 2.1step 3.1∎

Conclusion. Each fixed-residue orbit is a finite Boolean tensor cube of highest-weight-1 strings, the actual normalized operators preserve the raw A0-partition span and induce the survivor rule on its residue classes in either content order, including e=2. Lattice stability precedes transport of these congruences; no equality on standard field vectors is asserted.

Remarks

For e=2, i=1, put h=∣1⟩, x=∣2⟩, y=∣1,1⟩ and z=∣2,1⟩. The node formulas give F1h=x+qy, F1(2)h=z, and s=x−q−1y is killed by both E1 and F1. Thus y=q(1+q2)−1(F1h−s) and f~1y=q(1+q2)−1z≠0. Its residue is zero, exactly as the cancelled signature predicts.

Depends on

Used by

Dependency tree · two levels

29 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