ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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 rank-three one-defect link-state module

Example

Let $k$ be any field, $δ \in k$ , and consider $W_{3, 1} (k, δ)$ . Its basis consists of the state $a$ with an arc between sites $1$ and $2$ and a defect at site $3$ , and the state $b$ with a defect at site $1$ and an arc between sites $2$ and $3$ . For the elementary diagrams $d_{1}, d_{2}$ and the Gram form $ϕ_{3, 1}$ ,

$a \cdot d_{1} = δ a, a \cdot d_{2} = b, b \cdot d_{1} = a, b \cdot d_{2} = δ b,$

and

$[ϕ_{3, 1}]_{(a, b)} = (\begin{array}{cc} δ & 1 \\ 1 & δ \end{array}) .$

At $δ = 0$ the form is nondegenerate, so $W_{3, 1} (k, 0)$ is simple by Nonzero Temperley–Lieb cell forms give all simple heads.

Facts & Assumptions

Given: A field $k$ , a parameter $δ \in k$ , and $W_{3, 1} (k, δ)$ .

[F1]

The basis of $W_{n, t}$ consists of link states with $n$ sites and $t$ defects; its action is stacking on the right (Temperley–Lieb link-state standard modules by defect number, The link-state quotient is a right Temperley–Lieb module).

[F2]

$d_{i}$ has a cap at top sites $i, i + 1$ , a cup at bottom sites $i, i + 1$ , and vertical strands elsewhere; stacking removes each closed loop with coefficient $δ$ (Temperley–Lieb planar diagram data and endomorphism modules).

[F3]

The Gram form is computed by reflecting and gluing link states, and is the cellular form (The link-state Gram form is symmetric and invariant, The Temperley–Lieb link-state diagram basis is cellular).

[F4]

A nonzero link-state cell form gives a simple head, and its quotient is simple; if the form is nondegenerate then that quotient is the whole module (Nonzero Temperley–Lieb cell forms give all simple heads).

Verification

technique · direct

1.1F1givenconstruct

For $n = 3$ and $t = 1$ there is one arc. The only noncrossing placements are $a$ , with arc $(1, 2)$ and defect $3$ , and $b$ , with defect $1$ and arc $(2, 3)$ . The dimension formula of Link states are counted by a ballot-number difference gives $(\binom{3}{1}) - (\binom{3}{0}) = 2$ , so these two distinct states are the full basis.

2.1F1F2step 1.1

For $a \cdot d_{1}$ , the cap of $d_{1}$ joins the two endpoints of $a$ 's arc, making one closed loop; the bottom cup of $d_{1}$ leaves the same arc, so $a \cdot d_{1} = δ a$ . For $a \cdot d_{2}$ , tracing from the defect at site $3$ through the top cap of $d_{2}$ , then through the arc of $a$ and the vertical strand at site $1$ , leaves a defect at site $1$ and a cup at sites $2, 3$ , so $a \cdot d_{2} = b$ . For $b \cdot d_{1}$ , tracing from the defect at site $1$ through $d_{1}$ 's cap, then through $b$ 's arc and the vertical strand at site $3$ , leaves the arc at sites $1, 2$ and a defect at site $3$ , so $b \cdot d_{1} = a$ . For $b \cdot d_{2}$ , the cap closes $b$ 's arc into one loop and the bottom cup leaves $b$ , so $b \cdot d_{2} = δ b$ .

2.2F2F3step 1.1

Gluing $a$ with its reflection creates one loop, as does gluing $b$ with its reflection, so $ϕ (a, a) = δ = ϕ (b, b)$ . Gluing $a$ to the reflection of $b$ creates one through path and no loop, so $ϕ (a, b) = 1$ ; by symmetry $ϕ (b, a) = 1$ . These four values give the displayed Gram matrix.

3.1F3F4step 2.2algebra∎

At $δ = 0$ , if $x a + y b$ lies in the radical then pairing with $a$ gives $y = 0$ and pairing with $b$ gives $x = 0$ . Thus the radical is zero and the cell-form quotient is $W_{3, 1}$ itself. The form is nonzero, so [F4] makes this module simple.

Remarks

The two basis half-diagrams use the same boundary convention as the A-page definition; defects are the strands meeting the top boundary.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

13 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.