Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

Critical Temperley–Lieb Gram determinants in a digit unit interval

Statement

The polynomial Gram-determinant identity of The Temperley–Lieb link-state Gram determinant holds over every field, with polynomial continuation at zeros of displayed denominators. Let ℓ<∞, let n+1=Aℓ and m+1=Bℓ with 0<B≤A and n−m even. In characteristic zero, Wn,m is simple. In characteristic p>0, write B=pvb′ with p∤b′ and let b∈{1,…,p−1} be the residue of b′ modulo p. If ⌊A−B2⌋<pv(p−b), then Wn,m is simple. If ℓ=∞, every Wn,m is simple. Also Wn,n−2 is simple whenever [n]δ≠0.

Facts & Assumptions

Given: A field, a loop parameter, its recurrence quantum characteristic, and the allowed labels in the Statement.

[F1]

The complex Gram determinant is ∏j=1(n−m)/2([m+1+j]/[j])dim⁡Wn,m+2j, with polynomial continuation (The Temperley–Lieb link-state Gram determinant).

[F2]

Nondegeneracy of a cell form makes its module simple (Nonzero Temperley–Lieb cell forms give all simple heads).

[F3]

The recurrence quantum characteristic and quantum integers are defined over every field (Temperley–Lieb quantum integers and quantum characteristic), and a root of X2−δX+1 may be adjoined to the field (F[x]/(p) for monic irreducible p is a field extension containing the root x+(p) with unique reduced representatives).

Proof

Given: The data and hypotheses in the Statement.

1.1F1givenalgebra

Each Gram entry is a monomial in the loop parameter with integer coefficient, so its determinant is a polynomial D(T)∈Z[T]. Clear the quantum-integer denominators in [F1], obtaining an equality between integer polynomials for every complex loop parameter. Every complex number has the form q+q−1 for a nonzero q, and a polynomial with infinitely many distinct complex zeros is zero. Thus this is an integer polynomial identity, which reduces to an identity over every field. No division after specialization is involved in this conclusion.

2.1F1F3step 1.1constructalgebra

Adjoin q0≠0 with q0+q0−1=δ using [F3], and work in formal Laurent series over that extension. Set q(t)=q0(1+t) and δ(t)=q(t)+q(t)−1. As a rational function of t, δ(t) has a pole at t=−1, so it is nonconstant. For every nonzero polynomial P∈K[T], P(δ(t)) is a nonzero rational function: if deg⁡P=d>0, it has a pole of order d at t=−1, and if d=0 it is a nonzero constant. The Laurent expansion at t=0 of a nonzero rational function is nonzero. Thus substitution P(T)↦P(δ(t)) is injective, and every nonzero polynomial remains a nonzero series. Every quantum integer [j]δ(t) is nonzero by its Laurent expression q(t)1−j(1−q(t)2j)/(1−q(t)2), interpreted as a rational identity. We may consequently use the product in [F1] in the Laurent-series field. Its constant coefficient is D(δ).

3.1F3step 2.1algebra

Suppose the characteristic is p>0 and put c=1 for odd p and c=2 for p=2. For every positive integer j, the order of 1−(1+t)2j is cpνp(j): factor 2j=phu with p∤u, use (1+t)ph=1+tph, and the coefficient of tph is the nonzero residue of u. If q02≠1, finite ℓ is the order of q02, and it is prime to p because a field has no nonidentity element of order p. Thus [j]δ(t) has order zero for ℓ∤j and order cpνp(j/ℓ) for ℓ∣j. If q02=1, the recurrence gives [j]δ=jq0j−1 and ℓ=p; the denominator 1−q(t)2 has order c, so the order of [j]δ(t) is c(pνp(j)−1). These statements hold also in characteristic two.

4.1F1F2step 2.1step 3.1algebra

For a critical label m+1=Bℓ, the numerator and denominator of a factor in [F1] both have order zero when ℓ∤j. If j=j′ℓ, step 3.1 shows that their orders agree whenever νp(B+j′)=νp(j′), in both of its cases, including ℓ=p. Write B=pvb′ as in the Statement and suppose 0<j′<pv(p−b). If pv∤j′, then νp(j′)<v and adding B preserves that valuation. Otherwise j′=pvh with 1≤h<p−b<p, so both h and b′+h are nonzero modulo p and both valuations equal v. Thus the equality holds for every j′≤⌊(A−B)/2⌋ under the stated bound. Every factor in the determinant product is consequently a Laurent-series unit with nonzero constant term. Their product has nonzero constant term, proving D(δ)≠0. This nonvanishing descends to the original field, so [F2] proves simplicity.

5.1F1F2F3step 1.1step 2.1step 4.1algebra∎

In characteristic zero with finite ℓ, one has q02≠1. Each quantum integer whose index is a multiple of ℓ has a simple zero along q(t), because differentiating 1−q(t)2j gives nonzero coefficient −2j at t=0. All other indices give units. Therefore each numerator and denominator in the critical determinant product has the same order, either zero or one, and its quotient has nonzero constant term. The same argument as in step 4.1 proves simplicity. If ℓ=∞, every specialized numerator and denominator in [F1] is nonzero, so the determinant is nonzero directly. Finally, when m=n−2, the product consists solely of [n]δ to exponent one. Thus [n]δ≠0 implies the last simplicity assertion.

Depends on

Used by

Dependency tree · two levels

16 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