Alphabeta Math
TheoremStatement: 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 Temperley–Lieb link-state diagram basis is cellular

Statement

Let R be a commutative ring with unit, δ∈R, and n≥0. Let Λn be the set of t with 0≤t≤n and n−t even, ordered by λr⊵λt exactly when r≤t. Thus labels with fewer propagating strands are strictly greater. For x,y∈Tn,t, define

Cx,yt:=x∗∘y∈TLn(R,δ),

where x,y:n→t are link-state diagrams and ∗ is reflection across a horizontal line. Then the diagrams Cx,yt, for all t∈Λn and x,y∈Tn,t, form an R-basis of TLn(R,δ), and (C,Λn) is a cellular basis in the convention of Cellular bases and cell modules. Its cell module at λt is Wn,t(R,δ), and its cell form is the Gram form ϕn,t of The link-state Gram form is symmetric and invariant.

Facts & Assumptions

Given: R, δ, n, the diagram algebra TLn(R,δ), its link-state bases, and the form ϕn,t.

[F1]

Every basis diagram is a noncrossing pairing of n top and n bottom points, and composition glues diagrams with coefficient δ for each closed component (Temperley–Lieb planar diagram data and endomorphism modules).

[F2]

Composition is associative, and vertical reflection reverses the order of stacking while preserving the number of removed loops (Stacking is associative and horizontal juxtaposition is strict monoidal, with the reflection rule verified in the proof below).

[F3]

The cellular axioms require a basis indexed by a finite poset with an involutive algebra anti-automorphism and the fixed-first-index triangular multiplication rule (Cellular bases and cell modules).

[F4]

Link states have exactly t propagating strands and their right action is well-defined; φ_{n,t} is the symmetric invariant capping form (Temperley–Lieb link-state standard modules by defect number, The link-state quotient is a right Temperley–Lieb module, The link-state Gram form is symmetric and invariant).

Proof

technique · direct
1.1F1F4givenconstruct

Every diagram D:n→n has a definite number t of propagating strands, with 0≤t≤n and n−t even. Cut each propagating strand at a horizontal midpoint. The upper half, reflected, is a link state x:n→t; the lower half is a link state y:n→t. Conversely, x∗∘y joins the t corresponding defect endpoints in order and yields a diagram with exactly t propagating strands. The cuts are determined by D, so these constructions are inverse. Thus the diagrams Cx,yt are in bijection with the basis diagrams of TLn and hence form an R-basis.

2.1F1F2F3step 1.1

Define ∗ on every basis diagram by horizontal reflection and extend R-linearly. Reflecting a stack reverses its two factors and preserves each closed component, so (ab)∗=b∗a∗; reflecting twice restores the original pairing and 1n∗=1n. Also (Cx,yt)∗=Cy,xt. Thus ∗ is the involutive anti-automorphism required by [F3].

2.2F3F4step 1.1algebra

For t∈Λn, let Jt be the span of diagrams with fewer than t propagating strands. The stated order makes these exactly the basis elements indexed by labels strictly greater than λt, so Jt=A⊳λt. Every propagating path in a stacked product must pass through a distinct propagating path in each factor, so a product has no more propagating strands than either factor; therefore Jt is a two-sided ideal. For a∈TLn, write the quotient of y∘a in MR(n,t)/MR<t(n,t) as ∑vrvv in its link-state basis. Then Cx,yta=x∗∘(y∘a)≡∑vrvCx,vt modulo Jt. The coefficients rv are those of y⋅a and are independent of x, so this is exactly the fixed-first-index cellular multiplication rule in [F3].

3.1F3F4step 2.2algebra∎

For link states y,u, the middle composite y∘u∗ is a diagram t→t. If it has all t propagating strands, planarity makes it δc1t, and the full product is Cx,ytCu,vt=x∗∘(y∘u∗)∘v=ϕn,t(u,y)Cx,vt=ϕn,t(y,u)Cx,vt, using symmetry of the form. If y∘u∗ has fewer than t propagating strands, the full product also has fewer than t and lies in Jt, so the same congruence holds with coefficient zero. Hence ϕn,t is the cellular cell form. Finally, the generic right cell-module action read from Cx,xta has the same coefficients rv as y⋅a in step 2.2, so its basis and action identify with Wn,t.

Depends on

Used by

Dependency tree · two levels

17 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