Alphabeta Math
PropositionStatement: 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 link-state form is identically zero only at zero loop value with no defects

Statement

Let R be a nonzero commutative ring with unit, δ∈R, n≥0, and 0≤t≤n with n−t even. For the link-state form ϕn,t of The link-state Gram form is symmetric and invariant, the form is identically zero if and only if t=0, n>0, and δ=0. At n=t=0 the form is the unit form on the empty link state.

This statement concerns an identically zero form, not nondegeneracy or the radical at other parameter values.

Facts & Assumptions

Given: A nonzero commutative ring R with unit, δ∈R, n≥0, and an allowed defect number t.

[F1]

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

[F2]

For basis link states, ϕn,t is δ to the number of loops when all t strands propagate, and is zero when fewer than t strands propagate (The link-state Gram form is symmetric and invariant).

Proof

technique · direct
1.1F1F2givenconstruct

Suppose t>0 and put a=(n−t)/2. If a=0, take x=y to be the all-defect state; gluing gives t through paths and no loops, so ϕn,t(x,y)=1R≠0. If a>0, let x have adjacent arcs (1,2),(3,4),…,(2a−1,2a) and defects at 2a+1,…,n. Let y have arcs (2,3),(4,5),…,(2a,2a+1), defects at 1 and 2a+2,…,n. Both are link states. Their glued graph has one path alternating across sites 1,…,2a+1 and t−1 straight paths at the shared defects; it has no closed component. Hence ϕn,t(x,y)=1R≠0.

2.1F1F2step 1.1construct

Suppose t=0 and n>0, so n=2a with a≥1. Every pair of link states glues to a finite graph in which every boundary site has degree two; each connected component is a cycle, and at least one cycle occurs. Thus every form value is divisible by δ, so the form is identically zero when δ=0. Conversely, let x have adjacent arcs (1,2),(3,4),…,(n−1,n), and let y have the outer arc (1,n) together with the adjacent interior arcs (2,3),(4,5),…,(n−2,n−1). Their overlay is one cycle, so ϕn,0(x,y)=δ. If δ≠0, this value is nonzero and the form is not identically zero.

3.1F1F2step 1.1step 2.1∎

If n=t=0, there is one empty link state. Its reflection glues to the empty diagram with no loops, so ϕ0,0(x,x)=1R≠0. Together with the cases already treated, this exhausts all allowed t and proves the equivalence.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

6 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