Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge 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.

Periodic cyclotomic tensor corrections escape every finite cut

Statement

Use the actual periodic based Uq(sl2) module and its finite cuts of Two cyclotomic shears give a periodic integrable based quantum sl-two chain. Thus n2k=8k+2, n2k+1=8k+4, p=q+q−1, h=q2+q−2, and M(J) keeps constituents 0,…,J and shears only at indices less than J. On (M(J))⊗2 let ΨJ=Θ(ψ⊗ψ) be the actual rank-one tensor bar, and put e(J)=b0,0⊗b0,2. Every sum and vector here is algebraic.

For each J≥1, there is a unique ΨJ-fixed vector g(J) with seed coefficient 1 and strictly increasing first-weight corrections in qZ[q]. For every odd j=2k+1≤J, its coefficient Fj(q) at bj,0⊗bj,nj is independent of J and satisfies

F2k+1(q)≡(−1)k(2k+1)!(q3−q)(modq4+1).

In particular this coefficient is nonzero. Every cut J≥1 therefore has a nonzero corrected coordinate with constituent index at least J−1. For L≥J, retaining the raw coordinates with both indices at most J sends g(L) exactly to g(J), including at the last retained constituent where its outgoing shear has been omitted. No choice assumption is used.

Facts & Assumptions

[F1]

In the construction, C=1+S, C−1=1−S, and each shear goes from constituent j to j+1. On first-factor position a its nonidentity entry is (−1)a/ℓj/pj when ℓj∣a; on second-factor distance d from bottom it is (−1)(nj−d)/ℓj/pj when ℓj∣d, taking zero otherwise. The inverse has the negatives of these entries. Here (ℓj,pj)=(2,p) for even j and (4,h) for odd j. Both bars fix the raw basis and the factor lattices are divided-power integral (Two cyclotomic shears give a periodic integrable based quantum sl-two chain).

[F2]

Write vj,a;l,d=uj,a⊗ul,nl−d. The rank-one quasi-R term of degree r sends it to vj,a−r;l,d−r with coefficient Ar(nj−a+rr)q(nl−d+rr)q, where Ar=q−r∏i=1r(q2i−1); the result is zero unless 0≤r≤min⁡(a,d). This is the normalized rank-one intertwiner in the Given convention, using divided E(r)⊗F(r). It preserves the two standard constituent indices. The Gaussian actions are from Divided-power commutation and the simple Uqi(sl2) string modules; the coefficient is the rank-one formula of Existence and uniqueness of the weightwise quasi-R intertwiner, since (q−q−1)r[r]q2!=Ar. Unitarity from The quasi-R intertwiner determines its inverse and the coproduct factorizations makes the corresponding semilinear bar involutive.

[F3]

For a Laurent polynomial R=∑iciqi, put P(R)=∑i>0ciqi. If R+Rˉ=0, then P(R)−P(R)‾=R, uniquely among polynomials in qZ[q]. More generally P is the polynomial part at infinity with its constant term removed; this description permits exact rational quotient/remainder calculations when the result is Laurent.

Proof

technique · direct
1.1givenF2F3construct

Finite cuts and their correction. In a finite cut every evaluated degree is bounded by the finite divided strings, and [F2] is a finite sum of integral divided actions. Thus ΨJ is an integral semilinear involution. Degree zero is the identity, while degree r>0 raises first weight by 2r. Finite first-weight induction constructs the corrected seed: at the next weight its residual is anti-bar by involutivity, so [F3] supplies its unique positive-polynomial correction. There are only finitely many raw vectors and weights in the cut, hence this process terminates. If two normalized fixed lifts differed, the coefficients at the least first weight of their difference would be in qZ[q] and equal their own bars, hence zero. This proves existence and uniqueness without an infinite completion.

2.1F1F2step 1.1algebra

Projection coherence, including the cutoff. Let PJ keep raw tensor coordinates with both constituent indices at most J and map them to the corresponding cut raw basis. To calculate a raw bar column, expand by C⊗C, apply [F2], and reexpress by C−1⊗C−1. All nonidentity expansion and reexpression terms increase a constituent index, and the middle operator preserves both indices. A term using the omitted outgoing shear at index J is outside the retained rectangle and cannot return. An input outside that rectangle likewise cannot return. The retained raw columns are consequently exactly the cut columns, giving PJΨL=ΨJPJ for L≥J and also PJΨ=ΨJPJ for the algebraic full module. Since PJ preserves the seed, weights and polynomial correction coefficients, step 1.1 gives PJg(L)=g(J). This proves endpoint independence at the actual deleted-last-shear boundary.

3.1F1F2F3constructalgebra

