Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-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.

Almost every point is a Lebesgue point of a locally integrable function

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)).

Let f∈Lloc1(Rn). Then the Lebesgue set of the Lloc1 class of f has full Lebesgue measure.

Equivalently, for almost every x∈Rn, lim⁡r→0+1λ(B(x,r))∫B(x,r)∣f(y)−f(x)∣ dλ(y)=0.

Facts & Assumptions

Given: The Axiom of Countable Choice and a locally integrable function f on Rn.

[L1]

A point belongs to the Lebesgue set exactly when the averaged oscillation above tends to 0. (Lebesgue points and the Lebesgue set of an Lloc1 class)

[L2]

A property holds almost everywhere when its exceptional set is contained in a measurable null set. (Measure-null sets and almost-everywhere statements relative to a measure)

[L3]

The rationals are countably infinite, and the product of two at most countable sets is at most countable. (Q is countably infinite, A product of two at most countable sets is at most countable)

[L4]

Rationals are dense in the reals. (The rationals embed densely in the reals)

[L5]

Under Countable Choice, λn is a complete measure on the Lebesgue sigma-algebra of Rn (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume). Countable subadditivity gives λn(⋃kNk)≤∑kλn(Nk)=0 for every sequence of measurable λn-null sets (Finite and countable subadditivity of measures).

[L6]

If u∈Lloc1(Rn), then Aru(x)→u(x) for almost every x. (Lebesgue differentiation theorem on Rn)

Proof

technique · direct
1.1L3L5L6givenconstruct

Let [L3, L5, L6, given, construct] D:={a+ib:a,b∈Q}. By [L3], D is countable. For each c∈D, the function uc:=∣f−c∣ is locally integrable, so [L6] and [L2] give a measurable λn-null set Nc containing all exceptions such that lim⁡r→0+Aruc(x)=uc(x)=∣f(x)−c∣ for every x∉Nc. Put N:=⋃c∈DNc. By [L5], N is null.

2.1step 1.1L4algebra

Fix x∉N and let ε>0. By density [L4], choose [step 1.1, L4, algebra] c∈D with ∣f(x)−c∣<ε. Then for every r>0, 1λ(B(x,r))∫B(x,r)∣f(y)−f(x)∣ dλ(y)≤Ar∣f−c∣(x)+∣c−f(x)∣. Taking r→0+ and using step 1.1 gives lim sup⁡r→0+1λ(B(x,r))∫B(x,r)∣f(y)−f(x)∣ dλ(y)≤2ε. Since ε is arbitrary, the limit is 0.

3.1L1L2step 1.1step 2.1∎

Step 2.1 holds for every x∉N, and N is null. By [L1] and [L2], [L1, L2, step 1.1, step 2.1] the Lebesgue set of the class of f has full measure.

Depends on

Used by

Dependency tree · two levels

58 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