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.
Temperley–Lieb, Hecke normalization and quantum Potts chains — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Braided and Symmetric Monoidal Categories
- Bruhat Decomposition and Flags over Finite Fields
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Free Modules, Exact Sequences, Projective and Injective Modules
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Kazhdan–Lusztig Bases, Polynomials, and Cells
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Principal Series Representations of GL N over a Finite Field
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Temperley–Lieb Diagram Algebra and Catalan Basis
- Temperley–Lieb Towers, Spin Chains, and Scaling Interfaces
- Temperley–Lieb, Hecke normalization and quantum Potts chains
- Tensor Coherence and Algebraic Descent
- Tensor Products of Modules
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Young Diagrams Tableaux and Permutation Modules
2 · Summary
3 · Logical flowchart
4 · Definitions, postulates, theorems and proofs
None yet.
5 · Examples, experiments and counterexamples
Local spectrum and noncommuting terms
Example
Fix and the two-site open chain . Let with and finite , and set . A classical diagonal replacement here means a density matrix diagonal in the computational basis . The exact finite Gibbs density of this matrix is not diagonal in that basis. Moreover are nontrivial projections with spectrum , satisfy , and do not commute.
Example references
Facts & Assumptions
Given: , , , , and .
These parameter and boundary hypotheses are exactly those in the Example.
Finite Hermitian Potts-clock chain: the inner product is linear in its first argument; , , , , and ; the spectral projections are self-adjoint idempotents summing to . A self-adjoint is positive definite if for every nonzero .
The finite Potts Gibbs matrix is well-defined at every finite inverse temperature: is self-adjoint, , and .
The exponential is a continuous bijection from onto : is bijective, so it is injective and has strictly positive values on real inputs.
Potts local algebra and braid quotient: the operators and are the adjacent local Potts Temperley-Lieb generators at loop weight .
Proof
By [F4], and are the odd and even adjacent local generators in the stated Potts Temperley-Lieb representation. Since , . Therefore Both and are orthogonal projections. Their ranks are in the -dimensional two-site space; for each has spectrum .
The matrix entry from to is because is diagonal in this basis. Hence is not diagonal.
Acting on gives and . These vectors differ for every , so .
Each eigenvalue of has a unit eigenvector . By [F2], is self-adjoint; using the linear-first inner product from [F1], , so . Since , multiplication is injective, and [F3] makes injective; [F3] also gives positive weights. The projections in [F1] sum to the identity, so is positive definite: for nonzero , . Now suppose were diagonal in the computational basis. By [F2], and , so would be diagonal. On the -eigenspace of , acts by ; these scalars are distinct for distinct real , hence the eigenspaces of are exactly those of . Every computational basis vector is an eigenvector of a diagonal , and therefore would be an -eigenvector. This contradicts the nonzero off-diagonal entry in step 1.2, so is not diagonal.
At , the spectral definition in [F1] gives , so [F2] gives , which is diagonal. If , [F1] gives , a diagonal matrix, so its spectral Gibbs density is diagonal as well. These boundary cases show why the nonzero assumptions are required.
Remarks
This is an exact finite-matrix example. It records no observation and establishes no claim about phase transitions, thermalization, or a material realization.