Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-31
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.

For finite signed or complex measures, absolute continuity is equivalent to the epsilon-delta small-set condition

Statement

Let μ be a sigma-finite positive measure and let ν be a finite signed measure or a finite complex measure on the same measurable space. Then the following are equivalent:

  1. νμ;
  2. for every ε>0 there exists δ>0 such that μ(E)<δν(E)<ε(EA).

Facts & Assumptions

Given: A finite signed or finite complex measure ν and a sigma-finite positive measure μ.

[L2]

Absolute continuity of the integral gives the ε-δ estimate for integrable absolute values. (Absolute continuity of the integral)

[L3]

For signed or complex measures, νμ is equivalent to νμ, and always ν(E)ν(E). (For signed and complex measures, absolute continuity is equivalent for the measure, its Jordan or real-imaginary parts, and its total variation, The total variation |nu|(E) from countable measurable partitions)

Proof

technique · direct
1.1

Assume νμ and let ε>0. By [L1], the function dν/dμ is integrable, so [L2] yields δ>0 such that μ(E)<δ implies ν(E)=Edνdμdμ<ε. Then [L3] gives ν(E)<ε. This proves condition 2.

L1L2L3choose
1.2

Assume condition 2. If μ(E)=0, then μ(E)<δ for every δ>0, so condition 2 forces ν(E)<ε for every ε>0. Hence ν(E)=0, and therefore νμ.

givenalgebra
2.1

Step 1.1 proves (1)(2) and step 1.2 proves (2)(1).

step 1.1step 1.2

Depends on

Used by

Dependency tree · two levels

22 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