Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Restriction of a link-state module has a two-step filtration

Statement

Let R be a commutative ring with unit, δ∈R, n≥1, and let t be allowed for Wn,t(R,δ). Include TLn−1(R,δ) into TLn(R,δ) by adding a rightmost vertical strand, and restrict the right action along this inclusion. Set Wm,s=0 when s<0, s>m, or m−s is odd. Then there is a short exact sequence of right TLn−1(R,δ)-modules

0⟶Wn−1,t−1⟶Res⁡TLn−1TLnWn,t⟶Wn−1,t+1⟶0.

The sequence gives a two-step filtration; it is not asserted to split.

Facts & Assumptions

Given: R, δ, n≥1, t, and the link-state quotient Wn,t(R,δ).

[F1]

Link states are basis half-diagrams; the right action stacks the state above the algebra diagram and kills lower-propagating terms (Temperley–Lieb link-state standard modules by defect number, The link-state quotient is a right Temperley–Lieb module).

[F2]

The inclusion TLn−1→TLn is horizontal juxtaposition with the identity strand, and composition is associative (Temperley–Lieb planar diagram data and endomorphism modules, Stacking is associative and horizontal juxtaposition is strict monoidal).

[F3]

Every basis diagram is a product of the elementary generators di; hence TLn−1 is generated by d1,…,dn−2 (Elementary cup-cap diagrams generate every finite planar pairing endomorphism diagram).

[F4]

For m≥1, in TLm+1 the elementary diagrams satisfy di2=δdi for 1≤i≤m, both adjacent triple relations for 1≤i<m, and didj=djdi for 1≤i,j≤m with ∣i−j∣>1 (The elementary diagram generators satisfy the local Temperley–Lieb relations).

[A1]

For the additional complex-case corollary below, take R=C, q∈C×, δ=q+q−1, and assume q2(t+1)≠1.

Proof

technique · direct
1.1F1givenconstruct

Let U be the span in Wn,t of link states in which the rightmost bottom site n is a defect. Removing that defect and its top endpoint gives a link state in Wn−1,t−1; conversely, adding a new rightmost bottom site joined to a new rightmost top defect gives the inverse map. These basis maps define an R-module isomorphism Wn−1,t−1→U.

2.1F1F2step 1.1

Under the inclusion in [F2], the rightmost strand of every diagram from TLn−1 is vertical and does not meet the other n−1 sites. Stacking such a diagram below a link state in U leaves the external site n connected to its same defect. Thus U is a TLn−1-submodule, and the isomorphism in step 1.1 intertwines the restricted action.

2.2F1step 1.1construct

The quotient by U has basis the link states in which n is paired to a site m<n. Cut the arc (m,n) and turn m into a defect. Noncrossing forces every defect to lie outside this arc, so this new defect is the rightmost one; the result is a link state with n−1 sites and t+1 defects. The inverse attaches a new site n to the rightmost defect. These operations are inverse bijections of bases, so they give an R-module isomorphism of the quotient's underlying module with Wn−1,t+1.

3.1F1F2F3step 1.1step 2.1step 2.2

Check the quotient map on a basis state whose rightmost site n is paired to m<n. A generator di with i∉{m−1,m} does not meet the endpoint m; stacking and cutting therefore give the same exterior matching and the same loop count. If i=m−1, the site m−1 is either a defect or is paired to a site k<m−1 (it cannot be paired to a site inside (m,n), since that would cross the arc (m,n)). In the paired case, stacking joins the distinct arcs (k,m−1) and (m,n) and replaces them by the bottom arc (m−1,m) and the arc (k,n); cutting either result at the arc ending at n gives the same link state, with no loop removed. In the defect case, stacking makes n a defect, so the result lies in U and is zero in the quotient. Cutting first makes m−1 and m two defects; stacking dm−1 joins their two top endpoints, leaving fewer than t+1 propagating strands, so its class in Wn−1,t+1 is also zero. If i=m, then m+1 lies inside the arc (m,n) and must be paired to some k with m+1<k<n. Stacking joins the distinct arcs (m,n) and (m+1,k), replacing them by (m,m+1) and (k,n); cutting at the arc ending at n before or after this operation gives the same state, again with no loop removed. These cases exhaust generators touching m; hence the quotient map intertwines every di. By [F3] it intertwines the whole TLn−1-action. The basis descriptions in step 1.1 and step 2.2 give exactness at every term.

4.1A1step 3.1algebra

For the additional corollary, assume R=C, q∈C×, δ=q+q−1, and q2(t+1)≠1. Under these hypotheses the short exact sequence above splits as a sequence of right TLn−1(C,δ)-modules. If t=0, then Wn−1,t−1=0; if t=n, then Wn−1,t+1=0. In either case exactness from step 3.1 makes the nonzero map in the sequence an isomorphism, so the sequence splits. Now suppose 0<t<n, set m=n−1, and consider a nonzero summand Wm,s with s=t−1 or s=t+1.

5.1A1F1F2F4constructalgebrastep 4.1

Choose v∈C with v2=q and, in TLm+1(C,δ), put gi=v1−v−1di for 1≤i≤m. By [F4], multiplication gives (v1−v−1di)(v−11−vdi)=1+(δ−q−q−1)di=1, and the reversed product is the same; hence gi−1=v−11−vdi. For 1≤i<m, expanding the adjacent products with both triple relations gives gigi+1gi−gi+1gigi+1=−v−1(q−δ+q−1)(di−di+1)=0. For valid distant indices, [F4] likewise gives gigj=gjgi. Define Mm=gm⋯g2g12g2⋯gm. Let Tm:TLm+1→TLm close the last top and bottom points by an exterior arc and remove each resulting loop with factor δ, and put Fm=Tm(Mm). The product has 2m crossing factors, so Fm is independent of the choice of square root v.

