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.

A Jones–Wenzl annihilator exists exactly when the trivial module is projective

Statement

Let K be a field, δ∈K, n≥0, and A=TLn(K,δ). Let ε:A→K send the identity diagram to 1 and every nonidentity basis diagram to 0. Let Kε be the one-dimensional left module defined by ε. Then Kε is projective if and only if there exists a nonzero idempotent e∈A with die=0 for every 1≤i<n. Every such idempotent automatically satisfies ε(e)=1.

Facts & Assumptions

Given: The diagram algebra over a field, its elementary generators, and their spanning property.

[F1]

The diagram algebra is generated by d1,…,dn−1; 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).

[F2]

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

technique · Split the augmentation and use the generator-word kernel
1.1F1F2givenalgebra

A basis diagram has n propagating strands exactly when it is the identity. If either factor in a product has fewer than n 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 n. 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].

2.1givenstep 1.1construct

If Kε is projective, the surjection ε:A→Kε splits as a left A-module map s. Put e=s(1). Then ε(e)=1 and, for every a∈A, ae=s(ε(a))=ε(a)e. Taking a=e gives e2=e, and taking a=di gives die=0.

2.2F1step 1.1algebra

Conversely suppose e≠0, e2=e, and die=0 for every generator. Every nonempty generator word kills e by its rightmost letter, so [F1] gives ae=ε(a)e for all a∈A. If ε(e)=0, then e∈ker⁡ε is a linear combination of nonempty generator words, whence e2=0, contradicting e2=e≠0. Thus ε(e)=1, and s:Kε→A, s(λ)=λe, is an A-linear section of ε. Hence Kε is a direct summand of the free left regular module and is projective.

3.1step 2.1step 2.2∎

Steps 2.1 and 2.2 prove both implications and the normalization ε(e)=1. 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