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.
Colored Jones and the volume conjecture — Examples and Counterexamples
1 · Prerequisites
- Abelian Categories
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Extensions, Extension Degree, and Finite Fields
- Applications of the Fundamental Group
- Approximation and Compactness in C(K)
- Artin Presentation Completeness and Braid Combing
- Asymptotic Cones and the Sublinear Triangle Criterion
- Binary Operations, Monoids, Groups and Subgroups
- Braided and Symmetric Monoidal Categories
- Braids as Fundamental Groups of Configuration Spaces
- Bruhat Decomposition and Flags over Finite Fields
- Cardinal Arithmetic, Cofinality and the Alephs
- Categories, Functors and Natural Transformations
- Cayley Graphs, Word Metrics and Quasi-Isometry
- Chain Complexes and Homology
- Chain Homotopy and the Homotopy Category
- Chains, Antichains, Sperner and Dilworth
- Classification of Compact Connected Surfaces
- Classification of Covering Spaces
- Colored Jones and the volume conjecture
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Connectedness
- Constant Rank, Submersions, Immersions and Regular Level Sets
- 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
- Countability Axioms and Cardinal Functions
- Covering Spaces and Lifting
- Crossing signs, writhe, and linking number
- Cup Cap Cross Products and Cohomology Rings
- Cw Complexes and Cellular Homology
- Darboux, L'Hôpital, and Taylor's Theorem
- Derived Functors
- Determinants of Matrices over a Commutative Ring
- 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
- Duality and Rigidity in Monoidal Categories
- Euclidean Ordinary Differential Equations with Smooth Dependence
- Exactness and the Member Calculus
- Ext and Balanced Resolutions
- Exterior Powers, Orientation and Hodge Duality
- Fibrations Fiber Bundles and Homotopy Exact Sequences
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Weyl Invariants, Bruhat Order, and Kostant Harmonics
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Free Modules, Exact Sequences, Projective and Injective Modules
- Free Products and Amalgamation
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Geodesics, the Exponential Map, Completeness, and Hopf–Rinow
- Geometric Braids and Artin Generators
- Graphs, Walks and Connectivity
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Hecke Markov Traces and Polynomial Link Invariants
- Hereditary and Productive Behaviour of the Separation Axioms
- Higher Homotopy Groups and Cofiber Sequences
- Homotopy and Homotopy Equivalence
- Hurewicz Whitehead Freudenthal and Cw Approximation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Kac Moody Algebras from Generalized Cartan Matrices
- Kauffman bracket state sum and the Jones polynomial
- Kunneth Exactness and Splittings over Principal Ideal Domains
- Limits and Colimits
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Long Exact Sequences in Homology
- Manifolds with Boundary Collars and Orientations
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modular Categories, Verlinde Formula, and TQFT
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monoidal Categories and Monoidal Functors
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordered and Unordered Configuration Spaces
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Orientations Poincare Lefschetz and Alexander Duality
- Oriented Links, Braid Closures, and Markov Equivalence
- Partitions of Unity and Paracompactness
- Permutation Statistics, Inversions and Eulerian Numbers
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Plane Graphs, Euler's Formula and the Five Colour Theorem
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Preadditive and Additive Categories and Biproducts
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Principal Series Representations of GL N over a Finite Field
- Projective and Injective Resolutions
- Properties of the Integral and the Working FTC
- Punctured Disks, Mapping Classes, and Point Pushing
- Pure Braids, Fadell–Neuwirth, and Asphericity
- Quantized Enveloping Algebras and Quantum Serre Relations
- Rank Theorems and Embedded Submanifolds
- Reflective Subcategories and the Adjoint Functor Theorems
- Relations, Functions, and Quotients
- Relative Homology Excision and Mayer Vietoris
- Ribbon categories and Reshetikhin–Turaev knot invariants
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sard Theorem and Transversality
- Semidirect Products, Automorphism Groups and Split Extensions
- Separation Axioms: the Hierarchy
- 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
- Simplicial Complexes and Simplicial Homology
- Simplicial Subdivision and Simplicial Approximation
- Simply Connected Plane Domains: the Grand Equivalence
- Singular Chains and Singular Homology
- Singular Cohomology and Coefficient Theorems
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Smooth Vector Bundles and Sections
- Splitting Fields
- Strictification and Mac Lanes Coherence Theorem
- Subobject Lattices Generators and the Grothendieck Axioms
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- Temperley–Lieb Diagram Algebra and Catalan Basis
- Temperley–Lieb Root-of-Unity and Modular Representation Theory
- Temperley–Lieb Semisimplicity and Generic Structure
- Tensor and Fusion Categories
- Tensor Coherence and Algebraic Descent
- Tensor Fields Exterior Algebra and Differential Forms
- Tensor Products of Modules
- The Artin Action on a Free Group
- The Ascoli–Arzelà Theorem
- The Burau Representations
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Diagram Lemmas in an Abelian Category
- The Exponential Function
- The Field of Fractions and Localisation
- The Fundamental Group
- The Fundamental Group of the Circle
- The Fundamental Theorems of Calculus
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Seifert–van Kampen Theorem
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Trees, Forests and Spanning Trees
- Uniform Spaces: the Three Definitions
- Universal Coefficients and Kunneth Theorems
- Universal Properties, Representables and the Yoneda Lemma
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Fields Flows and Lie Derivatives
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Whitney Embedding Tubular Neighbourhoods and Approximation
- Yang–Baxter Operators and Quantum Braid Representations
- Young Diagrams Tableaux and Permutation Modules
2 · Logical flowchart
3 · Definitions, theorems and proofs
None yet.
4 · Examples, counterexamples and false statements
One finite sequence value does not determine asymptotic growth
Statement refuted
For every positive real sequence , every real , and every integer , if , then .
Statement references
Facts & Assumptions
Given: A positive real sequence , a target value , and a finite index .
For every positive real , is defined, and .
Counterexample
Define and for every with . Each term is positive, and .
For every , , so . The sequence of normalized logarithms is therefore eventually zero and has limit . This contradicts the asserted conclusion.
Remarks
This is a sequence-level witness about the information in one finite evaluation. It is not asserted to be a colored Jones sequence and does not refute the volume conjecture.
Unknot, trivial color, and a three-crossing braid value
Example
For every finite braid word whose closure is a knot in the declared generic matrix convention, the generic value is ; the one-strand identity braid has generic value for every . Let be the closure of the positive two-strand braid in the declared crossing convention. With , its generic value is . In addition, assuming the Axiom of Choice and Countable Choice, for every oriented knot the fundamental-color generic value satisfies , where is the library Jones polynomial normalized by .
The braid diagram uses braid height increasing downward. At each positive generator, the strand entering on the right passes over the strand entering on the left; the closure joins each bottom endpoint to the top endpoint in the same position. The resulting closed braid has one component. For the diagram convention, closure arcs are routed outside the rectangular braid box without adding crossings. The diagram is explanatory; the verification uses the displayed matrices.
Example references
Facts & Assumptions
Given: The admissible generic color matrices, their normalization from the preceding definition, and the positive two-strand braid ; for the general fundamental-color identity, assume the Axiom of Choice and Countable Choice.
The generic matrix value is , with in (Normalized colored Jones sequence).
For the fundamental ribbon color and any blackboard-framed braid closure, the ribbon trace satisfies , with and twist scalar ; this statement assumes Countable Choice (The fundamental quantum sl2 ribbon trace matches the Hecke and bracket evaluations).
Under the Axiom of Choice, the library Jones polynomial satisfies , where is the writhe-normalized Kauffman bracket and (The bracket state sum matches the library Jones specialization).
Every braid group element is represented by a finite word in the Artin generators and their inverses, and under AC the Artin presentation identifies these words with geometric braid classes (The braid group by Artin presentation, The Artin presentation is complete for geometric braids).
A geometric braid closure joins each strand endpoint to the endpoint prescribed by its permutation (The closure of a geometric braid).
The positive Artin half twist has determinant crossing sign in the declared oriented projection (Oriented crossing signs, diagram writhe, and blackboard framing).
The opposite geometric half twist is the group inverse of the positive half twist (The elementary geometric half twist, its support disc, and its opposite).
The exponent sum of a word is the sum of its signed generator exponents (The exponent sum of a braid).
Under AC, every nonempty oriented link in is equivalent to a closed geometric braid with at least one strand (Alexander's theorem: every link is a closed braid).
The Axiom of Choice (The Axiom of Choice).
Countable Choice (The Axiom of Countable Choice ()).
Verification
Given: [F1] and the matrix data in the preceding definition.
For , the basis has one vector, , , , . Every braid generator therefore acts as , and the normalized value of every such knot closure is . For the unknot at any , the one-strand identity braid has and trace , so its normalized value is also .
The strand permutation of is , so its two endpoints are interchanged; pairing each bottom endpoint with the top endpoint in the same position therefore produces one component. At , the only nonzero terms of are . On the ordered basis they give and . The middle block satisfies by direct multiplication; the other two diagonal entries of are , hence . Here , , and .
Write a braid word as with , using [F4] under [A1]. Each letter gives one crossing in the braid box. The closure pairs endpoints as prescribed by [F5]; in the diagram convention fixed in the Example, the joining arcs are routed outside the rectangular braid box without added crossings. A positive letter contributes to writhe by [F6]. For a negative letter the opposite half twist [F7] exchanges the over- and under-strands; the determinant in the crossing-sign definition changes sign when its two vectors are exchanged, so that crossing contributes . Thus by [F8].
Substitution into [F1] using step 1.2 yields , where .
Given an oriented knot , choose a braid closure representing it by [F9]. By [F2], the fundamental-color ribbon trace is times the raw bracket and the twist is . Since , formula [F1] gives . By step 1.3 this is the writhe-normalized bracket . The use of [F9] requires [A1], and the framed trace in [F2] requires [A2].
The bracket/Jones theorem [F3] now gives at . Its hypothesis uses AC [A1], while the ribbon-trace identification in [F2] uses ACω [A2], already supplied in step 2.2; the proof keeps those axiom branches separate. Therefore .
Remarks
The all-color ribbon and Laurent-polynomial prerequisites are now supplied locally. The general fundamental-color identification uses the actual matrix-to-bracket and bracket-to-Jones suppliers linked above, with their fixed A/B smoothing chart, positive Artin crossing convention, and separate AC and countable-choice hypotheses. The displayed finite matrix calculation fixes the variable transport .
Sources
- Hitoshi Murakami and Jun Murakami, The colored Jones polynomials and the simplicial volume of a knot, §5
- Hitoshi Murakami, An Introduction to the Volume Conjecture, §§1–4
- Hitoshi Murakami, An Introduction to the Volume Conjecture, §2.4 and Example 2.5
- Louis H. Kauffman, Combinatorial Knot Theory and the Jones Polynomial, §2