Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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 double-edge Serre cancellation in affine A1 on partitions

Example

At e=2 one has [3]=q2+1+q−2 and the cubic relation SX=X03X1−[3]X02X1X0+[3]X0X1X02−X1X03=0 for X=E,F, products acting right to left. The four E compositions all vanish on ∅,1,2,11 by size, so only size ≥4 inputs test the identity. The four F compositions all vanish on ∅,1,3,111. On 2 the ordered four outputs are ([3]A,A,0,0) with A=(q−2+1)∣321⟩; on 11 they are ([3]B,B,0,0) with B=(q−1+q)∣321⟩, giving cancellation. On 21 they are (0,C,D,[3](D−C)) with C=[2](∣52⟩+q∣511⟩+q2∣421⟩+q∣3211⟩+q2∣31111⟩+q3∣22111⟩) and D−C=[2](∣421⟩+q∣331⟩+q3∣3211⟩+q2∣322⟩). A nontrivial E check on 321 has four outputs (0,0,Z,[3]Z) with Z=(1+q2)∣11⟩+(q−1+q)∣2⟩. All displayed Serre sums vanish, whereas F0F1∣1⟩=∣3⟩+q∣111⟩ and F1F0∣1⟩=0 show the colors do not commute.

Facts & Assumptions

Given: The e=2 partition Fock space with its node formulas, the ordinary generators E0,E1,F0,F1, and the value [3]=q2+1+q−2.

[F1]

The Ei,Fi actions are the node formulas of Node actions for partitions of size at most three and The node order and the signed exponents Nil and Nir, including on shapes of size 4 and 5.

[F2]

The general cubic Serre sum holds on every partition vector by The Fock space node formulas satisfy the quantum affine relations, independently proved by Integrable rank-one actions force the quantum Serre sums; the computations below are finite corroborations, not the universal proof.

Verification

1.1F1givenalgebra

The vanishing cases. Every E monomial removes four cells, so all four outputs on ∅,1,2,11 vanish. For F on ∅, F1∅=0 and F0∅=1, F01=0; these kill all four compositions. On 1,3,111, the three compositions with a rightmost F0 vanish because F0 kills each input. For the remaining F03F1, the node formulas give F02F1∣1⟩=0, F02F1∣3⟩=(q−2+1)∣321⟩, and F02F1∣111⟩=(q−1+q)∣321⟩; in both latter cases F0∣321⟩=0 since it has no addable 0-node. Thus each of the four F outputs on the stated boundary inputs is zero.

2.1step 1.1F1algebra

The size-2 cancellations. Starting from ∣2⟩ and applying the four ordered compositions via [F1] gives the first output as [3](q−2+1)∣3,2,1⟩, the second as (q−2+1)∣3,2,1⟩, and the last two 0: indeed the coefficient of ∣321⟩ in the leading output is q−4+2q−2+2+q2=[3](q−2+1) and the other outputs contribute the same multiple of the middle term; cancelling gives 0. The same computation from ∣1,1⟩ gives outputs ([3]B,B,0,0) with B=(q−1+q)∣321⟩ because the coefficient is q−3+2q−1+2q+q3=[3](q−1+q).

2.2step 1.1F1algebra

Noncommutation. Direct evaluation gives F0F1∣1⟩=∣3⟩+q∣1,1,1⟩ and F1F0∣1⟩=0, since F0∣1⟩=0; hence the ordinary generators do not commute.

3.1step 2.1F1algebra

The size-3 cancellations. From ∣2,1⟩ the second composition yields the common term C, the third yields D, and the fourth yields [3](D−C), so the sum contributes [3](−C+D−(D−C))=0 coefficientwise; from ∣3,2,1⟩, applying the E-compositions gives the last output [3]Z with the stated Z, and the first two outputs vanish, while the third output is Z; the sum vanishes.

4.1step 2.1step 3.1step 2.2F2∎

Conclusion. The displayed finite chains exhibit the double-edge Serre cancellation on 2,11,21 and the E cancellation on 321, with the [3] coefficients q2+1+q−2; the general relation including the colour swap is proved by the independent rank-one Serre lemma, so no finite diagnostic is promoted to a universal proof.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

25 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