Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 annular central element constructs Temperley–Lieb reflection maps

Statement

Work over C, with q≠0, δ=q+q−1. Write An=TLn(C,δ) and Vn,p=Wn,n−2p(C,δ). There is a central, reflection-invariant element Fn∈An acting on Vn,p by fn,p=qn−2p+1+q−(n−2p+1). When q≠±1 and (n,p) is noncritical, restriction splits as Vn,p↓=Vn−1,p⊕Vn−1,p−1. Except at (n,p,δ)=(2,1,0), induction has a natural exact sequence 0⟶Vn+1,p+1⟶Vn,p↑⟶Vn+1,p⟶0, which splits when (n,p) is noncritical. Here induction of a right module means V⊗AnAn+1.

If κ=ord⁡(q2)≥2 and p<p′ are a pair reflected in a single intervening critical line, meaning 0<p′−p<κ and p=p′+r(n,p′)−κ, then Hom⁡An(Vn,p,Vn,p′)≠0. Out-of-range standard modules are zero. Statements about a splitting omit zero summands.

Facts & Assumptions

Given: The diagram algebra, link-state bases, q,δ, and reflection conventions.

[F1]

Diagram stacking is associative, reflection is an anti-involution, the elementary diagrams di generate, and di2=δdi, didi±1di=di, didj=djdi for ∣i−j∣>1 (Stacking is associative and horizontal juxtaposition is strict monoidal, Elementary cup-cap diagrams generate every finite planar pairing endomorphism diagram, The elementary diagram generators satisfy the local Temperley–Lieb relations). The spanning Jones normal forms are Jones normal forms span and are counted by Catalan paths.

[F3]

For generic q the link-state Gram matrix is invertible, by The Temperley–Lieb link-state Gram determinant.

[F4]

Criticality and adjacent reflection labels are those of Complex Temperley–Lieb critical labels and reflection.

Proof

technique · Use an explicit partial closure of braid words, the induced link-state basis, and adjunction
1.1F1givenconstructalgebra

It suffices to perform computations for left modules: send a right module to the left module with a⋅v=v⋅a∗, where ∗ is diagram reflection. This is an exact equivalence preserving Hom direction, induction and restriction. Fix a square root of q and put gi=q1/21−q−1/2di. Expanding with [F1] gives gi−1=q−1/21−q1/2di and gigi+1gi=gi+1gigi+1. Let Tn:An+1→An close the last top endpoint to the last bottom endpoint externally on the right, removing any resulting loop with factor δ. This is an An-bimodule map by the matching rule. Define Mn=gn⋯g2g12g2⋯gn and Fn=Tn(Mn); set F0=δ. Every summand of Mn has an even total number of square-root factors, so Fn has coefficients in Z[q,q−1], independent of the chosen square root.

1.2F1F2givenconstructalgebra

For clarity give a basis proof of the induction sequence. In left-module notation put hr=drdr+1⋯dn for 1≤r≤n, and hn+1=1. A state d is r-admissible when it has no adjacent arc at an index i≥r. The tensors hr⊗d with d r-admissible, including all 1⊗d, span An+1⊗AnVn,p. First, a diagram word is a sum of hru with u∈An: reverse a spanning Jones normal form from [F1]. Its initial ascending block is either hr or contains no dn, and every later block lies in An. The surjection from the presented algebra to the diagram algebra is supplied by the local relations, so this spanning assertion applies to diagram words. Next, if d has its largest adjacent arc at s≥r, write d=dsf. For n≥3 this can be done without division: move the endpoint immediately outside that adjacent arc through the arc, so applying ds restores d and creates no loop. If s=1 use site 3; otherwise use site s−1. The outside site is either a defect or an endpoint of another arc, and reconnecting its former partner supplies the inverse state f. Now the relations give hr⊗d=hs+2⊗dr⋯ds−1d. The latter state is (s+2)-admissible: the adjacent arc at s has moved to r, all intervening endpoints shift by two, and the tail beyond s+1 still has no adjacent arc. Repetition, increasing r, proves spanning. At n=1,2 the same conclusion is checked on the at most two states, except n=2,p=1,δ=0, when the needed factorization d=d1f fails.

2.1F1step 1.1algebra

The braid relations give giMn=Mngi for i<n. To see this directly, commute gi past all gj with ∣j−i∣>1 in the descending and ascending strings; the remaining equality is gigi+1gi=gi+1gigi+1 on each side of the middle string. This proves the equality inductively in the length of the strings, starting with g1g2g12g2=g2g12g2g1. Bimodule linearity of Tn gives giFn=Fngi, hence diFn=Fndi. Thus Fn is central. Reversing the palindromic word Mn and reflecting its closure leaves it unchanged, so Fn∗=Fn.

3.1F1F2F3step 1.1step 2.1algebra

Compute Fn on the state zp with adjacent arcs (1,2),(3,4),…,(2p−1,2p) and all remaining sites defects. At a cup, expansion of the two adjacent crossings uses the identities digi+1gi=−didi+1 and gigi+1di=−di+1di; for example the first is qdi−didi+1−δdi+q−1didi+1di=−didi+1. The two minus signs on the two sides of each cup cancel. Thus each initial cup can be removed without changing the coefficient of zp. For the t=n−2p defect strands, expand the auxiliary strand successively from its first crossing. A smoothing connecting two defects vanishes in the standard quotient. There are two remaining continuations: following the auxiliary strand on its two sides gives respectively qtδ−qt−1=qt+1 and q−tδ−q−t+1=q−(t+1). The factors arise by choosing the identity smoothing at each subsequent crossing until the final cap; that cap either closes a loop or chooses the second smoothing, giving the displayed two terms on each side. Hence the coefficient of zp is fn,p. For generic q, [F3] makes the form nondegenerate. Capping z against y and then attaching x gives the rank-one diagram operator z↦ϕ(y,z)x, because lower-propagating terms vanish. Thus every nonzero vector generates the standard, which is simple. Centrality now makes Fn scalar on the entire standard: over C a central operator has an eigenvalue, whose nonzero eigenspace is the simple module. Since the action matrices and fn,p are Laurent polynomial in q, this scalar identity extends to every q≠0.

