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 and with and even. In characteristic zero, is simple. In characteristic , write with and let be the residue of modulo . If then is simple. If , every is simple. Also is simple whenever .
Facts & Assumptions
Given: A field, a loop parameter, its recurrence quantum characteristic, and the allowed labels in the Statement.
The complex Gram determinant is , with polynomial continuation (The Temperley–Lieb link-state Gram determinant).
Nondegeneracy of a cell form makes its module simple (Nonzero Temperley–Lieb cell forms give all simple heads).
The recurrence quantum characteristic and quantum integers are defined over every field (Temperley–Lieb quantum integers and quantum characteristic), and a root of may be adjoined to the field ( for monic irreducible is a field extension containing the root with unique reduced representatives).
Proof
Given: The data and hypotheses in the Statement.
Each Gram entry is a monomial in the loop parameter with integer coefficient, so its determinant is a polynomial . Clear the quantum-integer denominators in [F1], obtaining an equality between integer polynomials for every complex loop parameter. Every complex number has the form for a nonzero , 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.
Adjoin with using [F3], and work in formal Laurent series over that extension. Set and . As a rational function of , has a pole at , so it is nonconstant. For every nonzero polynomial , is a nonzero rational function: if , it has a pole of order at , and if it is a nonzero constant. The Laurent expansion at of a nonzero rational function is nonzero. Thus substitution is injective, and every nonzero polynomial remains a nonzero series. Every quantum integer is nonzero by its Laurent expression , interpreted as a rational identity. We may consequently use the product in [F1] in the Laurent-series field. Its constant coefficient is .
Suppose the characteristic is and put for odd and for . For every positive integer , the order of is : factor with , use , and the coefficient of is the nonzero residue of . If , finite is the order of , and it is prime to because a field has no nonidentity element of order . Thus has order zero for and order for . If , the recurrence gives and ; the denominator has order , so the order of is . These statements hold also in characteristic two.
For a critical label , the numerator and denominator of a factor in [F1] both have order zero when . If , step 3.1 shows that their orders agree whenever , in both of its cases, including . Write as in the Statement and suppose . If , then and adding preserves that valuation. Otherwise with , so both and are nonzero modulo and both valuations equal . Thus the equality holds for every 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 . This nonvanishing descends to the original field, so [F2] proves simplicity.
In characteristic zero with finite , one has . Each quantum integer whose index is a multiple of has a simple zero along , because differentiating gives nonzero coefficient at . 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 , the product consists solely of to exponent one. Thus 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
- Robert A. Spencer, The Modular Temperley–Lieb Algebra (standard reference, not scraped)