Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
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 divergence theorem for finite gluings of elementary solid regions

Statement

Let a finite gluing of elementary solid regions be given, with pieces E1,,EN, union E and outer boundary presentation Σout (Finite gluings of elementary solid regions and their outward boundary presentation), and let F be a C1 vector field on an open set containing E. Then

EdivF=EF,n,

the right-hand side being the flux of F over Σout.

The decomposition into pieces, the internal-or-outer designation of the patches and the pairing of the internal patches are hypotheses supplied with the gluing; nothing is asserted about a solid presented without them.

Facts & Assumptions

Given: The finite gluing with its pieces E1,,EN, their presentations Σi, the internal-or-outer designations, the pairing involution, the union E, the outer presentation Σout, and the C1 field F on an open OE.

[F1]

In a finite gluing the pieces are elementary solid regions with pairwise disjoint interiors whose union is E, and the outer patches together form a compatible finite patch presentation of E (Finite gluings of elementary solid regions and their outward boundary presentation).

[F2]

The divergence of a C1 field F on an open subset of Rn is divF=i<niFi (Divergence and curl of a C1 vector field).

[F3]

For a compatible finite patch presentation the oriented flux is the sum of the flux over its patches (Finitely patched regular surfaces, their area, scalar integrals, and flux), and x,y=i<mxiyi (The Euclidean inner product x,y=k<nxkyk on Rn).

[L1]

For an elementary solid region E with presentation Σ and a C1 field F on an open set containing E, EdivF=ΣF,n (The divergence theorem on an elementary solid region).

[L2]

For a finite gluing, E is compact and Jordan measurable; for a continuous vector field on the union of the piece boundaries, the sum of the piece fluxes is the flux over the outer presentation; and for a continuous scalar function on E, the sum of the piece volume integrals is the integral over the union (Internal faces cancel and volume integrals add when elementary solid regions are glued).

Proof

technique · direct
1.1

By [F1] each Ei is an elementary solid region contained in E, so O is an open set containing Ei and F is C1 on it; hence [L1] applies to each piece and gives EidivF=ΣiF,n for i=1,,N.

givenF1L1
1.2

The function divF is continuous on O by [F2], since a C1 field has continuous first partial derivatives, and in particular continuous on E.

givenF2
2.1

Summing the N identities of step 1.1 over i and applying [L2] to each side — the volume clause with H=divF, continuous on E by step 1.2, and the flux clause with G=F, continuous on E and on every Ei — turns the left sum into EdivF and the right sum into ΣoutF,n, which by [F1] and [F3] is the flux over the outer boundary presentation of E.

step 1.1step 1.2F1F3L2
3.1

Step 2.1 is the asserted identity. The field is required to be C1 on an open set containing the whole union, because step 1.1 applies the piecewise identity with that same field on each piece and step 2.1 integrates divF over E.

step 2.1

Remarks

  • What the gluing clause buys. A solid need not be simple in every coordinate direction: a U-shaped prism has sections in one direction that are unions of two disjoint intervals, so it admits no simple description there, and yet it is a gluing of three boxes. The companion examples page carries that computation.

  • No connectedness is used. The pieces need not touch and the boundary need not be connected: step 2.1 rearranges finitely many real numbers and integrates over a finite union.

Depends on

Used by

Dependency tree · two levels

42 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