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

Divergence for finite piecewise C1 presentations

Statement

Assume ACω. If Omega has the specified finite piecewise C1 presentation and FC1(Ω;Rn), then ΩdivF=jSjFνjdS, with faces counted once off E. All integrals are finite. In a specified finite gluing, the two fluxes on every shared face cancel.

Facts & Assumptions

Given: Assume ACω. Omega has the specified finite piecewise C1 presentation and FC1(Ω;Rn). The cancellation assertion additionally has the specified finite gluing data.

[F1]

Faces meet only in a surface-null edge set and carry the actual outward side. (Specified finite piecewise C1 boundary presentations).

[F2]

Smooth edge cutoffs have vanishing support volume and arbitrarily small gradient integral. (Cutoffs around surface-null edges).

[F3]

Compact support can be split by an ambient partition. (Finite ambient partitions near compact sets).

[F4]

Graph-supported fields satisfy the local flux formula; interior fields integrate to zero. (The local graph flux calculation).

[F5]

An integrable common majorant permits passage to the limit in integrals. (Dominated convergence).

[F6]

An integrable indicator on a bounded cylinder can be integrated along its vertical sections. (Fubini's theorem for L^1 functions on a sigma-finite product).

[F7]

Borel substitution under a rigid coordinate map preserves a graph-face volume. (Borel change of variables from the compact-support formula and Radon uniqueness).

[F8]

Singleton vertical sections have one-dimensional Lebesgue measure zero. (A box with a degenerate side is Lebesgue null, and so is every coordinate hyperplane in Rn).

Proof

1.1

For epsilon decreasing to zero use F2 and set Fε=(1ηε)F. Its support in the compact closure avoids a neighborhood of E. The remaining boundary support has a finite cover by the single-graph neighborhoods of F1; add an interior open set. F3 partitions this support and F4 applies to each localized term. Summing the product rules gives ΩdivFε=jSj(1ηε)FνjdS. Null overlaps in F1 prevent double counting.

givenF1F2F3F4
2.1

The product rule gives divFε=(1ηε)divFDηεF. The omitted first term has integral bounded by divFsuppηε0 and the second by FDηε0 by F2. Thus the bulk integrals tend to ΩdivF.

step 1.1F2algebra
3.1

For every point of a face outside E, its positive distance from compact E exceeds epsilon eventually, so eta_epsilon vanishes there. Each face has finite area, and the flux is bounded by F. Since E is facewise null, F5 gives convergence of each face integral in step 1.1 to its full flux. There are finitely many faces, so steps 1.1–2.1 yield the claimed identity.

step 1.1step 2.1F1F2F5
4.1

In a specified finite gluing, apply this formula to every piece. Shared faces have the same surface measure and opposite normals by F1, so their two integrands sum pointwise to zero off the null edge sets. Each regular face has n-dimensional volume zero: in graph coordinates Fubini gives zero from its singleton vertical sections, and a rigid coordinate change preserves volume. Thus adding the piece volumes counts the final domain integral exactly, and only exposed face fluxes remain. This proves the cancellation statement.

step 3.1F1F6F7F8

Source notes

Hunter §1.12, printed p. 18, for the stated piecewise extension; the edge-error limit is proved locally under the exact finite presentation.

Depends on

Used by

Dependency tree · two levels

62 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