Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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 Ω⊂Rd be a bounded Lebesgue-measurable domain of finite positive measure. Let S=(Si)i=1m and T=(Tj)j=1n be finite measurable partitions of Ω up to null sets, with disjoint interiors modulo null sets and positive cell volumes. Define exact overlap weights wji=∣Tj∩Si∣. For source constants vi, the intersection-volume remap is the target piecewise-constant field Rv whose value on Tj is (Rv)j=∣Tj∣−1∑iwjivi. 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 L(Rn), and the restricted set function λn. Under Countable Choice (The Axiom of Countable Choice (ACω)), Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume makes that family a sigma-algebra and the set function a measure. Thus every Tj∩Si 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 L2 projection once the conservation and orthogonality theorem below is proved.

Depends on

Used by

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