4.1F2F4step 3.1algebra

On the submodule and quotient in [F2], Fn−1 acts by fn−1,p and fn−1,p−1. Their difference is −(q−q−1)(qn−2p+1−q−(n−2p+1)). Under the noncritical and q≠±1 hypotheses it is nonzero. The operator on the restriction satisfies (Fn−1−fn−1,p)(Fn−1−fn−1,p−1)=0, because each factor kills its respective subquotient. Its two spectral projections therefore give an invariant direct sum splitting the restriction sequence.

5.1F1F2step 4.1step 1.2algebra

Append an adjacent arc at sites n+1,n+2 to d, obtaining dˉ∈Vn+2,p+1. The map Φ(u⊗d)=udˉ into Vn+2,p+1↓ is balanced and An+1-linear: elements of An act only on the first n sites. Its image of hr⊗d has its rightmost adjacent arc at r; deleting that arc recovers d. Conversely every (n+2,p+1)-state has a rightmost adjacent arc; delete it at position r, and the remaining state is r-admissible. These two operations are inverse, so the spanning tensors in step 1.2 map bijectively to the link-state basis. They are therefore a basis and Φ is an isomorphism, except in the stated exceptional case. Applying the restriction sequence [F2] to Vn+2,p+1 now gives the asserted induction sequence. Applying step 4.1 at rank n+2 splits it whenever (n,p) is noncritical, since n+2−2(p+1)+1=n−2p+1.

6.1F1F4step 1.1step 3.1step 1.2step 5.1algebra

Suppose (n,p) is critical, q≠±1, and zp is as in step 3.1. In the induced basis the coefficient of h2p+1⊗zp in Fn+1(1⊗zp) is (−1)n(δ2−4)≠0. Here is the local expansion computing it. First take p=0. To leave h1=d1⋯dn after reduction, the first pair of crossings of the closed auxiliary strand has three contributing smoothings, with weights −1,−1,δq−1; the fourth, of weight q, closes off the needed through path. This gives −2+δq−1. At each of the next n−1 pairs exactly one continuation retains the required external matching, of weight −1: the other continuation either caps the auxiliary path prematurely or makes an additional bottom arc. At the final pair the corresponding three weights are −1,−1,δq, giving −2+δq. Their product is (−1)n−1(−2+δq−1)(−2+δq)=(−1)n(δ2−4). The required exterior matching of h1 has top pair (1,2), bottom pair (n,n+1), and through paths from top j+2 to bottom j for 1≤j<n. Follow the auxiliary strand subject to these connections: a premature cap at an intermediate row would create another exterior arc instead of the required through path, so its continuation is excluded. For p>0, remove the first p cups using the two local identities in step 3.1, on both sides of the auxiliary path. This leaves the same computation on n−2p sites; n−2p>0 by criticality and κ≥2, and its parity equals that of n. The target basis tensor is h2p+1⊗zp=h1⊗zp, by successive didi+1di=di reductions. One may do the cup removal first for δ≠0 by inserting δ−1d2j−1 at each initial cup. The resulting coefficient identity extends to δ=0: the induced basis reduction in step 1.2 uses no division, so its matrices, and this coefficient, are Laurent polynomials in q. Finally δ2−4=(q−q−1)2≠0.

7.1F4step 2.1step 3.1step 5.1step 6.1construct

In the induction sequence at a critical (n,p) the two standard constituents have the same eigenvalue f=fn+1,p=fn+1,p+1. The central endomorphism Fn+1−f kills both constituents but is nonzero on the induction by step 6.1. Consequently it factors through the quotient Vn+1,p into the submodule Vn+1,p+1, giving a nonzero map between these adjacent reflected standards. Explicitly, lift a quotient vector to the induction, apply Fn+1−f, and use the inverse of the submodule injection; the result is independent of the lift because this operator kills the submodule.

8.1F4step 1.1step 3.1step 4.1step 5.1step 7.1algebra∎

Every symmetric pair has the form (n+j,p),(n+j,p+j) for a critical (n,p) and 1≤j<κ. For j≥2, induction and restriction at the noncritical labels give Hom⁡(Vn+j,p,Vn+j,p+j)≅Hom⁡(Vn+j−1,p↑,Vn+j,p+j)≅Hom⁡(Vn+j−1,p,Vn+j,p+j↓)≅Hom⁡(Vn+j−1,p,Vn+j−1,p+j−1). In the first and last isomorphisms the extra standard summand has a different F-eigenvalue: substitute q2(n−2p+1)=1 in step 3.1, and equality would force j=1 or j=κ. Thus its Hom is zero. The middle adjunction is explicit: f↦(v↦f(1⊗v)), with inverse g↦(a⊗v↦ag(v)). This works also when an extraneous summand is out of range. Reducing j to 1 and applying step 7.1 proves nonvanishing for every reflected pair. Returning along step 1.1 gives all statements for the repository's right modules.

Depends on

Used by

Dependency tree · two levels

29 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