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.
Intersection pairing of a closed oriented surface
Example
Assume AC. For the closed oriented genus- surface , define the integral cup intersection pairing In the ordered edge-dual basis its matrix consists of diagonal blocks It is alternating and unimodular. Here the pairing is defined by cup evaluation; no transversality assertion for chosen curves is needed. AC is inherited only from the UCT used to construct the edge-dual classes.
Facts & Assumptions
Integral surface cup pairing from the oriented polygon supplies the full integral groups, the edge-dual basis, the positively oriented singular surface cycle , and the calculation when and .
Fundamental class of a compact oriented manifold specifies the unique class with the prescribed orientation at every local stalk.
Top homology of a connected manifold says restriction from top homology to any one local stalk is injective for a nonempty connected compact oriented manifold, with image the full copy of the coefficient ring after the chosen stalk identification. It uses no AC.
The Axiom of Choice supplies the integral cycle projections and sections of the UCT invoked by [F1].
Verification
Given: The standard oriented closed surface and the ordered basis from [F1]. A bilinear form on a finite free integral module is called unimodular when its map to the integral dual is an isomorphism.
The cycle of [F1] represents . For , its signed fan is the positive characteristic-disk cycle, and at a point in the interior of one fan triangle its local coefficient is in the given orientation: the affine triangle has the polygon orientation when its coefficient is , and the opposite vertex order and coefficient compensate on the other triangles. Restriction to that point discards the other triangles, whose images omit it. Thus and the class of [F2] have the same local restriction. By [F3] they are equal. For , the positive characteristic two-cell used in [F1] has the same normalization at an interior point, giving the same conclusion. The hypotheses of [F3] hold since is the given nonempty connected closed oriented surface.
Substituting step 1.1 into [F1]'s calculation gives Consequently , and . These are exactly the entries of the stated block matrix . Setting gives for every integral vector, proving alternation directly, including vectors with negative or zero coordinates.
Direct multiplication gives , so is an integral matrix. In particular the map from the basis module to its dual defined by either slot of the pairing has an integral inverse (the other slot uses the transpose matrix). Also , hence . This proves unimodularity over , not only nonsingularity over a field.
At the module is zero and is the empty matrix. Its determinant is the empty product , and the unique map is an isomorphism, so both conclusions still hold. At there is one block , already checked in step 3.1. Orientation reversal sends the fundamental class to its negative by [F2], so for a fixed basis the pairing and matrix change sign. No assertion concerns an empty surface or a zero coefficient ring, since the example fixes a connected surface and integral coefficients. Representatives and degenerate singular simplices are handled by the actual cocycle and cycle calculation in [F1]; the matrix computation does not replace that argument. AC is used only in [F1]'s UCT construction via [F4]; the fundamental-class identification and finite matrix inversion need no additional choice.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
27 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
- Hatcher, Algebraic Topology, Example 3.7 (standard reference, not scraped)