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.

The zero-loop perfect-matching standard module is simple

Statement

Let p≥1, q∈{i,−i}, δ=q+q−1=0, and n=2p. Then the right Temperley–Lieb standard module W2p,0(C,0), whose basis consists of noncrossing perfect matchings of 2p sites, is simple. This conclusion concerns the actual module; its ordinary link-state form is identically zero and its zero form quotient is not used.

Facts & Assumptions

Given: p≥1, q=±i, δ=0, the link-state modules and the stacking right action.

[F1]

The link-state basis consists of noncrossing partial matchings with p=(n−t)/2 arcs and t defects (Temperley–Lieb link-state standard modules by defect number).

[F2]

Stacking below a link state defines its right action by the corresponding Temperley–Lieb diagram (The link-state quotient is a right Temperley–Lieb module).

[F3]

The capping form on basis states is δc when all defect paths propagate and zero otherwise (The link-state Gram form is symmetric and invariant).

[F4]

At a critical complex label the link-state capping form is nondegenerate (Critical complex Temperley–Lieb standard modules are simple).

[F5]

Criticality is κ<∞ and κ∣(t+1), with κ=ord⁡(q2) (Complex Temperley–Lieb critical labels and reflection).

[F6]

Temperley–Lieb diagrams are noncrossing matchings; stacking removes each closed component with factor δ, and the composition is associative (Temperley–Lieb planar diagram data and endomorphism modules, Stacking is associative and horizontal juxtaposition is strict monoidal).

Proof

technique · Replace the identically zero perfect-matching form by its first coefficient in the loop parameter, identify that pairing with a critical one-defect form, and construct operators that generate every basis state
1.1F1F3givenconstruct

For a parameter variable b, let ϕb be the link-state form on the fixed basis of W2p,0(C,b). If a,c are perfect matchings, their overlay is a disjoint union of C(a,c)≥1 alternating cycles, counting a shared arc as a two-edge cycle; therefore ϕb(a,c)=bC(a,c). Define the bilinear form ϕ′(a,c)=ddbϕb(a,c)∣b=0. It follows that ϕ′(a,c)=1 when C(a,c)=1 and 0 when C(a,c)>1.

2.1F1F3step 1.1construct

Delete site 2p and its incident arc from a perfect matching, and declare its partner to be the single defect. This is a bijection from perfect matchings on 2p sites to the link-state basis of W2p−1,1: the inverse joins the unique defect to the appended site 2p. For a pair a,c, deleting the two arcs incident to site 2p turns exactly the overlay cycle containing that site into the open path between the defects and leaves the other C(a,c)−1 cycles unchanged. Hence the ordinary one-defect Gram value of the images is bC(a,c)−1, whose value at b=0 equals ϕ′(a,c). Thus the matrix of ϕ′ is exactly the Gram matrix of W2p−1,1(C,0).

3.1F4F5step 2.1given

For W2p−1,1 the arc count is p−1, the defect count is 1, and q2=−1 has order κ=2. Since κ∣(1+1), this is a critical label. By [F4], its Gram form is nondegenerate; step 2.1 then shows that ϕ′ is nondegenerate.

3.2F1F2F3F6step 1.1step 2.1algebra

For two link states x,y on 2p sites with two defects, define Dx,y to be the Temperley–Lieb diagram whose bottom arcs are those of x, whose top arcs are those of y, and whose two unmatched bottom sites are joined to the two unmatched top sites in left-to-right order by propagating strands. This matching is planar and is an allowed basis diagram. Let x′ and y′ be the perfect matchings obtained by joining the two defects of x and y, respectively. If z is a basis perfect matching and C(y′,z) is the number of cycles in the overlay of y′ and z, stacking z above Dx,y leaves the bottom matching x′ and removes exactly C(y′,z)−1 closed cycles. Therefore z⋅Dx,y=δC(y′,z)−1x′, where the coefficient at δ=0 is defined as 1 when C(y′,z)=1 and 0 when C(y′,z)>1. This coefficient is exactly ϕ′(y′,z), so z⋅Dx,y=ϕ′(y′,z)x′. The same equality holds for every z by linearity.

4.1F1F2step 3.1step 3.2choosealgebra∎

Let z≠0. Nondegeneracy of ϕ′ gives a nonzero functional ϕ′(−,z), so at least one perfect-matching basis vector y′ has ϕ′(y′,z)≠0. For any target basis matching x′, cut from x′ and y′ the arcs incident to site 2p to obtain two-defect link states x,y. By step 3.2, z⋅Dx,y is a nonzero scalar multiple of x′. Thus the submodule generated by z contains every basis vector and equals W2p,0. Every nonzero submodule contains such a z, so the module is simple.

Depends on

Used by

Dependency tree · two levels

19 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