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.
BMW descending matchings are independent by closure pairing
Statement
Let and let . For each , index the standard descending matching tangles by the perfect matchings of the boundary endpoints. Reflect a second such tangle across the horizontal midline and glue corresponding boundary endpoints to obtain a closed diagram. Let be the matrix whose entry is the scalar Dubrovnik evaluation of this closure. Then is nonzero in , its image is a non-zero-divisor in , and the standard matching tangles are linearly independent over . The assertion is over this universal coefficient extension and makes no independence claim after an arbitrary nonflat specialization.
Statement references
Facts & Assumptions
Given: The standard descending tangle representatives, the scalar Dubrovnik evaluation, and the coefficient rings .
The scalar evaluation is defined on every closed diagram, is unchanged by regular isotopy, multiplies by at the two curls and by for each free circle, and the coefficient ring is an integral domain (Scalar evaluation of framed Kauffman link diagrams).
is free over with basis , so the inclusion is injective (BMW relations in the Dubrovnik parameter convention).
For every connector there is one standard loop-free, self-crossing-free totally descending tangle; any two such diagrams with the same connector are regularly isotopic (BMW tangle skein spanning by descending matchings).
Diagram
In the schematic, solid blue edges are one endpoint matching and dashed red edges are the other. Each vertex belongs to one edge of each color, so the union decomposes into alternating cycles; each such cycle is one component after closure.
Proof
Define the ring homomorphism by , , and ; the defining relation maps to , so the map is well defined. For any closed diagram in an entry of , the skein rule in [F1] becomes under . Switch finitely many crossings until the closed diagram is totally descending; these switches do not change its specialized value. Pulling the first traversed strands above the later ones unties every component, and the specialized curl factor is . The result is a disjoint union of trivial circles, where is the number of connected components in the union of the two endpoint matchings. Hence . The closure is a closed diagram at every , including the empty diagram for .
If , their union consists of doubled edges, so . If , each connected component of their union is an alternating even cycle, and at least one has length at least four; therefore . Let be the number of matchings, with for . In the determinant expansion of , the identity permutation contributes . Every nonidentity permutation has at least one off-diagonal entry of degree at most , while every other entry has degree at most , so its term has degree at most . The identity term is therefore the unique leading term with coefficient , and . Thus in . For the matrix is , so the same conclusion holds.
Since is a domain by [F1], multiplication by is injective on . By [F2], every has a unique form with . If , uniqueness gives in , hence ; so is a non-zero-divisor in .
Suppose in the tangle skein algebra over . Close this relation against each reflected standard matching and apply the scalar evaluation; closure respects the skein, curl, and circle relations, so the resulting equations are . Multiplication by the adjugate gives . Step 3.1 shows each coordinate is zero. Therefore the standard tangles are linearly independent over . The same argument includes and , whose matrices are respectively and .
Depends on
Used by
Dependency tree · two levels
11 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
- Frederick M. Goodman and Holly Hauschild, Affine Birman–Wenzl–Murakami Algebras and Tangles in the Solid Torus, §§4.1–4.4 and 5.1 (standard reference, not scraped)
- Louis H. Kauffman, An Invariant of Regular Isotopy, Transactions of the AMS 318(2) (1990), §§VI–VII (standard reference, not scraped)