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.

Periodic cyclotomic shear tensor corrections escape every finite cut

Statement

Use the actual periodic modules, basis bj,a, finite cuts M(J), denominators p=q+q−1 and h=q2+q−2=p2−2 of Two cyclotomic shears give a periodic integrable based quantum sl-two chain. On M(J)⊗M(J) use the rank-one tensor bar Ψ=Θ(xˉ⊗xˉ), with

Θ=∑r≥0arE(r)⊗F(r),ar=q−r∏s=1r(q2s−1).

There is a unique normalized bar-fixed lift G(J) of the raw seed b0,0⊗b0,2: its seed coefficient is 1 and every other coefficient belongs to qZ[q], with corrections strictly increasing the first factor weight. Let fj(J) be its coefficient at bj,0⊗bj,nj, for j≤J. These coefficients agree as the cut increases. In the Laurent polynomial quotient over Q they satisfy

f2k+1(J)≡(−1)k(2k+1)!(q3−q)(modq4+1),f2k(J)≡(−1)k2(2k+1)!(modq2+1)(k≥1).

In particular fJ(J)≠0 for every J≥1. Thus the normalized corrections escape every finite constituent cut; this is a claim about the corrected lifts, not merely about repeated raw-bar closure. All constructions and proofs are choice free.

Facts & Assumptions

[F1]

The chain has n2k=8k+2, n2k+1=8k+4. Its coordinate map is C=1+S, C−1=1−S, and link j maps position tℓj to tℓj+ℓj−1 with coefficient (−1)t/pj, where (ℓj,pj)=(2,p) for even j and (4,h) for odd j. The integral actions and the zero chart are those proved by Two cyclotomic shears give a periodic integrable based quantum sl-two chain.

[F2]

In a divided string of length m, E(r)ua=(m−a+rr)qua−r and F(r)ua=(a+rr)qua+r, with vectors outside the string zero. The tensor bar is involutive and compatible with divided E,F; its rank-one coefficients are the displayed ar (Existence and uniqueness of the weightwise quasi-R intertwiner, Divided-power commutation and the simple Uqi(sl2) string modules, Divided-power multiplication, toral binomials and the Ei(a)Fi(b) reordering identity, The quasi-R intertwiner determines its inverse and the coproduct factorizations).

Proof

technique · direct
1.1F1F2algebraconstruct

Finite normalized correction. In raw coordinates the bar is (C−1⊗C−1)Θ(C⊗C) followed by scalar bar. Its coefficients are Laurent integral: each term arE(r)⊗F(r) acts integrally by [F1], and ar∈Z[q,q−1]. Its diagonal is 1 and every other term strictly raises the first weight, since C preserves weights and every r>0 term does so. In a finite cut there are finitely many raw weight-zero vectors. Successively remove the lowest remaining first-weight error: involutivity makes its scalar coefficient x satisfy x+xˉ=0, so its positive Laurent part is the unique coefficient in qZ[q] whose difference from its bar is x. This finite induction gives existence and uniqueness of G(J). All its nonseed weights have first weight at least 2. Every map in the raw bar raises constituent indices; projecting away indices exceeding J commutes with the bar computed in a larger cut. Uniqueness therefore proves agreement of the projected normalized lifts and of fj(J).

2.1F1F2step 1.1algebra

A uniformly bounded set of positions. Write an ordinary weight-zero tensor vector as uj,a⊗ul,nl−d; then nj−nl=2(a−d). The seed has a=d=0. Both C and C−1 preserve a≤3 and d≤3: on an even link the only eligible positions or endpoint distances in this range are 0,2, which become 1,3; on an odd link only 0 is eligible and it becomes 3. In endpoint distances the same assertion follows from nj≡0(modℓj) and nj+1=nj+2(ℓj−1). Every term of Θ lowers both a and d. Thus the raw bar and the correction induction preserve these bounds. Nonadjacent string lengths differ by at least 8, whereas ∣2(a−d)∣≤6, so only equal or adjacent constituent indices occur.

3.1F1F2step 2.1algebraconstruct

