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.
An explicit mayer vietoris connecting form on the circle
Example
Under countable choice the circle Mayer–Vietoris connector has a nonzero representative obtained from a locally constant overlap function.
Facts & Assumptions
Given: Assume countable choice. Let be complements of opposite circle points, let , and let equal on and on .
Explicit de rham mayer vietoris connecting class: Under countable choice, for a closed -form on , , where and , with products smoothly extended by zero as in the lift construction. This class is independent of partition, lift and representative.
Zero th de rham cohomology is locally constant functions: is the algebra of locally constant real functions. For nonempty connected it is canonically .
Mayer vietoris sequence in de rham cohomology: Under countable choice the de Rham Mayer–Vietoris sequence is exact: , beginning with .
Verification
Take a subordinate partition . The local forms and glue by the connector formula. Explicitly on and on , with the prescribed smooth zero extensions at the removed points. Thus .
The degree-zero groups on are constants, whose difference on the two overlap components is . The vector is not diagonal, since equality to would require and . Exactness of the Mayer–Vietoris sequence defining this connector therefore gives .
Source locator
Lee, Theorem 17.20, pp.449–450, proof pp.462–463; the sign here is second restriction minus first, and the connecting representative is calculated with that convention.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
10 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
- John M. Lee, Introduction to Smooth Manifolds, second edition (standard reference, not scraped)