Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

The general Stokes theorem

Statement

Assume ACω. Let M be an oriented smooth n-manifold with boundary, n1, and let ηΩcn1(M). With j:MM and the outward-normal-first orientation, Mdη=Mjη. An empty boundary contributes zero; in dimension one its integral is a finite signed sum of point values.

Facts & Assumptions

[F1]

Compact-support Stokes on the upper half-space: Give Hn={xn0} the standard orientation, n1, and its face the outward-normal-first orientation. If ηΩcn1(Hn) and j:HnHn, then Hndη=Hnjη. With η=iaidx1dxi^dxn, both sides are (1)nRn1an(x,0)dx for n>1, and a1(0) for n=1.

[F2]

Localization of Stokes by a partition of unity: Assume ACω. Let Mn be oriented with boundary, n1, ηΩcn1(M), and (ρi) a smooth chart partition. Then η=iρiη,dη=id(ρiη),idρiη=0, with only finitely many nonzero form summands. Boundary restrictions have the corresponding finite localization and compact support, so these identities can be integrated termwise.

[F3]

Change of variables on oriented manifolds: Let F:MN be a diffeomorphism of oriented smooth n-manifolds and ωΩcn(N). If F preserves orientation everywhere, MFω=Nω; if it reverses orientation everywhere, MFω=Nω. If the sign varies between components, apply the appropriate signed equality on each component and add.

[F4]

Integration on an oriented embedded submanifold: Let j:SM be an oriented embedded smooth k-submanifold, with boundary allowed. For a smooth k-form ω on M such that jω has compact support on S, define Sω:=Sjω. If F:TS is an orientation-preserving diffeomorphism, this equals T(jF)ω. Compact support is required on S itself.

[F5]

The boundary of a positive-dimensional manifold is a closed embedded smooth (n-1)-manifold: If M has dimension n1, the restrictions of boundary charts to their faces give M the structure of a closed embedded smooth boundaryless (n1)-manifold. For n=0, M=.

Proof

Given: The objects and hypotheses in the statement above.

1.1

Choose a chart partition and write the finite localization η=iηi with ηi=ρiη. Its derivative localizes by the partition cancellation lemma. The boundary is closed, so the restriction support lies in the compact set suppηM; both integrals are defined.

F2F4F5
1.2

For a boundary-chart term, extend the coordinate primitive by zero across artificial edges within Hn. It remains smooth there, has compact support, and exterior differentiation commutes with its chart pullback by the local calculus used in the localization lemma. Apply half-space Stokes. Multiplication by the ambient chart sign multiplies the induced boundary sign by the same number: the transition preserves the outward side, and outward-first compares the two determinant rays. The signed change-of-variables formula therefore turns the local equality into Mdηi=Mjηi.

F1F2F3
2.1

For an interior-chart term the Euclidean calculation in the half-space lemma’s dependency gives zero integral and zero boundary restriction. Equivalently translate its compact Euclidean support into the interior of Hn and use the half-space identity with zero face value. Sum all finitely many equalities and use the localization identities to obtain Stokes. Empty support and empty boundary are included. For n=1 the local formula is the negative point value, transported with its chart sign; hence the boundary integral is exactly the specified signed sum.

F1F2F3step 1.1step 1.2

Depends on

Used by

Dependency tree · two levels

20 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