Four states and three transfer bands. Work at total weight zero, and use first position a and second bottom-distance d. The seed has (a,d)=(0,0). On 0≤a,d≤3, even shears send offsets 0↦1 and 2↦3, odd shears send only 0↦3, and inverse shears have the same supports. Degree r decreases both offsets by r. Thus all reached raw coordinates remain in this envelope and r≤3. At first weight 2+2t, both factors satisfy nj/2−a=t+1 or nl/2−d=t+1. For t=4k+s, s=0,1,2,3, the two possibilities are respectively ((2k,0),(2k+1,1)), ((2k+1,0),(2k+2,3)), ((2k+2,2),(2k+3,3)), and ((2k+2,1),(2k+3,2)). Order their tensor pairs LL,LH,HL,HH. Let Bt,r be the four-by-four raw coefficient matrix from layer t to t+r, obtained by the three finite operations of step 2.1. Then Bt,0=I and there are no bands beyond r=3. The coefficient family f0=(1,0,0,0)T, ft=P(∑r=1min⁡(3,t)Bt−r,rfˉt−r) is well defined layer by layer: each partial sum is a finite algebraic vector, its least unsolved residual is anti-bar, and the integral full bar makes that residual Laurent. No infinite vector is asserted to belong to the module. The symmetry of the shear signs and the two Gaussian factors in [F2] preserves ft=(P,Q,−Q,R)T.

4.1F1F2step 3.1algebra

The scalar passed between four-layer cycles. At layer 4k+1, standard constituent 2k+2 first appears, at offsets (3,3), with coefficient ck=−(P−2hQ−h2R)/h2. This follows by expanding the four raw states: the lower constituent is odd, its first top shear has coefficient 1/h, and its second bottom shear has coefficient −1/h. Earlier layers cannot enter constituent 2k+2, because odd shears require offset zero and that first occurs at this layer. At this point a future residual with an old first constituent is impossible above its top weight; a mixed new/old constituent term has an old second bottom or an old first top, so its positive quasi-R terms vanish. The only remaining future residual is therefore ck(Ψv2k+2,3;2k+2,3−v2k+2,3;2k+2,3). Its initial center coefficient is bar fixed, since no earlier standard coordinate in this diagonal constituent can contribute to its first weight. Consequently the next four-layer correction depends only on ck. Positive-part extraction is linear over Q (and over Z on integral coefficients); no linearity over Q(q) is claimed. In the induction below only the integer scalar ak is taken outside it. At k=0, [F2] gives f1=(−q5+q3−2q,−q3+q,q3−q,q)T, so P−2hQ−h2R=−p(h+1).

5.1F1F2step 3.1step 4.1algebra

Explicit matrices and integral ghost residual. Let E21 be the two-by-two matrix with its only nonzero entry 1 at (2,1), and put Dt=(I+αtE21)⊗(I−αtE21), with αt=1/p,1/h,−1/p,0 according as t mod 4=0,1,2,3. This is exactly C⊗C between the four raw and standard states of step 3.1. For a source factor state (j,a) and a target state (j,a−r), put γ(j,a,r)=(nj−a+rr)q; put the entry zero if that same constituent target is absent. Define Tt,r on tensor pairs by Arγ(j,a,r)γ(l,d,r) in the matching target pair and zero elsewhere. Then the completely specified four-by-four matrices are Bt,r=Dt+r−1Tt,rDt. This includes Bt,0=I. For the diagonal ghost in step 4.1 the new string has n=8k+10, and its three positive divided coefficients are Gr=(8k+7+rr)q, r=1,2,3. Each Gr is divisible by h: the upper and lower remainders modulo 4 are respectively (0,1),(1,2),(2,3), so the Gaussian block argument proved in the construction gives zero modulo h. Likewise p∣G1,G3 by their upper/lower remainders modulo 2. Thus h2∣Gr2 for all three degrees, and p2h2∣Gr2 for degrees 1,3. Reexpressing the resulting standard offset 3−r uses no shear for r=2, and at most the two denominators p for r=1,3. Hence the future residual of the normalized rational ghost −p((2k−1)h−1)/h2 has raw Laurent integer coefficients. Subsequent raw integral corrections preserve this property, and involutivity makes every least residual anti-bar. Thus the positive-part recursion used next has genuine Laurent input for every integer k≥0, despite its initial rational ghost.

6.1F3step 5.1algebra

