Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedprecheck passverified 2026-10-22 (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.

Finite Hilbert boundary representation of Temperley-Lieb

Definition

Fix an integer n≥1 and a real loop parameter δ. Define [0]δ=0, [1]δ=1, and [r+1]δ=δ[r]δ−[r−1]δ for r≥1. Assume [k]δ≠0 for 2≤k≤n; this list is empty when n=1. The abstract generator algebra Pn(C,δ) is the unital complex algebra with generators u1,…,un−1 and relations ui2=δui, uiui±1ui=ui, and uiuj=ujui when ∣i−j∣>1. The diagram algebra TLn(C,δ) has basis the noncrossing pairings of n ordered bottom and n ordered top points; its product stacks the left factor above the right, deletes each closed loop, and multiplies by δ per loop. Its elementary diagram di has a cap joining top points i,i+1, a cup joining bottom points i,i+1, and vertical strands elsewhere. The isomorphism Φn:Pn(C,δ)→TLn(C,δ) sends ui to di.

For every 1≤i≤n−2, the adjacent relations in the presentation mean both uiui+1ui=ui and ui+1uiui+1=ui+1. For matching the imported recursion's notation, write Ui:=di.

Set p1=11. For 1≤r<n, put Qr=pr⊗11 by adjoining one rightmost vertical strand and define

pr+1:=Qr−[r]δ[r+1]δQrdrQr.

The denominator hypotheses make this recursion defined. For each 1≤r≤n, let p^r:=Φr−1(pr). The cited Jones-Wenzl result gives pn2=pn under these unit-denominator hypotheses. For 1≤r≤n, let ιr,n:Pr(C,δ)→Pn(C,δ) send each generator ui to the same-named generator, and let ȷr,n:TLr(C,δ)→TLn(C,δ) append n−r rightmost vertical strands. The maps commute with Φ: on each generator, both composites send ui to di with those added strands, and both send the unit to the identity diagram. Since generators and unit generate Pr, the composites agree on every element.

Let H be a nonzero finite-dimensional complex inner-product space whose inner product is linear in its first argument and conjugate-linear in its second. A unital complex-algebra representation is a complex-linear map π:Pn(C,δ)→End⁡C(H) such that π(xy)=π(x)π(y) for all x,y∈Pn(C,δ) and π(1)=IH. Here End⁡C(H) is the algebra of complex-linear endomorphisms, with composition as multiplication and IH as unit. Require each generator image to be self-adjoint, meaning ⟨π(ui)x,y⟩=⟨x,π(ui)y⟩ for all x,y∈H. Define P:=π(p^n), define rank⁡P:=dim⁡Cim⁡P, and restrict to data with rank⁡P>0. The algebraic representation as a physical boundary state space is an additional model identification and is not part of this definition.

Tower-map convention

For r<n, the presentation tower map ιr,n is well-defined because the defining relations are unchanged and it preserves the unit. For basis diagrams E,D∈TLr, appending n−r rightmost vertical strands before stacking gives the same matching as stacking E above D first and then appending those strands; the appended strands create no closed loops. Hence ȷr,n(E∘D)=ȷr,n(E)∘ȷr,n(D), and ȷr,n(1r)=1n. Bilinearity then makes ȷr,n a unital algebra homomorphism. The two unital algebra homomorphisms Φn∘ιr,n and ȷr,n∘Φr agree on every generator and the unit, so they agree on all of Pr; this identity transfers the unit-denominator recursion on diagrams to the presentation used by π.

Diagram convention

The box is notation for the three-strand algebra element p3; strands are ordered from left to right and continue through the box. For general n, the same box notation has n strands. The picture records no physical apparatus, and no proof below relies on it.

p3

Remarks

Only [2]δ,…,[n]δ are required to be nonzero; [n+1]δ may vanish. The item asserts no root-of-unity quotient, modular representation classification, trace-preserving realization, or physical area law.

Depends on

Dependency tree · 2 levels

Sources