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.
Intersection-volume conservative remapping
Definition
Assume Countable Choice. Let be a bounded Lebesgue-measurable domain of finite positive measure. Let and be finite measurable partitions of up to null sets, with disjoint interiors modulo null sets and positive cell volumes. Define exact overlap weights . For source constants , the intersection-volume remap is the target piecewise-constant field whose value on is . All weights are exact measures; an approximate clipping weight is not silently substituted.
Notes
The measurable sets and restricted set function are defined in Lebesgue measurable sets, the family , and the restricted set function . Under Countable Choice (The Axiom of Countable Choice ()), Assuming countable choice, is a sigma-algebra containing every elementary set and is a complete measure extending elementary volume makes that family a sigma-algebra and the set function a measure. Thus every is measurable, and its measure is finite because it lies in ; every target denominator is finite and positive. Stable cell identifiers fix the finite summation order but do not affect the real-valued result. A target cell with zero volume is excluded because its average is undefined. The remap is a finite-volume projection once the conservation and orthogonality theorem below is proved.
Depends on
- Lebesgue measurable sets, the family $\mathcal{L}(\mathbb{R}^n)$, and the restricted set function $\lambda_n$
- Assuming countable choice, $\mathcal{L}(\mathbb{R}^n)$ is a sigma-algebra containing every elementary set and $\lambda_n$ is a complete measure extending elementary volume
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Exact certified clipping of convex rational polygons Algorithm
- Characteristic-cell overlap remapping for a conservative density Definition
- Opposite diagonals conserve mass under a curved shear Example
- Certified clipping returns the exact convex polygon overlap Theorem
- Overlap remapping is an L2 projection, conservative and positive Theorem
- Remap error separates source, target and geometry approximation Theorem
Dependency tree · two levels
21 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)