Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Characteristic departure cells are measurable and have positive finite volume

Statement

Assume the Axiom of Countable Choice. Let Ω=∏j=1d(0,ℓj) be the bounded open fundamental box used for Lebesgue measure, and let Q=∏j=1d[0,ℓj) be its half-open grid-indexing copy. Let Φ be the periodic C1 characteristic diffeomorphism of A periodic C1 characteristic map is an orientation-preserving diffeomorphism, and let Ai⊆Q be a Lebesgue-measurable arrival cell with ∣Ai∣:=λd(Ai∩Ω)>0. Then Di:=Φ−1(Ai), interpreted on the torus and represented in Ω, is Lebesgue measurable and satisfies 0<∣Di∣<∞. This includes every finite tensor-grid cell with nonempty interior. The departure cells form a partition up to null sets whenever a finite family of arrival cells does; an exact torus partition pulls back to an exact torus partition.

Facts & Assumptions

Given: Countable Choice, a periodic C1 characteristic diffeomorphism, the fundamental boxes Ω,Q, and measurable positive-volume arrival cells.

[A1]

The Axiom of Countable Choice (ACω) is assumed for the Lebesgue-measure suppliers below; no additional choice is used.

[F1]

A periodic C1 characteristic map is an orientation-preserving diffeomorphism gives the lifted flow and its inverse as C1 diffeomorphisms; A periodic C1 velocity has a global characteristic flow on a finite horizon gives their equivariance under the period lattice.

[F2]

A C^1 diffeomorphism maps Lebesgue measurable sets to Lebesgue measurable sets: under Countable Choice a C1 diffeomorphism between open Euclidean sets maps measurable sets to measurable sets. Apply this also to translations and to Φ−1.

[F3]

A C^1 diffeomorphism maps Lebesgue null sets to Lebesgue null sets: under Countable Choice the same maps preserve null sets.

[F5]

A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included: ∣Ω∣=∏jℓj<∞; bounded boxes with a degenerate side are null. Thus the union H:=⋃j=1d⋃k∈Z{x:xj=kℓj} of tile faces is null, by covering each face with countably many bounded degenerate boxes and applying [F4].

[F6]

Measures are monotone: measurable inclusions preserve measure order.

Proof

1.1givenA1F1F2F4construct

Put Λ=∏jℓjZ and A^i=⋃k∈Λ(Ai+k). By [F2] and [F4] this countable periodic lift is measurable, and Ei:=Φ−1(A^i) is measurable by [F1] and [F2]. Hence Di=Ei∩Ω is measurable. Equivariance makes Ei periodic and makes the torus preimage independent of representatives.

2.1givenA1F1F3F4F5F6step 1.1algebra

If ∣Di∣=0, [F3] and [F4] make ⋃k∈Λ(Di+k) null. Every point of Ei outside H lies in one open tile, so periodicity gives Ei⊆H∪⋃k∈Λ(Di+k). By [F4] and [F5], Ei is null; [F3] then makes Φ(Ei)=A^i null. This contradicts Ai∩Ω⊆A^i and ∣Ai∣>0 by [F6]. Thus ∣Di∣>0. Also Di⊆Ω, so [F5] and [F6] give ∣Di∣≤∏jℓj<∞.

3.1givenA1F1F3F4F5F6step 1.1step 2.1algebra∎

Bijectivity on the torus preserves exact unions and disjointness. For a partition only up to null sets, lift its omitted set and pairwise overlaps periodically; these are null by [F3]–[F5]. Their inverse images are null by [F1] and [F3], so restricting to Ω gives a departure partition up to null sets. Finally, a half-open tensor cell with nonempty interior is measurable with positive volume by [F5], so it is included in the result.

Depends on

Used by

Dependency tree · two levels

52 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