Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Semi-infinite wedges are indexed by partitions and the action gives the node formulas

Statement

Keep the conventions of the charge-M Fock space The semi-infinite q-wedge Fock space and its q-adic topology. Normal wedges are bijective with partitions through ik=M+λk−k+1; in charge 0 the vacuum is the empty partition. The stable finite-prefix action defines linear endomorphisms Fi,Ei,Ki,Kd of F(0) by

Fi∣λ⟩=∑addable γ of residue iqAir−Rir ∣λ+γ⟩,Ei∣μ⟩=∑removable γ of residue iq−(Ail−Ril) ∣μ−γ⟩,

where for Fi the counts are taken in the smaller diagram λ and count addable/removable i-nodes strictly to the right of the added node (higher content), and for Ei the counts are taken in the smaller diagram μ−γ and count nodes strictly to the left of the removed node (lower content), with the removed node excluded; all sums are finite. The toral operators act by Ki∣λ⟩=qNi(λ)∣λ⟩ with Ni the addable-minus-removable count, and Kd∣λ⟩=q−m0(λ)∣λ⟩; the size ∣λ∣ is a separate grading. Charge M replaces the residues by content +M and Kd by ΩM(d)−m0.

Facts & Assumptions

Given: The charge-M Fock space with its partition basis, the finite-prefix action of the um, and the sub-diagram with smaller diagram as in the statement.

[F1]

Normal wedges form a basis stable under straightening; inserting a new entry and straightening touches only indices between the inserted index and its neighbours (Normally ordered q-wedges form a basis for every finite wedge length).

[F2]

The ground-tail connecting maps and deep-insertion estimates are available; the precise stabilized operators, including boundary scalars, are derived in steps 2.1, 2.2 and 3.1: the connecting maps append ground tails and the deep-insertion estimates show the value is attained on a finite prefix (Tail estimates: q-adic vanishing against the vacuum and finiteness of the weight strings, The semi-infinite q-wedge Fock space and its q-adic topology).

[F3]

A corner cell of residue i of ∣λ⟩ is exactly an addable i-node of the smaller diagram; the bijection between normal words and partitions is ik=M+λk−k+1 (Removable and addable nodes, Partitions, English diagrams, and conjugation, The semi-infinite q-wedge Fock space and its q-adic topology).

Proof

technique · evaluate the finite-prefix coproduct on a chosen entry, translate collisions into corner additions, and control the artificial boundary by renormalising the cutoff
1.1F3givenalgebra

The bijection and finiteness of the node sums. The map λ↦(ik)k≥1 with ik=M+λk−k+1 is a bijection onto normal semi-infinite words because λ is weakly decreasing and eventually zero, and ik is strictly decreasing and eventually equal to the ground tail; a partition of size n has at most n+1 addable nodes and at most n removable nodes, so both sums in the statement are finite.

2.1step 1.1F1F2F3algebra

The Fi formula. On a prefix of length N containing the support of ∣λ⟩, the coproduct action of Fi shifts a selected entry ik to ik+1, provided ik≡i; if ik+1=ik−1 the resulting term has a collision and vanishes by the wedge relations, and otherwise the shift is exactly the addition of the corner cell (k,λk+1) of residue i by [F3]. The coefficient is the product of the prefix K-eigenvalues of the finite coproduct, which is qAir−Rir: a frozen doubly occupied i-pair contributes net weight 0, and the singly occupied i-pairs are exactly the other addable and removable i-corners, ordered by content, contributing +1 for each addable corner strictly to the right (higher content) of the added node and −1 for each removable one.

2.2step 1.1F1F2F3algebra

The Ei formula. For Ei the finite-prefix coproduct shifts an entry with ik≡i+1 to ik−1; if it collides the term is zero, and otherwise it deletes the corner cell (k,λk) of residue i, whose smaller diagram is μ−γ. The suffix K−1-weight contributes the addable and removable i-corners of μ−γ strictly to the left (lower content) of the removed node; the single artificial boundary pair at the cutoff contributes qδi≡M−N to the finite Ei coefficient, which is cancelled by the factor q−δi≡M−N in the renormalised operator q−δi≡M−NEi. The artificial removal at the cutoff duplicates the first appended ground entry and vanishes; after one more ground entry is appended, the same cancellation removes the changed boundary factor. Thus the renormalised operator is cutoff-independent and defines the stable limit by [F2]. The sign is negative because Ei shifts down in the wedge.

3.1step 2.1step 2.2F3givenalgebra

The toral normalization. On a normal prefix of length N extending past the partition's nonzero rows, the finite Ki exponent is Ni(λ)−δi≡M−N: the genuine corner pairs give the count, and the cutoff leaves one artificial occupied bottom of the pair (M−N,M−N+1). Therefore the stabilized operator is qδi≡M−NKi[N] after tail attachment and acts by qNi(λ). For the degree torus, normalize the finite action by qΩM−N(d)Kd[N]. The vacuum recurrence gives ΩM=ΩM−N+∑k=1Nwt(uM−k+1). Each admissible row shift adds a cell of content plus charge i and changes the vector weight by −αi; hence the normalized label is ΩM−∑cellsαc−r+M. Since ⟨αi,d⟩=δi0, the degree eigenvalue is qΩM(d)−m0(λ), equal to q−m0(λ) in charge zero. These normalized operators are independent of the cutoff.

4.1step 1.1step 2.1step 2.2step 3.1∎

Conclusion. Normal wedges are bijective with partitions, and the stable finite-prefix action gives the displayed finite node formulas for Fi,Ei,Ki,Kd before any relation or crystal statement is invoked.

Remarks

  • The construction deliberately precedes the proof of the quantum relations: the node formulas are defined here and their affine relations are proved in The Fock space node formulas satisfy the quantum affine relations.

  • The artificial finite-cutoff boundary is removed by the scalar q−δi≡M−N together with the duplicate-tail term; no two-sided-unbounded evaluation is used.

Depends on

Used by

Dependency tree · two levels

13 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