Ordinary normalized invariant coordinates. In a constituent pair of lengths m,n, put Da,d=Δ(F(a))(u0⊗un−d) if a≥d, and Da,d=Δ(E(d))(ua⊗un) if a<d. Their leading ordinary vector is ua⊗un−d. Their term with first position a−t has respectively coefficient qt(m−a+t)(n−d+tt)q or qt(n−d+t)(m−a+tt)q, and is omitted if an endpoint is exceeded. These vectors are bar fixed by [F2], because their starting tensors have highest first factor or lowest second factor. The lowest exponent of either nonleading coefficient is respectively t(a−d+t) or t(d−a+t), strictly positive. Hence their transition and inverse are unitriangular matrices over Z[q]. Expand the ordinary-coordinate vector (C⊗C)G(J) in these D vectors, with coefficients zj,l,a. They are bar fixed and regular at q=0; except for the original seed coefficient their residues are zero. In pair (j,l) their denominator divides pj−1pl−1, with missing index −1 interpreted as denominator 1, because these are the only incoming shear denominators and the inverse D matrix is Laurent integral.

4.1F1F2step 1.1step 3.1algebra

Parity and the bounded rational states. Put δj=deg⁡qpj(mod2) and define τ0=0, τj+1=τj+j+δj(mod2). Assign tuple (j,a,l,nl−d) the parity ϵ=a(1+j+l)+τj+τl+jl(mod2). Its coefficient in every vector under consideration contains only powers of q of that parity. Indeed nj/2≡j+1(mod2); a first shear has even source position and a second shear has even source position nl−d, hence a≡j+l(mod2) in the latter case. In both cases the change of ϵ is δj or δl, exactly the parity of the shear coefficient. A term of Θ with index r has coefficient parity r(1+j+l), exactly the change from a to a−r. The seed has parity zero, positive Laurent extraction preserves parity, and the D coefficients have parity t(1+j+l). In particular diagonal zj,j,a has parity j+a. A bar-fixed Laurent polynomial is a polynomial in p=q+q−1, by pairing its opposite exponents and the recurrence qs+q−s=p(qs−1+q1−s)−(qs−2+q2−s). Multiplying z by its bar-fixed denominator therefore gives a polynomial in p; zero residue at both ends bounds its degree strictly below that of the denominator. Thus on an odd diagonal z3=c3/p2,z2=A2/p,z1=c1/p2,z0=A0/p; on an even diagonal z3=up/h2+vp/h, and initially z2,z0 have the form A/h+B/h2, while z1 has the form Ap/h+Bp/h2. The constants may be treated over Q.

5.1F2step 4.1algebra

The scalar calculations used below. On a diagonal of length m write Ha,t=qt(m−a+t)(m−a+tt)q; this is the coefficient from Da to first position a−t. All following evaluations follow by substituting in [s]=(qs−q−s)/(q−q−1) and (Nt)q=∏v=0t−1[N−v]/[t−v]. Modulo h, one has p2=2, q4=−1, [8s]/h=−2sp. For m=8k+10 these give H3,1/h=−2(k+1)p, H2,2=−1, H1,1=q2p, H3,3/h=2(k+1)q2p, and H3,2 is divisible by h. For m=8k+4, all endpoint coefficients Ha,a with 1≤a≤3 vanish modulo h. Modulo p, one has q2=−1; for m=8k+4 the evaluations are H3,1/p=−(4k+1), H3,2=4k+1, H1,1/p=−(4k+2), H2,2=4k+2, and H3,3/p=−(4k+2)(4k+1). For m=8k+2 one has H2,2=4k+1. Quotients here are taken only when the numerator is divisible by the indicated denominator, and evaluations are in Q[q,q−1]/(q4+1) or Q[q,q−1]/(q2+1) understood as the corresponding residue fields.

6.1F1step 2.1step 4.1step 5.1algebra

Base odd diagonal. For j=1, m=4, the first-weight bound excludes positions 2,3, so only z1=c/p2,z0=A/p occur. The double pole in the ordinary component at position 1 comes only from shearing both seed factors; its sign is negative, hence c=−1. The ordinary endpoint has no incoming first shear and no admissible backward mixed tensor with first position 0, so it equals its Laurent integral raw coefficient. Since H1,1/p=−2 modulo p, cancellation of its simple pole forces A=2c=−2. Thus the odd scalar starts at c0=−1, with endpoint residue −2/p=−p=q3−q modulo h.

7.1F1step 3.1step 4.1step 5.1step 6.1algebra

