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.
Seifert-matrix certificate for the Conway diagram
Statement
Assume the Axiom of Choice. For the oriented Conway diagram fixed on the preceding item, the Seifert smoothing and band construction yields a connected embedded Seifert surface with a basis for its first homology whose positive-push-off Seifert matrix is
Statement references
Facts & Assumptions
Given: Full AC, the Conway diagram fixed by the preceding item, and the positive-push-off convention for Seifert matrices.
Full AC, written AC, is The Axiom of Choice. It supplies countable choice through AC implies DC implies countable choice for the finite-projection/surface interface.
Conway knot and its Piccirillo trace partner fixes by Piccirillo's diagram.
Seifert disk-and-band construction from an oriented knot diagram and Termination and finite output of the Seifert diagram procedure supply the finite disk-and-band data. Seifert disks and bands form an embedded oriented spanning surface proves that these data realize a connected embedded oriented surface with the specified knot boundary.
Seifert pairing and matrix of an oriented knot uses for the positive push-off of a basis curve in the oriented surface.
The Seifert pairing is bilinear on integral homology classes, so a basis change by an integral unimodular matrix replaces by . Well-definedness of the Seifert pairing
Linking is the signed intersection number, equivalently the signed mixed-crossing count with the positive-meridian orientation. Linking number equals signed intersection with a spanning surface
Proof
Transcribe the left knot in [F1], ignoring its red mutation circle. Number its crossings at the following approximate pixel centers in the original source image: . These coordinates identify the crossing neighborhoods, not a metric hypothesis. Start at the underpass of crossing and follow the strand toward crossing . The complete cyclic under/over visit word is . Label the outgoing arc after each successive visit by . Listing each crossing counterclockwise, starting with its incoming under-arc, gives the following PD list: . Each of the eleven source gaps is used once as an underpass; the matching unbroken source arc is its overpass. The two extra apparent breaks on the horizontal arcs and the bottom break occur at the red mutation circle and are joined without any knot crossing. Thus this is a transcription of the specified diagram, rather than a knot-table identification.
Let be a four-strand braid read left to right, where has strand over strand . Close corresponding ends outside the braid without extra crossings. Its PD list, obtained by following its four strands, is . The arc relabeling carries the list of step 1.1 to this list: its crossings go respectively to , with cyclic rotation by two at every crossing. These are equal connected oriented ribbon diagrams with the same overpasses. Their equivalence involves no crossing change: thicken corresponding vertices and edges in the projection sphere, identify these strips by the specified cyclic orders, and extend over the complementary disk faces. One may realize the identification by first matching a thickened spanning tree, then matching the remaining arcs in their disk faces by innermost-bigon isotopies, and finally using the disk Alexander isotopy on the faces. Lifting the crossing neighborhoods with their retained over/under heights gives an ambient isotopy of the knots and their Seifert disk-and-band data. Either direction along the single knot is available; the reversed orientation will be handled as well.
Apply [F2] to this braid's smoothing. Its four circles give four disks, and its eleven crossings give eleven half-twisted bands. The surface retracts onto the graph with four consecutive vertices and one edge for every braid letter. Choosing one edge between each consecutive vertex pair gives a spanning tree. For each fixed adjacent pair of disks, the cycles between consecutive bands form an integral basis: relative to the fundamental cycles of the non-tree edges they are successive differences, an integral triangular change of basis with diagonal entries . In the order of disk pairs , use the eight intervals of braid positions . Orient each cycle to run forward on the upper numbered disk and backward on the lower one, and join through the indicated two bands. This constructs eight actual cycles on the embedded surface, not abstract matrix generators. Its Euler characteristic is , so its one-boundary genus is four, consistently with this basis of rank eight.
Here is the local push-off count used for all entries. Write a band of sign in coordinates as , , with its end strips continued into the two disks. Positive normal is fixed by the ambient and surface orientations in [F3]. A cycle using bands of signs has self-linking : its two half-turn contributions add, and the straight disk segments have zero twist. For consecutive cycles on the same disk pair, the shared positive band gives positive-push-first pairings , and the shared negative band gives . To see the off-diagonal signs, displace the first cycle by its positive normal in the displayed band chart: in the nonzero direction its two mixed crossings both have the indicated sign, whereas in the other direction the displaced return strip is disjoint. For cycles on neighboring disk pairs with position intervals , their four return strips have exactly the same two-crossing local configuration. If the earlier interval is on the smaller disk pair, its nonzero pairing is ; if on the larger pair it is . Disjoint or nested intervals, and nonneighboring disk pairs, have zero pairing in both directions: their return strips can be separated, or their two mixed crossings have opposite signs. These cases exhaust the eight cycles in step 3.1. This computes the mixed crossings of the actual displaced curves; the convention pushes the first variable, so it transposes the push-second table of the cited Collins source.
Applying those counts to the eight listed intervals gives . For example, the first two cycles use only negative bands, so their diagonal entries are and the shared-band entry is ; the staggered intervals on pair and on pair give . The remaining nonzero off-diagonal entries are , , , , , , and ; the diagonal entries are . Thus all sixty-four entries are determined by the preceding local count, including their zeros.
Put . Integer multiplication gives and , where is the matrix displayed in the Statement. These are finite integer identities; no polynomial invariant is used to identify the matrix. By [F4], the cycles , for the cycles of step 3.1, form an integral homology basis with exactly the stated positive-push-off matrix. They are legitimate integral one-cycles as in [F3]; simple representatives are unnecessary for the matrix definition.
If the orientation fixed for is the reverse of the braid orientation, reverse the surface orientation as well. The normal reverses, and the resulting positive-push-first matrix is : a negative push in the first variable is, by the normal collar and symmetry of linking, a positive push in the second. In this case use instead . Direct integer multiplication gives and . Thus either auxiliary orientation allowed in [F1] yields the same asserted matrix in an appropriate integral basis. Transporting the surface back through the actual diagram isotopy of step 2.1 proves the Statement for its specified Conway diagram.
Depends on
- Conway knot and its Piccirillo trace partner
- Seifert disk-and-band construction from an oriented knot diagram
- Termination and finite output of the Seifert diagram procedure
- Seifert pairing and matrix of an oriented knot
- Well-definedness of the Seifert pairing
- Seifert disks and bands form an embedded oriented spanning surface
- Linking number equals signed intersection with a spanning surface
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- AC implies DC implies countable choice
Used by
Dependency tree · two levels
49 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
- Lisa Piccirillo, The Conway knot is not slice (standard reference, not scraped)
- KnotInfo complete data table (standard reference, not scraped)
- Knot Atlas, Planar Diagrams (standard reference, not scraped)
- Julia Collins, An algorithm for computing the Seifert matrix of a link from a braid representation (standard reference, not scraped)