6.1F1F2F3step 5.1algebra

For M0=1 and Mj=gjMj−1gj, the braid and distant-commutation relations imply giMm=Mmgi for i<m. Indeed, put P=gm⋯gi+2 and Bi=gi+1Migi+1=gi+1giMi−1gigi+1, so Mm=PBiPrev, where Prev=gi+2⋯gm. The element gi commutes with P and Prev, while gi+1 commutes with Mi−1. Using gigi+1gi=gi+1gigi+1 on the left and right gives giBi=gi+1giMi−1gi+1gigi+1=Bigi. Closing the last strand is a TLm-bimodule map, since stacking on the first m strands is disjoint from that closure. Thus giFm=Fmgi for every i<m. Since di=q1−vgi and the di generate TLm by [F3], Fm is central.

6.2A1F1F2step 5.1constructalgebra

For link states x,y with s defects, define ψ(x,y) as the coefficient of 1s in y∘x∗, and set it to zero when this composite has fewer than s propagating components. For link states z,w, associativity and the quotient action give z⋅(x∗∘w)=ψ(x,z)w: when z∘x∗ has fewer than s propagating components, the resulting term is zero in Wm,s. This pairing is nonzero if s>0: for no arcs, pair the all-defect state with itself; with p=(m−s)/2>0, pair the states with arcs (1,2),(3,4),…,(2p−1,2p) and defects to their right, and with arcs (2,3),(4,5),…,(2p,2p+1) and a defect at site 1, respectively. Their overlay has no loop and gives value 1. If s=0, the case needed below has t=1 and q4≠1, hence δ≠0; pairing any perfect matching with itself gives δm/2≠0. Choose x,y with ψ(x,y)=1. For every w, the element x∗∘w then satisfies y⋅(x∗∘w)=w. If Θ is a module endomorphism, Θ(w)=Θ(y)⋅(x∗∘w)=ψ(x,Θ(y))w. Thus every module endomorphism of these summands is scalar.

7.1A1F1F2F4step 5.1step 6.2algebra

The central operator given by right multiplication by Fm is therefore scalar on each such Wm,s. To compute its scalar, use the state zm,s with p=(m−s)/2 adjacent arcs followed by s defects. Expand the defining crossings in Fm and retain the coefficient of zm,s in the link-state quotient. The local identities digi+1gi=−didi+1 and gigi+1di=−di+1di, obtained from [F4] by digi+1gi=qdi−didi+1−δdi+q−1didi+1di=−didi+1 and gigi+1di=qdi−di2−di+1di+q−1didi+1di=−di+1di, for 1≤i<m, remove the p adjacent arcs. For s≥1, follow one orientation of the remaining closed strand from its outer end. At each of the first s−1 defect positions, only the through resolution on both arms survives: every alternative adds an arc and has fewer than s propagating strands, so is zero in Wm,s. The initial half-crossing and these forced pairs contribute qs−1/2. At the terminal pair, the turn resolution closes one loop and contributes q1/2δ, while the through resolution contributes −q−1/2. Thus this orientation contributes qs−1/2(q1/2δ−q−1/2)=qsδ−qs−1=qs+1. When s=0, there are no intervening defect positions; the two surviving terminal resolutions contribute δ and −q−1, giving δ−q−1=q. For the second branch, first choose the cap-cup term −v−1di rather than the through term v1 at the outer crossing of gi=v1−v−1di. For s≥1, propagate this branch along the defect strings using the same cap-slide identities above: at each of the first s−1 defect positions, the surviving pair of smoothing coefficients is (−v−1)(−v−1)=q−1; each alternative connects two defects and is zero in the link-state quotient. At the last crossing, the through smoothing contributes v and the smoothing closing the remaining loop contributes −v−1δ. Including the initial coefficient, this branch therefore contributes (−v−1)q−(s−1)(v−v−1δ)=q−sδ−q−s+1=q−s−1. For s=0, no defect string intervenes: the two terminal resolutions give δ−q=q−1. The surviving matchings in this second branch are reflected versions of the first branch's matchings, but the coefficients just computed come from its own smoothing choices; reflection is linear and does not invert the scalar q. Every discarded resolution adds an arc and is zero in the quotient. Hence Fm acts on Wm,s as qs+1+q−s−1.

8.1A1step 6.2step 7.1algebra

For the submodule Wn−1,t−1, step 7.1 gives eigenvalue λ−=qt+q−t; for the quotient Wn−1,t+1 it gives λ+=qt+2+q−t−2. Both pairings used in step 6.2 are nonzero: the t+1 label has positive defects, and the t−1 label has positive defects unless t=1, in which case δ≠0 follows from q4≠1. Their difference is λ+−λ−=(q−q−1)(qt+1−q−t−1), which is nonzero by [A1].

9.1step 3.1step 6.1step 8.1algebra∎

Let S be right multiplication by Fn−1 on the restricted middle module. It is a module endomorphism because Fn−1 is central. The polynomial operator P=(S−λ+I)/(λ−−λ+) is the identity on the submodule and induces zero on the quotient. Therefore its image lies in the submodule and its restriction there is the identity, so P is a retraction. The middle module is the direct sum of the submodule and ker⁡P, and projection to the quotient restricts to an isomorphism on ker⁡P. This proves the asserted splitting.

Depends on

Used by

Dependency tree · two levels

16 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