Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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 M be a smooth manifold, possibly with boundary. For k≥1, c∈Ck∞(M;R) and ω∈Ωk−1(M), define integration over a chain by the finite linear sum of its simplex integrals. Then ∫cdω=∫∂cω. 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

[F1]

Stokes theorem for the standard simplex proves the alternating face formula for a smooth form on a neighbourhood of the affine simplex.

[F2]

Smooth singular chain and cochain complexes specifies finite formal sums of smooth simplices, the signed face differential and its degree-zero convention.

[F3]

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.

[F4]

The exterior derivative commutes with pullback gives dσˉ∗ω=σˉ∗dω on an extension domain.

[F5]

Pullback of forms is smooth functorial and preserves wedges identifies face pullbacks with pullbacks along the composite face simplex.

Proof

Given: A manifold M, an integer k≥1, a finite smooth singular k-chain c and a smooth (k−1)-form ω.

1.1F1F2F3F4F5given

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 σˉ∗dω. By [F5], its pullback to face i is (σˉ∘δi)∗ω, which extends the face simplex smoothly. Definition [F3] consequently gives ∫σdω=∑i=0k(−1)i∫σ∘δiω. The values do not depend on the selected extension.

1.2F2F3given

A chain is a finitely supported coefficient function on the supplied simplex set. Define ∫cω=∑σ∈supp⁡cc(σ)∫σω. This is independent of a written expression for c: combining repetitions adds their coefficients, and inserting a zero coefficient changes nothing. Finite distributivity gives additivity and real homogeneity in c. No basis selection or simultaneous choice of extensions is involved, because [F3] already assigns a unique value to each simplex.

2.1F2step 1.1step 1.2

Multiply step 1.1 by c(σ) and sum over its finite support. The boundary from [F2] is the same finite double sum of face simplices with coefficients c(σ)(−1)i. When identical faces occur, step 1.2 combines their coefficients in exactly the same way in its integral. Therefore ∫cdω=∑σ,ic(σ)(−1)i∫σδiω=∫∂cω.

3.1F1F2F3step 2.1∎

For k=1, [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 c=0 or M=∅, 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

Dependency tree · 2 levels

Sources