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.
E8 as the lattice input to a conditional sliceness obstruction
Example
Let be a smooth oriented knot and suppose its double branched cover bounds a compact simply connected positive-definite smooth four-manifold whose boundary intersection lattice is isometric to . Then this particular filling lattice has rank eight and has no isometric full-rank embedding into the standard lattice . This verifies the algebraic nonembedding input for the conditional KT-26 sliceness obstruction. It does not assert that a specified knot has such a filling, that every slice-disk branched cover satisfies boundary normal generation, or that the conditional obstruction proves any further numerical four-ball-genus bound.
Example references
Facts & Assumptions
Given: A knot and a positive-definite filling with boundary intersection lattice isometric to .
The E8 lattice is rank eight, positive definite, has determinant one, and admits no isometric full-rank embedding into . The E8 lattice is even unimodular and is not diagonal
Verification
An isometry identifies the rank of with eight and transports any proposed isometric full-rank embedding to one from .
Such an embedding is excluded by [F1]. Thus the algebraic nonembedding premise holds for this filling. No knot-level conclusion follows without the separate branched-cover gluing and gauge-theory hypotheses.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
4 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.