Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Surface integration on compact C1 hypersurfaces

Definition

Assume the ACω convention of Bounded C1 domains and their outward normals. Let S be a compact embedded C1 hypersurface in Rn, n2. Choose finitely many regular injective C1 parametrizations Xj:VjSOj with C1 coordinate transitions, and an ambient partition χj from Finite ambient partitions near compact sets, with supports compactly contained in the corresponding chart neighborhoods. Put JXj=det(DXjTDXj), using The Gram matrix G(v0,,vr1)=(vi,vj)i,j<r and Gram determinant, with empty value 1.

For a nonnegative Borel f on S define SfdS=jVj(χjf)(Xj(y))JXj(y)dy, where the integrals on the right are those of The nonnegative Lebesgue integral and 0=0. Set S(A)=S1AdS for Borel A. For signed f with SfdS< use the difference of the positive and negative integrals. The same chart formula restricts to a compact Borel face contained in a regular patch. The empty surface has zero integral. Independence and finiteness are established by the following chart-independence lemma.

Source notes

Hunter, §1.10.2, printed p. 15 (PDF p. 21), Gram surface density and partition patching.

Depends on

Used by

Dependency tree · two levels

16 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