Alphabeta Math
Pipeline-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.

Temperley–Lieb Diagram Algebra and Catalan Basis: Examples and Counterexamples

1 · Prerequisites

2 · Summary

These examples calculate the first four ranks, list and multiply the five normal forms in rank three, and show that at loop value zero a generator can be nonzero and square-zero. They use the A-page conventions and do not add general theorem suppliers.

Examples

The TikZ diagram on the A page fixes the elementary cup-cap convention. The calculations use matching data and the proved local relations rather than relying on pictures as proof.

Companion: temperley-lieb-diagram-algebra-and-catalan-basis.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

The first four finite Temperley–Lieb algebras

Example

Let R be a commutative ring and fix any loop value δ∈R. For the ranks n=0,1,2,3, the diagram and presentation algebras have the following R-bases:

nbasisrank0{1}11{1}12{1,u1}23{1,u1,u2,u1u2,u2u1}5

The rank column is Cn for these four indices. In rank 3, writing a=u1 and b=u2, the product table is

⋅1ababba11ababbaaaδaabδababbbaδbbδbaababaδababδababaδbabδbba

Facts & Assumptions

Given: A commutative ring R, a loop value δ∈R, and n∈{0,1,2,3}.

[F1]

Pn(R,δ) is generated by u1,…,un−1 with ui2=δui, uiui±1ui=ui, and distant generators commuting. (The abstract Temperley–Lieb generator presentation)

[F2]

The Jones normal forms use blocks (uj1⋯uk1)⋯(ujr⋯ukr) with 1≤ki≤ji<n and both endpoint sequences strictly increasing. (Jones normal forms span and are counted by Catalan paths)

[F3]

The Jones normal forms are an R-basis of Pn(R,δ). (The generator presentation is the planar diagram algebra over every commutative ring)

[F4]

The empty generator set gives P0=P1=R. (The abstract Temperley–Lieb generator presentation)

Proof

technique · direct
1.1F2F3F4construct

For n=0,1 there are no generators, so the presentation is R and the unique normal form is 1. For n=2, the admissible lists in [F2] give 1,u1; for n=3, they give 1,u1,u2,u2u1,u1u2. These words are bases by [F3], so the ranks are 1,1,2,5; the A-page path bijections identify those counts with C0,C1,C2,C3.

2.1F1algebra∎

Set a=u1, b=u2 in rank 3. From [F1], a2=δa, b2=δb, aba=a, and bab=b. The row of a is a, δa, ab, a(ab)=a2b=δab, a(ba)=aba=a. The row of b is b, ba, δb, b(ab)=bab=b, b(ba)=b2a=δba. The row of ab is ab, aba=a, abb=δab, abab=(aba)b=ab, abba=ab2a=δa. The row of ba is ba, baa=δba, bab=b, baab=ba2b=δb, baba=(bab)a=ba. These are the displayed entries and use no division by δ.

Remarks

The rank is the number of basis diagrams, not the number of generators. The table remains valid at δ=0 and over rings with zero divisors.

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

The five normal forms in the three-strand algebra

Example

In rank 3, the two generators are u1,u2. The admissible Jones normal forms from Jones normal forms span and are counted by Catalan paths are

1,u1,u2,u2u1,u1u2.

The two adjacent triple relations reduce alternating length-three words:

u1u2u1=u1,u2u1u2=u2.

For example, u2u1u2u1=(u2u1u2)u1=u2u1, while u1u2u1u2=(u1u2u1)u2=u1u2. The five listed words are an R-basis for every commutative coefficient ring and every δ∈R.

Facts & Assumptions

Given: A commutative ring R, δ∈R, and rank n=3.

[F1]

The parameters of a Jones normal form satisfy 1≤ki≤ji<3, with both ji and ki strictly increasing from block to block. (Jones normal forms span and are counted by Catalan paths)

[F2]

u12=δu1, u22=δu2, u1u2u1=u1, and u2u1u2=u2. (The abstract Temperley–Lieb generator presentation)

[F3]

The Jones normal forms are linearly independent and span the presented algebra because the presentation map to the diagram algebra is an isomorphism. (The generator presentation is the planar diagram algebra over every commutative ring)

Proof

technique · direct
1.1F1construct

For an empty parameter list the word is 1. For one block, the pairs (j,k)=(1,1),(2,1),(2,2) give u1,u2u1,u2. For two blocks, strict increase forces (j1,j2)=(1,2) and (k1,k2)=(1,2), giving u1u2; three blocks are impossible because only j=1,2 are available. This lists exactly five forms.

2.1F2F3algebra∎

The reductions in the Example follow by one use of the corresponding triple relation in [F2]; the basis claim follows from [F3]. Since no step divides by δ, these statements include δ=0 and all other ring specializations.

CounterexampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

At loop value zero, a local generator is nilpotent but nonzero

Statement refuted

The assertion “if the loop value is 0, then every local generator is 0” is false for R=Z, loop value δ=0, and rank n=2.

Facts & Assumptions

Given: R=Z, δ=0, and n=2.

[F1]

The rank-two diagram module is free on its loop-free noncrossing pairings; its identity and cap-cup diagram are distinct basis elements. (Temperley–Lieb planar diagram data and endomorphism modules, Stacking is associative and horizontal juxtaposition is strict monoidal)

[F2]

At loop value 0, the local relation is d12=0, and u1↦d1 under the presentation map. (The elementary diagram generators satisfy the local Temperley–Lieb relations)

[F3]

The presentation map P2(Z,0)→TL2(Z,0) is an isomorphism. (The generator presentation is the planar diagram algebra over every commutative ring)

Counterexample

technique · direct
1.1F1algebra

In cyclic boundary order the four points have exactly three pairings: (1,2)(3,4), (1,3)(2,4), and (1,4)(2,3). The middle pairing crosses, while the other two are the identity and d1. They are distinct members of the diagram indexing set, so d1 is a nonzero standard basis vector in the free abelian module [F1].

2.1F2F3step 1.1∎

By [F2], d12=δd1=0. Since the isomorphism [F3] sends u1 to this nonzero d1, injectivity gives u1≠0 and u12=0. This is the claimed counterexample.

Remarks

This boundary case does not affect the diagram basis: the loop parameter changes multiplication coefficients, not which pairings index the free module.