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.
Gauss–Green formula on an affine simplex
Statement
Assume Countable Choice. Let be a nondegenerate affine -simplex and let . If is the outward unit normal on each facet , then For an orientation-preserving affine map , the oriented area element transforms as
Facts & Assumptions
Given: Countable Choice, a nondegenerate affine simplex , its fixed reference simplex, and a continuously differentiable vector field on .
The reference open simplex is ; every physical cell is its affine image. (Matching affine simplicial meshes and shape regularity)
For affine maps, weak derivatives transform by the constant Jacobian chain rule, and volume measure transforms by . (Affine pullback of weak derivatives and Sobolev seminorms)
The one-dimensional fundamental theorem of calculus gives for a continuously differentiable vector-valued function. (If is differentiable with integrable then ; and a bounded derivative makes Lipschitz)
Fubini's theorem permits iterated integration of the continuous bounded functions on the bounded simplex used below. (Tonelli and Fubini for the completed product, with only almost-everywhere section measurability)
A C1 diffeomorphism obeys Lebesgue change of variables with the absolute determinant. For the bounded integrands here, apply the nonnegative formula separately to positive and negative parts. (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions)
The cited change-of-variables theorem assumes Countable Choice. (The Axiom of Countable Choice ())
Proof
First take . Fix and write , where and . The th coordinate ranges from to . By [F3], Integrating in and using [F4] gives the volume integral of as the difference of these two graph integrals. The lower graph is the coordinate facet with outward normal and area factor , hence its flux contribution is . The upper facet is the graph : its tangent Gram matrix is , whose eigenvalues are (multiplicity ) and , so its area factor is . Its outward unit normal is , so the th component of normal times area factor is . Thus the upper graph integral is exactly its th flux contribution. Other coordinate facets have zero th normal component. Summing over accounts for every component of the boundary flux and proves the formula on .
Let be an oriented tangent basis for a reference facet, with orientation chosen so its oriented area vector is . By the determinant definition of oriented area vector, for every , Equality against every gives the cofactor area-vector formula. Because , points to the exterior side corresponding to , so the formula has the outward orientation.
Define . The chain rule gives since . Applying the reference identity of step 1.1 to , and using [F5] to change variables in its bounded volume integrand, gives the physical volume integral. On each facet, step 1.2 gives Summing the facet identities proves the stated Gauss–Green formula on .
Depends on
- Matching affine simplicial meshes and shape regularity
- Affine pullback of weak derivatives and Sobolev seminorms
- If $f : [a,b] \to \mathbb{R}^m$ is differentiable with integrable $f'$ then $\int_a^b f' = f(b)-f(a)$; and a bounded derivative makes $f$ Lipschitz
- Tonelli and Fubini for the completed product, with only almost-everywhere section measurability
- A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Hybridized no-flow RT0/P0 Darcy system Definition
- A constant Darcy flux on the reference triangle Example
- A mini-element bubble detects an affine pressure gradient Example
- Exact affine data under weak imposition Example
- Two-triangle hybrid RT0 local elimination Example
- A conforming averaging companion for Crouzeix–Raviart functions Lemma
- Boundedness and divergence commutation of RT0 interpolation Lemma
- Fractional face traces and cellwise Green identity on a simplex Lemma
- Fractional weak Green identity and interior flux cancellation Lemma
- Geometry error bounds a pulled-back boundary-lift residual Lemma
- RT0 facet-flux unisolvence and global H(div) conformity Lemma
- Shape regularity controls affine simplex geometry Lemma
- Sobolev traces and Gauss–Green formula on physical simplices Lemma
- Weak tangential trace on a Lipschitz polyhedron Lemma
- Well-posedness of the finite FE-HMM micro solves Lemma
- Whitney edge, face, and cell moments commute with grad, curl, and div Lemma
- Zero facet traces of functions in H1₀ on an affine mesh Lemma
- Affine Piola maps commute with differential operators and preserve moments Theorem
- Continuous matching piecewise polynomials belong to W1p Theorem
- Hybridization, static condensation, and pressure gauge Theorem
- Multidimensional P1 SUPG consistency, coercivity, and error bound Theorem
- Polynomial inverse and discrete trace inequalities Theorem
- Smooth-solution L2 error bound for upwind DG transport Theorem
- Sobolev face traces and Gauss–Green on a reference simplex Theorem
- The degree-zero upwind forward-Euler step preserves mass and convex entropy Theorem
- Upwind DG transport satisfies the semidiscrete L2 energy identity Theorem
- Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare Theorem
Dependency tree · two levels
54 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
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapter 14 (standard reference, not scraped)
- Joachim Schöberl, Numerical Methods for Partial Differential Equations, Chapter 6 (standard reference, not scraped)