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.
Stokes theorem for smooth singular chains
Statement
Let be a smooth manifold, possibly with boundary. For , and , define integration over a chain by the finite linear sum of its simplex integrals. Then The zero chain has integral zero. In degree zero the boundary is zero; no degree-minus-one form is required by this statement.
Facts & Assumptions
Stokes theorem for the standard simplex proves the alternating face formula for a smooth form on a neighbourhood of the affine simplex.
Smooth singular chain and cochain complexes specifies finite formal sums of smooth simplices, the signed face differential and its degree-zero convention.
Integral of a form over a smooth singular simplex defines simplex integration, including point evaluation. Simplex integrals are independent of affine coordinate identification supplies independence of the chosen neighbourhood extension.
The exterior derivative commutes with pullback gives on an extension domain.
Pullback of forms is smooth functorial and preserves wedges identifies face pullbacks with pullbacks along the composite face simplex.
Proof
Given: A manifold , an integer , a finite smooth singular -chain and a smooth -form .
For one smooth simplex , take a neighbourhood extension as required in [F2]. The smooth form is defined on that whole neighbourhood in the affine span, so [F1] applies. By [F4] its derivative is . By [F5], its pullback to face is , which extends the face simplex smoothly. Definition [F3] consequently gives The values do not depend on the selected extension.
A chain is a finitely supported coefficient function on the supplied simplex set. Define . This is independent of a written expression for : combining repetitions adds their coefficients, and inserting a zero coefficient changes nothing. Finite distributivity gives additivity and real homogeneity in . No basis selection or simultaneous choice of extensions is involved, because [F3] already assigns a unique value to each simplex.
Multiply step 1.1 by and sum over its finite support. The boundary from [F2] is the same finite double sum of face simplices with coefficients . When identical faces occur, step 1.2 combines their coefficients in exactly the same way in its integral. Therefore
For , [F1] uses the terminal-minus-initial endpoint evaluations, so the formula includes every smooth path, constant or otherwise. Degenerate higher simplices remain generators, and step 1.1 applies to their smooth extensions without a rank assumption. If or , the relevant sums are empty and both integrals vanish. A zero form has zero pullback and zero integral. The assertion involves only positive chain degrees and finite sums, so no negative degree or choice assumption is hidden.
Depends on
- Stokes theorem for the standard simplex
- Smooth singular chain and cochain complexes
- Integral of a form over a smooth singular simplex
- Simplex integrals are independent of affine coordinate identification
- The exterior derivative commutes with pullback
- Pullback of forms is smooth functorial and preserves wedges
Used by
Dependency tree · two levels
24 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
- Peter S. Park, Proof of de Rham's Theorem (standard reference, not scraped)