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

Differential privacy inequality for bounded measurable functions

Statement

Let P and Q be probability measures on a measurable space. Suppose ε≥0, 0≤δ≤1, and P(A)≤eεQ(A)+δ for every measurable set A. Then every measurable function g with 0≤g≤1 satisfies

∫g dP≤eε∫g dQ+δ.

Facts & Assumptions

Given: Probability measures P,Q, ε≥0, 0≤δ≤1, the event inequality in the Statement, and a measurable g with 0≤g≤1.

[F2]

Expectation is integration against the probability measure.

[F3]

Simple integrals are the finite sums ∫∑jcj1Ej dμ=∑jcjμ(Ej) for disjoint measurable Ej and cj≥0.

[F4]

Monotone convergence passes increasing nonnegative functions through each integral.

Proof

1.1givenconstruct

For each integer m≥0, put n=2m and define gm=1n∑j=1n1{g≥j/n}. Each gm is a measurable simple function and 0≤gm≤g. Every level j/n counted at stage m contributes the two levels (2j−1)/(2n) and 2j/(2n) at stage m+1, so gm+1≥gm. The largest dyadic level not exceeding any fixed g(x) differs from g(x) by less than 2−m, so gm(x)↑g(x).

2.1givenF3step 1.1algebra

Apply the given event inequality to the n level sets in step 1.1 and use [F3] on disjoint simple representations. Partition the range into Bk={k/n≤g<(k+1)/n} for 0≤k<n and Bn={g=1}. Then gm=∑k=1n−1(k/n)1Bk+1Bn, while each level set {g≥j/n} is the disjoint union of Bj,…,Bn. Rearranging these finite sums gives ∫gm dP=1n∑j=1nP(g≥j/n)≤1n∑j=1n(eεQ(g≥j/n)+δ)=eε∫gm dQ+δ. This holds for every m.

3.1F2F4step 1.1step 2.1∎

Let m→∞ in step 2.1. By [F4] and step 1.1, both nonnegative integrals converge to the corresponding integrals of g, so ∫g dP≤eε∫g dQ+δ.

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