Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-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.

Green's theorem for finite unions of elementary regions

Statement

Let D=D1DN be a finite elementary Green region with its supplied decomposition, and orient D positively. If P,Q are C1 on an open neighbourhood of D, then

DPdx+Qdy=D(xQyP)dA.

Facts & Assumptions

Given: The finite elementary Green region, decomposition, orientation, and functions in the Statement.

[L1]

Every elementary piece has both a Type I and a Type II description (Type I, Type II, and elementary regions for Green's theorem).

[L2]

On a Type I piece, DPdx=DyPdA (The Type I boundary identity for the P dx term).

[L3]

On a Type II piece, DQdy=DxQdA (The Type II boundary identity for the Q dy term).

[L4]

Boundary integrals and integrals of a continuous scalar field add from the pieces to the union, with shared arcs cancelling (Shared boundary arcs cancel when finitely many elementary regions are glued).

[L5]

The vector line integral for the field (P,Q) is Pdx+Qdy (Scalar line integrals with respect to arc length and vector-field line integrals).

Proof

technique · direct
1.1

Fix a piece D. By [L1], [L2], and [L3], adding its Type I and Type II identities gives DPdx+Qdy=D(xQyP)dA.

givenL1L2L3algebra
2.1

Sum step 1.1 over the nonempty finite decomposition. Apply both clauses of [L4] to replace the sums by the boundary and region integrals over D; [L5] identifies the boundary integrand. This is the displayed Green identity.

step 1.1L4L5algebra
3.1

The case N=1 is included in step 2.1 with no internal cancellation. The proof uses the supplied elementary decomposition and makes no assertion for an arbitrary Jordan domain.

givenstep 2.1L1

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 133 results over 27 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources