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.
A Jones–Wenzl annihilator exists exactly when the trivial module is projective
Statement
Let be a field, , , and . Let send the identity diagram to and every nonidentity basis diagram to . Let be the one-dimensional left module defined by . Then is projective if and only if there exists a nonzero idempotent with for every . Every such idempotent automatically satisfies .
Facts & Assumptions
Given: The diagram algebra over a field, its elementary generators, and their spanning property.
The diagram algebra is generated by ; every basis diagram is a product of these generators, with the empty product giving the identity (Elementary cup-cap diagrams generate every finite planar pairing endomorphism diagram).
Stacking is associative and diagram composition cannot increase the number of propagating strands (Temperley–Lieb planar diagram data and endomorphism modules, Stacking is associative and horizontal juxtaposition is strict monoidal).
Proof
A basis diagram has propagating strands exactly when it is the identity. If either factor in a product has fewer than propagating strands, every exterior through path in the product must pass through a distinct propagating path in that factor; hence the product also has fewer than . Thus the span of nonidentity diagrams is a two-sided ideal and is an algebra homomorphism. Its kernel is spanned by nonempty generator words by [F1].
If is projective, the surjection splits as a left -module map . Put . Then and, for every , . Taking gives , and taking gives .
Conversely suppose , , and for every generator. Every nonempty generator word kills by its rightmost letter, so [F1] gives for all . If , then is a linear combination of nonempty generator words, whence , contradicting . Thus , and , , is an -linear section of . Hence is a direct summand of the free left regular module and is projective.
Steps 2.1 and 2.2 prove both implications and the normalization . No uniqueness assertion is needed for this projectivity equivalence.
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
- R. A. Spencer, The Modular Temperley-Lieb Algebra (standard reference, not scraped)
- Joshua Chen, The Temperley-Lieb Categories and Skein Modules (standard reference, not scraped)