Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Unnormalized diagram closure and partial trace

Definition

Let R be a commutative ring, δ∈R, and use the noncrossing-pairing diagram category of Temperley–Lieb planar diagram data and endomorphism modules, with the left factor stacked above the right factor. For a basis diagram D:n→n, close each top endpoint to the corresponding bottom endpoint outside the rectangle and let c(D) be the number of circles in the resulting finite graph. Define

Tr⁡n(D)=δc(D)

and extend R-linearly to TLn(R,δ). This is the unnormalized closure trace. In particular, Tr⁡0(10)=1 and Tr⁡n(1n)=δn. No unit or nonzero condition on δ is required.

Let ∪:0→2 and ∩:2→0 be the standard cup and cap in the diagram category. For n≥1 define the right partial trace by

ptr⁡n(x)=(1n−1⊗∩)∘(x⊗11)∘(1n−1⊗∪),x∈TLn(R,δ).

It is a map TLn→TLn−1. If δ is a unit, define τn=δ−nTr⁡n. This agrees with the normalized trace of Normalized Temperley–Lieb trace from diagram closure over C when δ≠0.

Remarks

The partial trace closes only the rightmost strand; its cap/cup order and type are fixed by the displayed composite. The unnormalized trace remains defined at δ=0, while τn does not.

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