Odd to even: the double pole. Suppose the odd diagonal j=2k+1, m=8k+4, has z3=z1=c/p2, z2=(4k+1)c/p and z0=(4k+2)c/p; for k=0 use the base state with positions 2,3 absent. Its endpoint residue modulo h is (2k+1)cp, because all the other endpoint coefficients vanish there. On the next even diagonal, of length 8k+10, the only double h pole at first position 3 is the product of the two incoming shears of the previous endpoint. The first sign is positive and the second is (−1)(8k+4)/4=−1. Mixed incoming terms have only a single pole. Therefore the numerator up of z3=up/h2+vp/h is the negative of that endpoint residue, and u=−(2k+1)c.

8.1F1step 2.1step 4.1step 5.1step 7.1algebra

Odd to even: the simple poles. On this even diagonal, the ordinary components at first positions 0,1,2 equal their integral raw components: an incoming first shear lands only at position 3, and a backward adjacent pair has first position at least 3 by the weight equation. In the component at position 2, H3,1 is divisible by h, so there is no double pole; the rational-state bounds force z2=C/h. Cancellation of its simple pole gives C=4(k+1)u. Similarly H3,2 and H3,3 are divisible by h, forcing z1=Bp/h and z0=A/h. The endpoint pole equation modulo h is A−C+(2B+C)q2=0, by step 5.1. The elements 1,q2 are rationally independent in that residue field, so A=C and B=−C/2. This proves z2=z0=C/h, z1=−Cp/(2h), with C=−4(k+1)(2k+1)c; no value of v is needed. Its endpoint modulo p is −(2k+3)C, since the odd-position states vanish there and H2,2=4k+5 for length 8k+10.

9.1F1step 4.1step 5.1step 8.1algebra

Even to odd: the two double poles. Let the preceding even diagonal have length 8k+2, with the state just proved and scalar C, and consider the next odd diagonal of length m=8k+4, with k≥1. At first position 3, the double p pole comes only from both shears of the preceding raw vector at position 2. Its two signs are negative and positive. That raw coefficient evaluated modulo p is C/h=−C/2: its ordinary component is integral by step 8.1, and the z3 contribution vanishes because it has a factor p. Thus c3=C/2=:c′. At first position 1, the double pole comes from both shears of the preceding endpoint, again with negative total sign. That endpoint equals −(2k+1)C modulo p. On the current diagonal its double-pole numerator is c1+(4k+1)c′, using H3,2=4k+1. Equating it to (2k+1)C=(4k+2)c′ forces c1=c′. Single-pole mixed terms cannot alter either double-pole equation.

10.1F1step 2.1step 4.1step 5.1step 9.1algebra

Even to odd: the simple poles. The ordinary component at first position 2 is integral. An incoming first shear lands at positions 1,3; an incoming second shear would have to start in the backward mixed pair at second position m−3, which is odd and is therefore killed by the even link. Hence z2+c′H3,1/p2 has no pole, giving A2=(4k+1)c′. The ordinary endpoint is also integral: no first shear lands at position 0, and the backward mixed pair requires first position at least 1. Its pole equation is A0−(4k+2)c′+(4k+2)A2−(4k+2)(4k+1)c′=0, so A0=(4k+2)c′. Consequently the odd state has exactly the form used in step 7.1. Combining steps 8.1 and 9.1 gives the recurrence ck+1=−(2k+2)(2k+1)ck, and therefore ck=(−1)k+1(2k)!.

11.1step 1.1step 6.1step 8.1step 10.1algebra∎

Nonzero endpoint residues in every cut. The odd endpoint residue is (2k+1)ckp=(−1)k(2k+1)!(q3−q) modulo h. The following even scalar is C=(−1)k2(2k+2)!, and its endpoint residue is −(2k+3)C=(−1)k+12(2k+3)! modulo p. Multiplication by powers of q identifies these ideals with (q4+1) and (q2+1) respectively. These residues are nonzero in their characteristic-zero residue fields, so every asserted endpoint coefficient is nonzero. The computation used only incoming shears and thus applies to every containing finite cut; step 1.1 also gives their coherence. Finite arithmetic, explicit projections and finite induction used no choice. This proves the stated escape of normalized corrected lifts.

Depends on

Used by

Dependency tree · two levels

27 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