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.

Negligible Temperley–Lieb morphisms form a tensor ideal

Statement

Let δ∈C. The subspaces Nδ(m,n) of Negligible morphisms in the Temperley–Lieb category are closed under composition on either side by arbitrary Temperley–Lieb morphisms and under tensoring on either side by arbitrary Temperley–Lieb morphisms. Thus they form a tensor ideal.

Facts & Assumptions

Given: The complex Temperley–Lieb diagram category for arbitrary δ∈C, its unnormalized closure trace, and the subspaces Nδ(m,n).

[F1]

Morphisms are linear combinations of noncrossing matching diagrams; composition stacks diagrams, removes each closed component with factor δ, and is associative (Temperley–Lieb planar diagram data and endomorphism modules, Stacking is associative and horizontal juxtaposition is strict monoidal).

[F2]

For a basis endomorphism D:m→m, the unnormalized closure trace is Tr⁡m(D)=δc(D) (Negligible morphisms in the Temperley–Lieb category).

[F3]

A morphism f:m→n is negligible exactly when Tr⁡m(g∘f)=0 for every g:n→m (Negligible morphisms in the Temperley–Lieb category).

Proof

technique · Compare the finite matching graphs and their closed components
1.1F1F2givenalgebra

Let f:m→n and g:n→m be basis diagrams. The closed matching graphs defining Tr⁡m(g∘f) and Tr⁡n(f∘g) are the same finite graph: the two stacked layers are read cyclically from opposite interfaces. They therefore have the same number of closed components and the same coefficient δc. Bilinearity gives Tr⁡m(g∘f)=Tr⁡n(f∘g) for all such rectangular morphisms.

2.1F1F3step 1.1algebra

Suppose f:m→n is negligible, take arbitrary a:r→m and b:n→s, and test b∘f∘a:r→s against any h:s→r. The composite a∘h∘b has type n→m, so [F3] gives Tr⁡m(a∘h∘b∘f)=0. By step 1.1, this equals Tr⁡r(h∘b∘f∘a). Thus b∘f∘a is negligible, proving closure under composition on both sides.

2.2F1F2F3step 1.1construct

Let u:r→s be arbitrary and let h:n+s→m+r test f⊗u:m+r→n+s. Form g:n→m by composing 1n⊗u with h and then closing the last r auxiliary input/output points; each resulting closed component contributes its factor δ. The full closed matching graph for h∘(f⊗u) has exactly the same remaining components and the same removed components as the graph obtained by first making this partial closure and then forming g∘f. Therefore Tr⁡m+r(h∘(f⊗u))=Tr⁡m(g∘f)=0, where the last equality is [F3]. This proves f⊗u negligible.

3.1F1F2F3step 1.1step 2.2construct∎

For u⊗f:r+m→s+n, let a test morphism be h:s+n→r+m. Compose u⊗1n with h and close the first r auxiliary input/output points to obtain g:n→m. The same component count gives Tr⁡r+m(h∘(u⊗f))=Tr⁡m(g∘f)=0. Thus u⊗f is negligible as well, proving tensor stability on both sides.

Depends on

Used by

Dependency tree · two levels

12 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