Alphabeta Math
CorollaryStatement: 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.

Second Green identity

Statement

Assume ACω. For a bounded C1 domain ΩRn, n2, or the specified finite piecewise C1 class, and real u,vC2(Ω), Ω(vΔuuΔv)dx=Ω(vνuuνv)dS. The face convention and finiteness are those of the first Green identity; every normal is outward from Omega, including normals on holes.

Facts & Assumptions

Given: Assume ACω, a bounded C1 domain or the specified finite piecewise C1 class in dimension n2, and real u,vC2(Ω).

[F1]

The first identity applies to each ordered pair of C2 functions. (First Green identity).

Proof

1.1

Both functions are C1 as well as C2, so apply F1 to (u,v) and (v,u). This gives Ω(vΔu+DuDv)=Ωvνu and Ω(uΔv+DvDu)=Ωuνv, using the same specified outward normal and faces in both applications.

givenF1
2.1

All four integrals in step 1.1 are finite by F1, so subtraction is legitimate. Since DuDv=i(iu)(iv)=DvDu pointwise, those terms cancel. Linearity leaves exactly the asserted volume and boundary differences, with the unchanged outward normals on every component.

step 1.1F1algebra

Source notes

Hunter §2.5, Theorem 2.23, equation (2.12) and proof, printed p. 32 (PDF p. 38).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 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