Uniform quotient extraction. Put U1=(0,0,0,−p((2k−1)h−1)/h2)T at layer 4k+1, and set Ui=P(∑r=1min⁡(3,i−1)B4k+i−r,rUˉi−r) for i=2,3,4,5. In the matrix formula of step 5.1 replace (8k+Nr)q by ∏j=1r(zqN−j+1−z−1q−N+j−1)/(qj−q−j); thus z=q8k, and crossing a four-layer period replaces z by q8z. Write k=3m+c, c=0,1,2, and x=q24m. Each residual is a finite Laurent polynomial in x with rational q,m coefficients. Polynomial division at infinity and removal of its constant term defines a Q(m)-linear operator on these rational coefficients; on their Laurent sum it is exactly P. Write each nonzero-x-power coefficient, after cancelling powers of q, as N/D with D(0)≠0. For positive x-powers the numerator is a polynomial with zero valuation at least 18, and every negative-power coefficient has infinity degree at most −18; the finite bounds and denominator products are calculated below. Accordingly q24amN/D has zero constant at zero for a>0,m≥0, and for a<0 its infinity degree is negative for all m≥0, so contributes no polynomial part. If a>0 and D∣(q24−1)3, put u=q24−1 and ρ=rem⁡D(N(1+am u+am(am−1)u2/2)). The binomial expansion of (1+u)am is exact modulo D, including m=0 and am=1, because u3=0 there. Thus ρ=rem⁡D(q24amN), and Euclidean division gives the exact positive part q24amN/D−ρ/D+ρ(0)/D(0): the quotient's constant is −ρ(0)/D(0), since the dividend vanishes at zero. For x-power zero, ordinary numerator/denominator division followed by constant removal applies, even if the coefficient has a pole at zero. These arguments justify extraction term by term, with no specialization at a root and no missing small-m case.

7.1step 5.1step 6.1algebra

The finite all-parameter identity. The following quotient/remainder identities result from substitution in the explicit matrices of step 5.1 and the extraction rule of step 6.1. Let H=(q−1)(q+1), J=q2+1, K=q4+1, and L=(q2−q+1)(q2+q+1). For residual layers i=2,3,4,5 respectively, the common denominators after removing powers of q divide HJK2, H2J2K2, H3J2K2L, and H3J3K2L; the least positive-x-power zero valuations are respectively 18+16c,21+16c,22+16c,27+16c, and the greatest negative-x-power infinity degrees are their negatives. All factors H,J,K,L divide q24−1, with their distinct cyclotomic factors pairwise relatively prime, and the displayed exponents are at most three; hence each listed denominator divides (q24−1)3. To obtain these identities form Tt,r from its matching pairs, multiply on the two sides by Dt+r−1,Dt, collect powers of x, and for each positive power replace its remainder by the three-term polynomial of step 6.1; collect again after each of the four layers. The scalar U5,LL−hU5,LH+hU5,HL−h2U5,HH then has the following coefficients of ph,p, with all other coefficients zero: for c=0, (−(216m3+216m2+66m+6),36m2+30m+6); for c=1, (−(216m3+432m2+282m+60),36m2+54m+20); for c=2, (−(216m3+648m2+642m+210),36m2+78m+42). These are finite rational-function identities, verified by the indicated polynomial divisions; the formulas above specify every input and operation. Substitution of k=3m+c in the three output pairs gives exactly −(2k+2)(2k+3)p((2k+1)h−1). Since the extraction bounds include m=0, this proves the cycle identity for every k≥0.

8.1step 4.1step 7.1algebra

Factorial invariant and nonzero endpoint. Apply step 7.1 to step 4.1, using only linearity under the integer multiplier ak. Starting with a0=1, the scalar multiplier satisfies ak+1=−(2k+2)(2k+3)ak, hence ak=(−1)k(2k+1)! and P−2hQ−h2R=akp((2k−1)h−1) at every odd layer 4k+1. Modulo q4+1, h=0 and −p=q3−q, so the first coordinate P has remainder ak(q3−q). Its divisor is monic and the displayed nonzero remainder has smaller degree. This proves nonvanishing of every odd endpoint in the coefficient family.

9.1step 1.1step 2.1step 8.1algebra∎

Identification with all finite cuts and conclusion. For any fixed J, raw coordinate projection of the layerwise family is a finite vector: only finitely many raw states have both indices at most J. Step 2.1 shows that each coefficient equation projects to its cut equation; the seed and positive-polynomial corrections project as well. Step 1.1 therefore identifies this vector with g(J). In particular all retained odd endpoints have the formula from step 8.1. The largest odd index at most J is J or J−1, giving the claimed escaping support in every cut. The finite projection comparison was proved with the omitted outgoing shear, so no full-formal/cut identification has been assumed. Every parameter, basis and finite calculation is specified, and no choice is used.

Source notes

The complete matrix generator and the all-parameter quotient/remainder certificate are retained in research/frontier-44-special-representation-examples-28-six-step-owner-escalation-repairs/resume-20261011/quasi-r/periodic-transfer-matrices.py and periodic-cycle-symbolic.py. The symbolic certificate gives zero differences in all three residue classes, zero required lower threshold for m, minimum positive-power zero valuation 18, maximum negative-power infinity degree −18, and cyclotomic jet orders at most three. A different extraction method, direct Laurent monomial extraction without jets, checks the four-layer identity and all sixteen local normalization equations for k=0,…,5. An independently derived Kronecker factorization checks all 256 entries of these sixteen matrices and reruns the all-parameter quotient identities in the retained finalize evidence. Those finite checks supplement the all-parameter calculation above; they are not its proof and are not independent acceptance. No external full-text reading is claimed by this author. The original two quasi-R source carriers are unchanged.

Depends on

Used by

Dependency tree · two levels

26 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