Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

Measure preservation can be checked on a generating pi-system

Statement

Let T:XX be measurable on (X,A,μ). Let P be a pi-system generating A, with an increasing sequence PnP covering X and satisfying μ(Pn)<. If μ(T1P)=μ(P) for every PP, then T preserves μ. For finite μ, a generating pi-system can be enlarged by X to meet the exhaustion condition.

Facts & Assumptions

[F1]

Two measures agreeing on a generating pi-system and an increasing finite-mass exhaustion agree everywhere Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system.

Proof

Given: The objects and hypotheses in the statement.

1.1

Set ν(E)=μ(T1E). Inverse images take the empty set to the empty set and disjoint countable unions to disjoint countable unions. Thus ν()=0 and ν(jEj)=jν(Ej) for disjoint measurable Ej, so ν is a measure.

given
2.1

The measures ν,μ agree on P, and ν(Pn)=μ(Pn)< on the stated increasing exhaustion. Uniqueness therefore gives ν(E)=μ(E) for all EA, which is measure preservation.

F1step 1.1
3.1

If μ(X)<, adjoining X keeps the family a generating pi-system; its preservation identity holds since T1X=X. The constant exhaustion Pn=X then satisfies every required hypothesis.

step 2.1given

Depends on

Used by

Dependency tree · two levels

9 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