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.

Exact Temperley–Lieb truncation reduces decomposition to trivial factors

Statement

Let K be any field, δ∈K, and let 0≤r≤n with n−r even. Assume r>0 or δ≠0 or n=r=0. Put An=TLn(K,δ), use the right modules Wn,t of Temperley–Lieb link-state standard modules by defect number, and put Dn,t=Wn,t/rad⁡ϕn,t. There are y,z:n→r with y∘z∗=1r, and for r>0 both may be chosen as basis monic diagrams. There is an idempotent e∈An with eAne≅Ar such that M↦Me is exact, sends Wn,t to Wr,t, and sends Dn,t to Dr,t, with value zero when t>r.

Consequently, for every allowed m, [Wn,m:Dn,r]=[Wr,m:Dr,r], where Wr,m=0 if m>r. The module Dr,r=Wr,r is one dimensional and every diagram generator acts by zero. Thus the decomposition problem reduces exactly to multiplicities of this trivial module. The excluded case n>r=0,δ=0 has Dn,0=0 and is not a simple label.

Facts & Assumptions

Given: The field, loop parameter, labels, diagram category and right link-state modules in the Statement.

[F2]

The coefficient-of-identity forms are symmetric and satisfy ϕ(xa,w)=ϕ(x,wa∗) (The link-state Gram form is symmetric and invariant).

[F3]

The nonzero form quotients Dn,t are a complete pairwise nonisomorphic list of absolutely simple modules (Nonzero Temperley–Lieb cell forms give all simple heads).

Proof

Given: The data and hypotheses in the Statement.

1.1F1givenconstructalgebra

We construct y,z:n→r with y∘z∗=1r. Write n=r+2k. If k=0, take identities. If r>0, take y with bottom cups (1,2),(3,4),…,(2k−1,2k) and all remaining sites propagating; take z with cups (2,3),(4,5),…,(2k,2k+1) and all remaining sites propagating. In y∘z∗, the first through strand follows the single alternating chain through sites 1,2,…,2k+1, while each remaining through strand is straight. There is no closed component, and the exterior matching is 1r. If r=0 and δ≠0, choose the same adjacent perfect matching y=z0 on n=2k sites and put z=δ−kz0. Then y∘z∗=δ−kδk10=10. This also handles n=r=0 with the empty diagram and no scalar inversion.

2.1F1step 1.1algebra

Set e=z∗∘y∈An. Step 1.1 gives e2=e. The map Ar→eAne sending a to z∗∘a∘y is multiplicative because y∘z∗=1r, and its inverse is b↦y∘b∘z∗. Indeed the first composite is identity, and the second is b↦ebe=b on the corner. Thus it is an algebra isomorphism with identity 1r mapping to e.

3.1step 2.1algebra

The functor M↦Me preserves exact sequences. If 0→M′→M→M′′→0 is exact, its injection remains injective on the subspaces obtained by multiplication by e. If x′′e∈M′′e, lift x′′ to x∈M and then xe lifts x′′e, proving surjectivity. If xe maps to zero, it belongs to M′ and satisfies (xe)e=xe, hence belongs to M′e, proving exactness in the middle. These are corner-module maps under step 2.1.

3.2F1step 1.1step 2.1algebra

For every label t, the map Wn,te→Wr,t sending xe to x∘z∗ is well-defined, since diagrams of propagation less than t remain such after composition. Its inverse sends u:r→t to u∘y, which lies in Wn,te. Their composites are identity by y∘z∗=1r and xe=x∘z∗∘y. They respect right Ar action under the corner identification in step 2.1. If t>r, every diagram r→t has propagation less than t, so both spaces vanish.

4.1F2step 1.1step 3.1step 3.2algebra

We verify compatibility with radicals without requiring e=e∗. Swapping y,z in step 3.2 identifies Wn,te∗ with Wr,t by x↦x∘y∗, whose inverse is v↦v∘z. The form pairing of u∘y and v∘z is the coefficient of 1t in u∘y∘z∗∘v∗=u∘v∗, hence is ϕr,t(u,v). Moreover, for x∈Wn,te and any w∈Wn,t, invariance gives ϕn,t(x,w)=ϕn,t(xe,w)=ϕn,t(x,we∗). Therefore x is in the full radical precisely when its pairing against Wn,te∗ vanishes. Under the two identifications this is exactly the condition that u belongs to rad⁡ϕr,t. Thus (rad⁡ϕn,t)e corresponds to rad⁡ϕr,t, and exactness in step 3.1 proves Dn,te≅Dr,t.

5.1F3step 3.1step 3.2step 4.1algebra

A finite-dimensional An-module has a composition series by induction on its vector-space dimension. Apply the exact functor of step 3.1 to such a series for Wn,m. By [F3] and step 4.1, each simple factor Dn,t contributes either zero or the simple factor Dr,t. Distinct surviving labels remain distinct by [F3]. In particular, only the factor with t=r contributes Dr,r, and it contributes once. Step 4.1 identifies the resulting filtered module with Wr,m, giving the claimed multiplicity equality.

6.1F1F2step 1.1step 5.1algebra∎

The sole basis vector of Wr,r is 1r; every generator lowers propagation and thus acts by zero, and its form value on that vector is 1. Hence Dr,r=Wr,r is the stated one-dimensional module. Finally, for n>0 even and δ=0, gluing any two perfect matchings creates at least one closed component, so ϕn,0 is identically zero and Dn,0=0. This explains the precise excluded branch and completes the assertion over every field, including characteristic two.

Depends on

Used by

Dependency tree · two levels

17 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