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.
Remap error separates source, target and geometry approximation
Statement
Assume Countable Choice. Let be bounded, let be the geometry maps of Curved-domain geometry approximation errors and assume each is a global orientation-preserving diffeomorphism from onto its image, with and is -Lipschitz on the union of their images. On let and be finite families of Lebesgue-measurable sets of positive measure satisfying Thus each family is a finite measurable partition up to null sets as required by Intersection-volume conservative remapping. Let be source-piecewise-constant data with finite error. Assume the exact target projection error below is finite. Define on each target cell by its exact cell average, , and . If is the exact overlap remap, then where and .
Facts & Assumptions
Given: Countable Choice; the exact and approximate maps; a bounded approximate Jacobian; a Lipschitz field on both images; two finite measurable families satisfying the displayed coverage and pairwise-null-overlap conditions; and source values constant on source cells.
Curved-domain geometry approximation errors: and is the positive approximate Jacobian.
Intersection-volume conservative remapping and Overlap remapping is an L2 projection, conservative and positive: exact overlap remapping of source constants is the target-cell average projection.
Holder's inequality for integrals, including the endpoint cases: on every finite-volume target cell.
A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: under Countable Choice, a diffeomorphism transforms nonnegative integrals by its positive Jacobian.
Countable Choice is assumed for the measure/projection interfaces in [F2] and change of variables in [F4] (The Axiom of Countable Choice ()).
Proof
The Lipschitz condition gives for every . Integrating its square against gives the geometry term .
For any and target cell , [F3] gives . Summing over the disjoint target cells shows is contractive. The same averaging identity gives orthogonal to every target-cellwise constant, so is the orthogonal projection.
By [F2], . Thus ; the two terms are orthogonal and is contractive by step 1.2. The first term has norm and the second is at most , whence .
Apply [F4] separately on the finitely many mesh cells to identify the physical norm in step 2.1 with the weighted pullback norm of . The triangle inequality with step 1.1 proves the claimed bound.
Depends on
- Intersection-volume conservative remapping
- Overlap remapping is an L2 projection, conservative and positive
- Curved-domain geometry approximation errors
- Holder's inequality for integrals, including the endpoint cases
- 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
Nothing in the library uses this result yet.
Dependency tree · two levels
31 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
- Devon Powell and Tom Abel, An exact general remeshing scheme applied to physically conservative voxelization (standard reference, not scraped)
- Zhengru Zhang, Moving Mesh Method with Conservative Interpolation Based on L2-Projection, Commun. Comput. Phys. 1 (2006), 930–944 (standard reference, not scraped)