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.
Two adjacent noncomposable Gaussian pivots in either finite order
Example
Let be a cochain complex with objects differentials , (rows , columns ), (rows , columns ) and , with and isomorphisms and with , and ; this is the Lemma A.2 shape of Clark–Morrison–Walker. The two pivots and are adjacent but not composable, so the cancellation order is a genuine choice, and the example computes the reduction in each order.
Facts & Assumptions
Given: The cochain complex displayed above, with the invertible entries of and of , and the two cancellation orders: cancel first and then in the reduced complex, or cancel first and then .
At a pivot of a block in a decomposition , , the candidate reduction keeps for and the components of the neighbouring differentials along the retained summands and , and replaces the differential by the Schur complement (An invertible cochain differential block and its candidate reduction, Triangular basis changes diagonalize an invertible differential block).
Each single cancellation in its current complex gives cochain maps and a degree- homotopy with , , , , (Explicit strong deformation retract from Gaussian cancellation).
A finite sequence of cancellations with invertible current pivots composes: the composite data is , , and satisfies the same five identities, and reductions obtained from different valid choices are homotopy equivalent (Finite iteration of current invertible-block cancellations).
Verification
Complex check. The composite has -entry the sum over of the products of entries of and , and each of the three displayed matrix identities , , is exactly the hypothesis that consecutive differentials of vanish; the remaining composites are zero because .
Cancelling first. Write and , so that the pivot block of is , with , and . The Schur complement of the pivot is ; the incoming arrow of the reduction is the -component of , and the outgoing arrow is the restriction of to the rows , namely , in which the pivot still appears unchanged.
Cancelling first. In the decomposition and , the pivot has complement blocks (row ) and , so the Schur complement is the arrow with entries and ; the incoming arrow is the restriction of to the rows , namely , and the outgoing arrow is . Cancelling second gives the middle differential on , the incoming arrow and the outgoing arrow .
Cancelling second. In the complex of step 1.2 the pivot sits in the block of with retained summands of the degree- object and of the degree- object, so the new middle differential is the Schur complement , while the incoming arrow loses its -component and becomes ; the outgoing arrow is .
Order comparison. By steps 1.2 and 2.1, cancelling then leaves the cochain complex ; by step 1.3, cancelling then leaves the same objects and the same four arrows. In each order the composite of the single-cancellation data is by [L3] the strong deformation retract data , , of onto that reduction, satisfying , , , and ; [L3] also gives that the two reductions are homotopy equivalent.
A concrete instance over . Take every entry of equal to , so ; take , and . Then , and , so is a complex. The two reduced middle arrows are and , and the end arrows are and ; both orders give the reduced complex , whose composites and vanish. ∎
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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
- David Clark, Scott Morrison and Kevin Walker, Fixing the Functoriality of Khovanov Homology, Appendix A.1, Lemma A.2, printed pp. 1562-1563 (standard reference, not scraped)
- Dror Bar-Natan, Fast Khovanov Homology Computations, section 4 Lemma 4.2 and section 5, printed p. 5 (PDF p. 5) (standard reference, not scraped)