Alphabeta Math
Pipeline-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 mechanisms and composition

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Differential privacy, databases, and add/remove adjacency

Definition

Let U be a nonempty set of possible records and let N0={0,1,2,…}. A database is a function D:U→N0 with finite support supp⁡(D)={u∈U:D(u)≠0}; D(u) is the number of occurrences of record u. Let D be the set of databases and equip it with the power-set sigma-algebra. For u∈U, let 1{u} be the function that is one at u and zero elsewhere. Two databases D,D′∈D are neighbors, written D∼D′, when D′=D+1{u} or D=D′+1{u} for some u∈U.

A randomized mechanism with output measurable space (Y,B) is a probability kernel K from D to Y: for each D∈D, A↦K(D,A) is a probability measure on (Y,B), and for each A∈B, D↦K(D,A) is measurable. Given ε≥0 and 0≤δ≤1, the mechanism is (ε,δ)-differentially private if, for every ordered neighboring pair D∼D′ and every output event A∈B,

K(D,A)≤eεK(D′,A)+δ.

The mechanism is ε-differentially private, or pure ε-differentially private, when δ=0. The ordered-pair quantifier includes both directions because ∼ is symmetric.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Laplace noise distribution

Definition

Assume Countable Choice. For b>0, let μb be the probability measure on R concentrated on (0,+∞) with Lebesgue density x↦b−1e−x/b there and zero elsewhere. For every Borel set A⊆R, define

Lap⁡(b)(A)=12μb(A∩(0,+∞))+12μb({x>0:−x∈A}).

Thus Lap⁡(b) is the equal mixture of the positive exponential law and its reflection in the origin. Define Lap⁡(0) to be the point mass at 0.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Global L1 sensitivity

Definition

Let d≥1 and let f:D→Rd be a query on databases with the add/remove adjacency relation. Write ∥x∥1=∑j=1d∣xj∣. When the set of adjacent-pair differences has an attained finite maximum, the global L1 sensitivity of f is

Δ1f=max⁡D∼D′∥f(D)−f(D′)∥1.

The sensitivity is finite when this maximum is finite.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Laplace noise has its stated Lebesgue density

Statement

Assume Countable Choice. For every b>0, the probability measure Lap⁡(b) is absolutely continuous with respect to Lebesgue measure on R and has density

z⟼12be−∣z∣/b.

Facts & Assumptions

Given: b>0 and a Borel set A⊆R.

[A1]

Countable Choice is the axiom assumed by the cited exponential-law and Lebesgue change-of-variables suppliers; no full Axiom of Choice is invoked.

[F1]

Laplace distribution: Lap⁡(b)(A)=12μb(A∩(0,+∞))+12μb({x>0:−x∈A}), where μb is the exponential probability law of rate 1/b.

[F2]

Exponential-law density: for λ>0, the density is fλ(t)=λe−λt when t>0 and 0 otherwise, and it defines a probability law.

[F3]

Lebesgue change of variables: a C1 diffeomorphism T transforms nonnegative Lebesgue integrals by the absolute Jacobian; for T(x)=−x the absolute Jacobian is 1.

[F4]

Measure of a degenerate interval: a one-dimensional box with equal endpoints has Lebesgue measure 0.

Proof

1.1A1F1F2F3F4givenconstructalgebra

Put A+=A∩(0,+∞) and A−=A∩(−∞,0). By [F1] and [F2], the positive mixture half contributes 12∫A+b−1e−x/b dλ(x). Applying [F3] to reflection T(x)=−x and y↦1A−(y)b−1ey/b shows that the reflected half contributes 12∫A−b−1ey/b dλ(y). On A+, e−x/b=e−∣x∣/b; on A−, ey/b=e−∣y∣/b. The singleton at zero has Lebesgue measure zero by [F4]. Hence Lap⁡(b)(A)=∫A(2b)−1e−∣z∣/b dλ(z).

2.1step 1.1givenalgebra∎

The identity in step 1.1 holds for every Borel set A. Its integrand is nonnegative and measurable; thus every Lebesgue-null Borel set has zero Lap⁡(b) measure, and the displayed function is the claimed Radon–Nikodym density.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Finite independent Laplace noise has product density

Statement

Assume Countable Choice. For b>0 and a finite integer d≥1, the finite product probability law Lap⁡(b)⊗d on Rd has Lebesgue density

z⟼(2b)−dexp⁡ ⁣(−∥z∥1b),

where ∥z∥1=∑i=1d∣zi∣. Its coordinate projections are independent and each has law Lap⁡(b).

Facts & Assumptions

Given: b>0, a finite integer d≥1, and the finite product conventions in the Statement.

[A1]

Countable Choice is inherited from the one-dimensional exponential/Laplace density construction; no stronger choice principle is used here.

[F1]

One-dimensional density: Lap⁡(b) has density fb(x)=(2b)−1e−∣x∣/b.

[F2]

Finite product sigma-algebra is generated by measurable rectangles.

[F3]

Products of sigma-finite measures exist, are sigma-finite, and have the rectangular product formula. Finite iteration applies both to Lebesgue measures and to probability measures.

[F4]

Tonelli's theorem permits repeated integration of nonnegative product-measurable functions over the finite product.

[F5]

Density measure: integrating a nonnegative measurable function over events defines a measure.

[F6]

Measure uniqueness identifies sigma-finite measures that agree on a generating pi-system under its stated hypotheses.

[F7]

Independent random elements are random elements whose generated sigma-algebras are independent.

[F8]

The exponential addition formula gives exp⁡(x+y)=exp⁡(x)exp⁡(y) for all real x,y; repeated application combines any finite sum in the exponent.

Proof

1.1A1F1F3F4F5F8givenconstruct

Define f(z)=∏i=1dfb(zi)=(2b)−dexp⁡(−∥z∥1/b); the equality factoring the exponential of a finite sum uses [F8]. The function is nonnegative and product-measurable. Repeated application of [F4] gives ∫Rdf(z) dλd(z)=∏i=1d∫Rfb(x) dλ(x)=1, using [F1] for each one-dimensional integral. By [F5], ν(A)=∫Af dλd is therefore a probability measure.

2.1F1F2F3F4F6F7step 1.1∎

For a measurable rectangle A=∏i=1dAi, repeated Tonelli integration [F4] gives ν(A)=∏i=1d∫Aifb dλ=∏i=1dLap⁡(b)(Ai). The finite product law has this same rectangle value by [F3]. Rectangles form a generating pi-system by [F2], and the constant sequence of whole-space rectangles is an increasing exhaustion with mass one for both measures, so [F6] identifies ν with Lap⁡(b)⊗d on the entire product sigma-algebra. Taking unrestricted factors equal to R gives the stated coordinate marginals and factorization for every finite subfamily of coordinate events. These are exactly the events in the generated coordinate sigma-algebras, so the projections are independent by [F7].

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableOpen item page →

Laplace mechanism

Definition

Assume Countable Choice. Let D be the finite-support count functions on a nonempty record universe, with neighbors formed by adding or removing one record occurrence. Input a database D∈D, a finite-dimensional query f:D→Rd with finite global L1 sensitivity Δ1f, and a parameter ε>0. If Δ1f>0, draw Z from the finite product law Lap⁡(Δ1f/ε)⊗d and release f(D)+Z. If Δ1f=0, release f(D) deterministically. The output space is Rd with its Borel sigma-algebra. Equivalently, for each Borel event A, the output kernel is K(D,A)=∫1A(f(D)+z)Lap⁡(Δ1f/ε)⊗d(dz) when Δ1f>0, and K(D,A)=1A(f(D)) when Δ1f=0.

Facts & Assumptions

Given: A database D, finite integer d≥1, measurable query f:D→Rd, finite Δ1f≥0, and ε>0.

[F1]

Database domain has the power-set sigma-algebra, so every function out of D is measurable.

[A1]

Countable Choice is assumed through the real-valued Laplace law supplier; the finite product adds no stronger choice requirement.

[F2]

Global sensitivity is a finite attained maximum over the add/remove neighboring pairs.

[F3]

Laplace law is a probability measure on R for every scale b≥0.

[F4]

Finite products of probability kernels are probability kernels and have the rectangle product law.

[F5]

Borel sigma-algebra on Rd is the output measurable structure; translations are homeomorphisms and carry Borel sets to Borel sets.

[F7]

Continuous maps between Borel spaces are measurable; the inverse translation therefore pulls Borel sets back to Borel sets.

[F6]

Probability-kernel conditions require probability-measure sections and measurable evaluation at each output event.

Verification

1.1A1F1F2F3F4F5F7givenconstruct

By [F2], Δ1f is finite and nonnegative, so the zero and positive branches cover every allowed input; if Δ1f>0, the scale b=Δ1f/ε is positive. By [A1], [F3], and [F4], the noise vector has a probability law ν=Lap⁡(b)⊗d. For each database D, define the output law as the pushforward of ν under z↦f(D)+z; the inverse translation is continuous, so [F7] makes the preimage of every Borel set Borel and this is a probability measure.

2.1F1F5F6step 1.1given∎

If Δ1f=0, assign the point mass at f(D), which is a probability measure on the Borel output space. For either branch and each Borel event A, the evaluation D↦K(D,A) is measurable because every subset of the database domain is measurable by [F1]. Thus the assignment is a probability kernel as required by [F6].

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Laplace mechanism privacy

Statement

Assume Countable Choice. For every finite-dimensional query f:D→Rd with d≥1 and finite global L1 sensitivity, and every ε>0, the Laplace mechanism is (ε,0)-differentially private under add/remove adjacency.

Facts & Assumptions

Given: d≥1, a finite-dimensional query f, finite sensitivity Δ1f, ε>0, neighboring databases D∼D′, and a Borel output event A⊆Rd.

[A1]

Countable Choice is inherited through the real Laplace probability law; no stronger choice principle is used.

[F1]

Sensitivity is the maximum of ∥f(D)−f(D′)∥1, where ∥x∥1=∑j=1d∣xj∣.

[F2]

Laplace mechanism uses scale b=Δ1f/ε when Δ1f>0, and releases f(D) deterministically when sensitivity is zero.

[F3]

Product density is (2b)−dexp⁡(−∥z∥1/b) for b>0.

[F4]

Translation change of variables preserves Lebesgue integrals because its Jacobian has absolute value one.

[F5]

Differential privacy is the event inequality for every ordered neighboring pair and every output event.

[F6]

The exponential addition formula, strict monotonicity, and positivity and the reciprocal identity give exp⁡(u+v)=exp⁡(u)exp⁡(v), make exp⁡ increasing, and give exp⁡(−u)=1/exp⁡(u)>0 for real u,v.

Proof

1.1A1F2F3F4givenconstruct

Suppose Δ1f>0 and put b=Δ1f/ε. By [F2]–[F4], the output law at database D has Lebesgue density pD(x)=(2b)−dexp⁡(−∥x−f(D)∥1/b), since [F4] translates the product noise density from [F3] by f(D).

2.1F1F6step 1.1givenalgebra

For every x∈Rd, coordinatewise triangle inequalities give ∥x−f(D′)∥1−∥x−f(D)∥1≤∥f(D)−f(D′)∥1≤Δ1f. The densities in [F3] are positive, and [F6] gives exp⁡(−u)/exp⁡(−v)=exp⁡(v−u) for real u,v. Therefore pD(x)/pD′(x)=exp⁡((∥x−f(D′)∥1−∥x−f(D)∥1)/b)≤exp⁡(Δ1f/b)=eε, where the inequality uses monotonicity from [F6]. Interchanging D,D′ proves the reverse pointwise ratio bound; integrating both bounds over A yields the two event inequalities.

3.1F1F2F5step 2.1algebra∎

If Δ1f=0, [F1] forces ∥f(D)−f(D′)∥1=0 for every neighboring pair, hence f(D)=f(D′). The deterministic output laws are identical, so both event inequalities hold with δ=0 (and ε≥0). Combining this case with step 2.1 and applying [F5] proves the result.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Exponential-mechanism utility sensitivity

Definition

Let D be the finite-support count functions on a nonempty record universe, with add/remove-one-occurrence adjacency. Let R be a nonempty finite set independent of the database, and let u:D×R→R be a real-valued utility. When the set of adjacent-pair utility differences has an attained finite maximum, the global utility sensitivity of u is

Δu=max⁡D∼D′, r∈R∣u(D,r)−u(D′,r)∣.

The sensitivity is positive when Δu>0; the exponential mechanism on this page uses that positive-sensitivity case.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Exponential mechanism

Definition

Let D be the finite-support count functions on a nonempty record universe, with add/remove-one-occurrence adjacency. Input a database D∈D, a parameter ε>0, a nonempty finite database-independent range R, and a real-valued utility u:D×R→R with finite positive global utility sensitivity Δu. For each r∈R, set wD(r)=exp⁡ ⁣(εu(D,r)2Δu),ZD=∑s∈RwD(s). Output r∈R with probability wD(r)/ZD. Equip R with its power-set sigma-algebra and define K(D,B)=∑r∈BwD(r)/ZD for each B⊆R; this is the probability kernel from databases to outputs.

Facts & Assumptions

Given: ε>0, a nonempty finite set R, a real-valued utility u, and a finite sensitivity Δu>0.

[F1]

Utility sensitivity is the attained finite maximum of adjacent-pair score differences over the database-independent finite range.

[F2]

The real exponential is finite on every real input, and exponential positivity gives strictly positive values.

[F3]

Probability measure means a measure of total mass one.

[F4]

The database domain has the power-set sigma-algebra.

[F5]

Probability kernel means each section is a probability measure and each event evaluation is measurable in the source.

Verification

1.1F1F2F3givenconstruct

Since Δu>0 and each score u(D,r) is real, [F2] makes every weight wD(r) finite and positive. The nonempty finite sum ZD is therefore finite and strictly positive. For A⊆R, define K(D,A)=∑r∈AwD(r)/ZD. This is nonnegative, equals one on R, and is countably additive because a disjoint family of subsets of finite R has only finitely many nonempty members. Thus each section is a probability measure by [F3].

2.1F4F5step 1.1∎

For every A⊆R, D↦K(D,A) is measurable because every subset of the database domain is measurable by [F4]. Hence the assignment satisfies both conditions in [F5] and is a probability kernel.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Exponential mechanism privacy and utility

Statement

Let D be the set of finite-support record-count databases, with neighbors defined by adding or removing one record occurrence. Let R be a nonempty finite set independent of the database, and let u:D×R→R be a real-valued utility with finite positive attained global utility sensitivity Δu. For ε>0, use weights wD(r)=exp⁡(εu(D,r)/(2Δu)) and normalize them over R as in the exponential mechanism. Its output law is (ε,0)-differentially private. For a fixed database D, let OPT⁡u(D)=max⁡r∈Ru(D,r),ROPT⁡={r∈R:u(D,r)=OPT⁡u(D)}. For every t>0, if M(D) denotes the random output, then

Pr⁡ ⁣[u(D,M(D))≤OPT⁡u(D)−2Δuε(ln⁡∣R∣∣ROPT⁡∣+t)]≤e−t.

Facts & Assumptions

Given: A nonempty finite database-independent range R, utility u, ε>0, Δu>0, neighboring databases D∼D′, and t>0.

[F1]

Exponential mechanism assigns weight wD(r)=exp⁡(εu(D,r)/(2Δu)), normalizer ZD=∑r∈RwD(r), and output mass wD(r)/ZD.

[F2]

Utility sensitivity gives ∣u(D,r)−u(D′,r)∣≤Δu for every neighboring pair and every r∈R.

[F3]

Finiteness and nonemptiness of R make OPT⁡u(D) attained and 1≤∣ROPT⁡∣≤∣R∣.

[F4]

Differential privacy requires the event inequality for both ordered directions of every neighboring pair.

[F5]

Natural logarithm and its inverse/exponential laws give e−ln⁡x=1/x for x>0.

[F6]

The exponential addition formula, strict monotonicity, and positivity and the reciprocal identity give exp⁡(u+v)=exp⁡(u)exp⁡(v), make exp⁡ increasing, and give exp⁡(−u)=1/exp⁡(u)>0 for real u,v.

Proof

1.1F1F2F4F6givenalgebra

For every r∈R, [F2] and monotonicity and addition for exp⁡ from [F6] give wD(r)≤eε/2wD′(r); summing gives ZD≤eε/2ZD′. Applying the same argument with D,D′ interchanged gives ZD′≤eε/2ZD. Since the weights and normalizers are positive, [F6] then yields (wD(r)/ZD)/(wD′(r)/ZD′)≤eε. Interchanging D,D′ gives the reverse point-mass bound. Summing over any event A⊆R gives both (ε,0) event inequalities, so [F4] proves privacy.

2.1F1F3F5F6givenalgebra∎

By [F3], the maximizing set is nonempty and its elements each have weight eεOPT⁡u(D)/(2Δu). Let B be the event in the Statement. For each r∈B, its defining score inequality, monotonicity and addition for exp⁡ from [F6], and [F5] imply wD(r)≤eεOPT⁡u(D)/(2Δu)(∣ROPT⁡∣/∣R∣)e−t. There are at most ∣R∣ such elements, while the normalizer is at least the sum of the maximizing weights, namely ∣ROPT⁡∣eεOPT⁡u(D)/(2Δu). Therefore the probability of B is at most e−t. If B is empty its probability is zero and the same bound holds.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

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+δ.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Differential privacy is preserved under randomized postprocessing

Statement

Let ε≥0 and 0≤δ≤1. Let K be an (ε,δ)-differentially private probability kernel from databases to a measurable space Y, and let L be a data-independent probability kernel from Y to a measurable space Z. Then the composed kernel KL is (ε,δ)-differentially private.

Facts & Assumptions

Given: An (ε,δ)-differentially private probability kernel K and a data-independent probability kernel L.

[F1]

Differential privacy means K(D,A)≤eεK(D′,A)+δ for every ordered neighboring pair and every measurable event.

[F2]

Probability kernels have measurable event evaluations with probability-measure sections.

[F3]

Bounded-function extension: the one-sided event inequality for probability measures extends to every measurable g:Y→[0,1] with the same parameters.

[F4]

Kernel composition is (KL)(D,B)=∫YL(y,B)K(D,dy).

[F5]

Kernel composition theorem ensures the displayed composition is a probability kernel.

Proof

1.1F1F2givenchoose

Fix ordered neighboring databases D∼D′ and an event B in the output sigma-algebra of Z. The function g(y)=L(y,B) is measurable and takes values in [0,1] by [F2].

2.1F1F3F4F5step 1.1algebra∎

Apply [F3] to the event inequality for K(D,⋅) and K(D′,⋅) with this g. Then [F4] identifies the two integrals with (KL)(D,B) and (KL)(D′,B), giving (KL)(D,B)≤eε(KL)(D′,B)+δ. The pair and event were arbitrary, and [F5] makes KL a probability kernel, so [F1] proves the claim.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Pure differential privacy bounds relative entropy

Statement

Assume the Axiom of Choice. Let P and Q be probability measures on a measurable space measurably isomorphic to a Polish space, and let ε≥0. If

P(A)≤eεQ(A)andQ(A)≤eεP(A)

for every measurable set A, then their Kullback–Leibler divergence satisfies

D(P∥Q)≤ε(eε−1).

Facts & Assumptions

Given: AC, probability measures P,Q on a standard-Borel space, ε≥0, and both event inequalities in the Statement.

[A1]

Axiom of Choice is assumed by the Radon–Nikodym density and KL suppliers used below.

[F1]

Standard-Borel space is a measurable space of the stated standard-Borel class.

[F2]

Radon–Nikodym theorem: for finite probability measures with P≪Q, there is a measurable density r with P(A)=∫Ar dQ for every measurable A.

[F3]

Integration against a density: if r=dP/dQ, then integrating a nonnegative measurable function against P equals integrating its product with r against Q, whenever defined.

[F4]

KL divergence uses D(P∥Q)=∫log⁡(dP/dQ) dP when P≪Q, and assigns +∞ otherwise.

[F5]

KL nonnegativity gives D(R∥S)≥0 for probability measures under AC.

[F6]

Exponential monotonicity, exponential positivity and reciprocals, and the natural-logarithm reciprocal law imply a=eε≥1, a−1=e−ε>0, and log⁡(1/t)=−log⁡t for t>0.

[F7]

Borel composition preserves measurability; in particular the reciprocal map on (0,+∞) makes s=1/r measurable on the set where r>0.

Proof

1.1A1F1F2givenchoose

The standard-Borel hypotheses are explicit as required by [F1]. Since P(A)≤aQ(A) for every measurable A, P≪Q. Choose a Radon–Nikodym density r=dP/dQ using [A1] and [F2].

2.1F2F3F6step 1.1givenalgebra

By [F6], a=eε≥1 and a−1>0. The inequality P(A)≤aQ(A) forces r≤a Q-almost everywhere: otherwise some set En={r≥a+1/n} has positive Q-measure and violates the inequality after integration. Similarly Q(A)≤aP(A)=a∫Ar dQ forces r≥a−1 Q-almost everywhere, since any positive-measure set where r≤a−1−1/n violates that inequality. Thus a−1≤r≤a almost everywhere.

3.1F2step 2.1givenalgebra

Let E={r≥1}, p=P(E), q=Q(E), and t=p−q. Since P(A)−Q(A)=∫A(r−1) dQ, the set E maximizes this difference and Ec gives its negative. Hence t=sup⁡A∣P(A)−Q(A)∣=12∫∣r−1∣ dQ. The event inequalities on E and Ec give t≤(a−1)q and at≤(a−1)(1−q), respectively. Adding yields (a+1)t≤a−1, so t≤(a−1)/(a+1).

4.1A1F3F4F5F6F7step 2.1step 3.1algebra∎

The lower bound in step 2.1 makes P and Q equivalent. Define s=1/r on {r>0} and s=0 on its null complement; [F7] makes it measurable. By [F3], ∫As dP=∫Asr dQ=Q(A) for every measurable A, so s=dQ/dP. The logarithm reciprocal identity in [F6] gives log⁡s=−log⁡r almost everywhere, and both log densities are bounded in absolute value by ε; [F4] therefore gives finite divergences and D(P∥Q)+D(Q∥P)=∫(r−1)log⁡r dQ≤ε∫∣r−1∣ dQ=2εt. By [F5], D(Q∥P)≥0, and step 3.1 gives 2εt≤2ε(a−1)/(a+1)≤ε(a−1). Therefore D(P∥Q)≤ε(a−1)=ε(eε−1).

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Approximate-DP kernels admit a nearby pure-DP kernel on standard-Borel targets

Statement

Assume AC. Let H and Y be measurable spaces measurably isomorphic to Polish spaces, let λ be a probability measure on H, and let K,L be probability kernels from H to Y. Let ε≥0 and 0≤δ≤1. Suppose that for λ-almost every h, both inequalities

K(h,A)≤eεL(h,A)+δ,L(h,A)≤eεK(h,A)+δ

hold for every measurable A⊆Y. Then there is a probability kernel K∗ from H to Y such that for λ-almost every h and every measurable A⊆Y,

e−εL(h,A)≤K∗(h,A)≤eεL(h,A),

and

∫HTV⁡(K(h,⋅),K∗(h,⋅)) λ(dh)≤δ,

where TV⁡(P,Q)=sup⁡A∣P(A)−Q(A)∣ over measurable events.

Facts & Assumptions

Given: AC, standard-Borel spaces H,Y, probability measure λ, probability kernels K,L, ε≥0, 0≤δ≤1, and the two event inequalities for λ-almost every h and every measurable event.

[A1]

Axiom of Choice is assumed by the jointly measurable RN-kernel and countable-algebra suppliers.

[F1]

Standard-Borel spaces are measurable spaces in the stated standard-Borel class.

[F2]

Probability kernels have probability-measure sections and measurable event evaluations.

[F3]

Joint RN derivatives: for standard-Borel source and target, kernels dominated sectionwise almost everywhere by a reference kernel have a product-measurable density representing every event on one common conull set.

[F4]

Countable determining algebra: a standard-Borel target has a countable algebra generating its sigma-algebra and determining finite measures.

[F5]

Kernel integration measurability: integrating a nonnegative product-measurable function against a probability kernel gives a measurable function of the source point.

[F6]

Density measures: integrating a nonnegative measurable section over events defines a measure.

[F7]

Measurable sections: every section of a product-measurable function is measurable.

[F8]

Borel composition preserves measurability; in particular finite-valued replacements and the clipping and correction functions below remain measurable.

[F9]

At u=0, The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x) gives exp⁡(0)=1/exp⁡(0)>0, hence exp⁡(0)=1. Then The exponential function is strictly increasing gives a=exp⁡(ε)≥1 for ε≥0, and the reciprocal identity gives c=exp⁡(−ε)=1/a>0.

Proof

1.1A1F1F2F3F4F5F6F7F8givenconstruct

Let M(h,A)=(K(h,A)+L(h,A))/2, which is a probability kernel by [F2]. For every h, M(h,A)=0 implies K(h,A)=L(h,A)=0, so both sections are absolutely continuous with respect to M(h,⋅). Apply [F3] twice to obtain jointly measurable densities. Replace any value +∞ by 0 in each density; this Borel operation preserves measurability by [F8] and changes no section measure on the common conull representation set, since each density has integral one. Call the resulting finite-valued functions p(h,y) and q(h,y). Let C be the countable generating algebra in [F4], containing Y. Define G to be the set of h for which, for every C∈C, both K(h,C)=∫Cp(h,y)M(h,dy) and L(h,C)=∫Cq(h,y)M(h,dy) hold, and both DP inequalities hold for C. By [F2], [F5], and countability of C, G is measurable. It has full λ-measure by the joint representation property and the hypothesis. For h∈G, [F6] and [F7] make the density integrals finite measures; they agree with K(h,⋅) and L(h,⋅) on C, so [F4] gives the density representations on every measurable event.

2.1F2F4step 1.1construct

For fixed h∈G, put ρ=K(h,⋅)+L(h,⋅), a finite measure. Let Eρ be the measurable sets approximable in ρ-measure by members of C. Complements preserve symmetric-difference measure, and (A∪B)△(C∪D)⊆(A△C)∪(B△D) proves closure under finite unions. If An∈Eρ and A=⋃nAn, put UN=⋃n≤NAn and D1=U1, DN=UN∖UN−1 for N>1. The DN are disjoint and A=⋃NDN, so countable additivity and finiteness of ρ(A) give ρ(A∖UN)=∑j>Nρ(Dj)→0. Approximate each of the first N sets closely enough that their finite union has arbitrarily small symmetric-difference measure from UN. Thus Eρ is a sigma-algebra containing C, so it is the full target sigma-algebra. For any measurable B, choose Cn∈C with ρ(B△Cn)→0. Then both K(h,Cn)→K(h,B) and L(h,Cn)→L(h,B), so the two inequalities on C pass to every measurable B.

3.1F2F5F7F8F9step 2.1givenalgebra

Write a=exp⁡(ε)≥1 and c=exp⁡(−ε)=1/a>0 by [F9]. On G, set p0=min⁡{max⁡{p,cq},aq}, α=∫(p−aq)+ dM, and β=∫(cq−p)+ dM. These quantities are finite and measurable in h by [F5] and [F8]. The sets Ah={y:p(h,y)>aq(h,y)} and Bh={y:p(h,y)<cq(h,y)} are measurable by [F7]. Step 2.1 and the density identities give α=K(h,Ah)−aL(h,Ah)≤δ and aβ=L(h,Bh)−aK(h,Bh)≤δ. Also p0=p−(p−aq)++(cq−p)+, so m:=∫p0 dM=1−α+β. Hence max⁡{α,β}≤δ.

4.1F2F5F6F8F9step 1.1step 3.1algebra

Define a corrected density on G as follows. If m<1, let t+=(1−m)/(a−m) and r=p0+t+(aq−p0). Its denominator is positive and 0≤t+≤1 because a≥1, so p0≤r≤aq and ∫r dM=m+t+(a−m)=1. If m>1, let t−=(m−1)/(m−c) and r=p0−t−(p0−cq). Here m−c>0 and 0≤t−≤1 because c≤1, so cq≤r≤p0 and ∫r dM=m−t−(m−c)=1. If m=1, set r=p0. These formulas are product-measurable by [F8], and in every case cq≤r≤aq and ∫r dM=1. Set r=0 off G and define K∗(h,A)=∫Ar(h,y)M(h,dy)+1Gc(h)L(h,A). By [F5], this is measurable in h for each A; for each h∈G it is a probability measure by [F6] and the normalization, and for h∉G it equals the probability measure L(h,⋅). Thus K∗ is a probability kernel. For h∈G, integrate cq≤r≤aq and use the density representation of L to obtain the claimed two-sided pure-DP inequalities.

5.1F2F4F5step 1.1step 2.1step 3.1step 4.1algebra∎

For h∈G, clipping changes p by total integral ∫∣p−p0∣ dM=α+β, while correction moves p0 in one direction and changes its integral by ∣m−1∣=∣α−β∣. Thus ∫∣p−r∣ dM≤α+β+∣α−β∣=2max⁡{α,β}≤2δ. For probability densities with equal integral, sup⁡A∣∫A(p−r) dM∣=12∫∣p−r∣ dM: every event integral is bounded by the positive-part integral and {p≥r} attains it. Hence TV⁡(K(h,⋅),K∗(h,⋅))≤δ on G. This TV function is measurable: applying the approximation argument of step 2.1 to K+K∗ shows its supremum may be taken over C, whose kernel evaluations are measurable. Since G is conull, integration proves the asserted bound.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Basic adaptive composition

Statement

Let D be the finite-support count functions on a nonempty record universe, with neighbors formed by adding or removing one record occurrence. Let k≥1 and let Y1,…,Yk be measurable output spaces. For each round i, let Ki(D,h,⋅) be a probability kernel on Yi for every database D∈D and prior transcript h∈Y1×⋯×Yi−1. Suppose that for every neighboring pair D∼D′, every prior transcript h, and every measurable event A⊆Yi,

Ki(D,h,A)≤eεiKi(D′,h,A)+δi,

where εi≥0 and δi≥0. If ∑i=1kδi≤1, then the full transcript is (∑i=1kεi,∑i=1kδi)-differentially private on the finite product sigma-algebra.

Facts & Assumptions

Given: The finite sequence of history-dependent probability kernels, common neighboring-database relation, and the conditional event inequalities in the Statement.

[F1]

Differential privacy is the event inequality for every ordered neighboring pair; its database source has the power-set sigma-algebra, so all event-evaluation functions of the database are measurable.

[F2]

Probability kernels have measurable event evaluations and probability-measure sections.

[F3]

Finite product sigma-algebra is generated by measurable rectangles.

[F4]

Sections of product-measurable sets are measurable.

[F5]

Kernel integration measurability: integrating a nonnegative product-measurable function against a probability kernel gives a measurable function of the history.

[F6]

Bounded-function extension: a prefix event inequality extends to every measurable function with values in [0,1] with the same additive error.

[F7]

Kernel composition uses iterated integration.

[F8]

Composed probability kernels remain probability kernels and their event values are the iterated integrals.

[F9]

The exponential addition formula gives exp⁡(x+y)=exp⁡(x)exp⁡(y) for all real x,y.

Proof

1.1F1F2F3F4F5F7F8givenconstruct

Put H0={∗} and Hi=Y1×⋯×Yi. For fixed D and i, define TiD(h,B)=∫Yi1B(h,y)Ki(D,h,dy) for measurable B⊆Hi. By [F4], Bh is measurable; taking sections preserves the whole space, complements, and countable disjoint unions, so B↦TiD(h,B)=Ki(D,h,Bh) is a probability measure by [F2]. By [F5], h↦TiD(h,B) is measurable, so TiD is a probability kernel. Starting with the point mass on H0, compose these kernels using [F7]–[F8] to obtain transcript laws μiD with μiD(B)=∫Hi−1Ki(D,h,Bh)μi−1D(dh). Every transcript-event evaluation is measurable in the database because its sigma-algebra is the power set by [F1]. No choice is used in these finite compositions.

2.1F1F2F4F5F6F7F9step 1.1algebrainduction∎

Write Ei=∑j≤iεj and Di=∑j≤iδj, with E0=D0=0. We prove by induction that μiD(B)≤eEiμiD′(B)+Di for every measurable B⊆Hi; it is equality at the one-point prefix i=0. Suppose it holds at i−1, fix an event B⊆Hi, and put p(h)=Ki(D,h,Bh) and q(h)=Ki(D′,h,Bh). By [F2], [F4], and [F5], these are measurable and lie in [0,1]. The round-i event inequality and p≤1 imply p(h)≤min⁡{1,eεiq(h)}+δi, because min⁡{1,x+δi}≤min⁡{1,x}+δi for x≥0. Let g(h)=min⁡{1,eεiq(h)}; it is measurable and [0,1]-valued. Integrating first against μi−1D, applying [F6] to the induction hypothesis, then using g≤eεiq and [F9] with Ei=Ei−1+εi, gives μiD(B)≤eEi−1eεi∫q dμi−1D′+Di−1+δi=eEiμiD′(B)+Di. The same argument with D,D′ interchanged proves the reverse ordered inequality. At i=k, [F1] gives the asserted differential-privacy guarantee.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Advanced adaptive composition for standard-Borel outputs

Statement

Assume AC. Let D be the finite-support count functions on a nonempty record universe, with neighbors formed by adding or removing one record occurrence. Let k≥1, let each round output space and each finite transcript-prefix space be a measurable space measurably isomorphic to a Polish space, and let Ki(D,h,⋅) be the probability kernel for round i conditional on prior transcript h. Suppose that for every D∼D′, every i, every h, and every measurable round-i event A,

Ki(D,h,A)≤eεKi(D′,h,A)+δ,

where ε≥0 and 0≤δ≤1. If 0<δ′<1 and kδ+δ′≤1, then the finite-product full transcript is (ε′,kδ+δ′)-differentially private, where

ε′=2kln⁡(1/δ′) ε+kε(eε−1).

Facts & Assumptions

Given: AC, k≥1 adaptive rounds with (ε,δ)-private conditional kernels for every history, standard-Borel output and finite-prefix spaces, and 0<δ′<1 with kδ+δ′≤1.

[A1]

Axiom of Choice is assumed by the RN, path-law, conditional-KL, and Azuma suppliers.

[F1]

Differential privacy is the event inequality in both directions for every ordered neighboring pair; the database source has the power-set sigma-algebra, so transcript-event evaluations are measurable in the database.

[F2]
[F3]

Ionescu–Tulcea path law: under AC, an initial probability and a sequence of history-dependent probability kernels give a probability law whose finite-prefix laws are the prescribed iterated integrals.

[F4]

Joint RN derivatives: dominated probability kernels on standard-Borel source and target spaces have a jointly measurable density representing every event on one common conull set.

[F5]

Pure-DP KL bound: if two probability laws satisfy both pure ε event inequalities, then D(P∥Q)≤b, where b=ε(eε−1); the same holds with P,Q reversed.

[F6]

Kernel purification: under AC, an (ε,δ) pair of kernels has a pure-ε replacement within integrated total variation δ under any supplied history probability.

[F7]

Conditional KL is the integral of the fiberwise KL divergence; Conditional KL is measurable for supplied kernels makes its integrand measurable.

[F8]

Conditional expectation is characterized by measurability and equality of integrals over every event in the conditioning sigma-algebra.

[F9]

Azuma–Hoeffding: if martingale differences have history-measurable interval bounds of length ci, then the upper tail at t>0 is at most exp⁡(−2t2/∑ici2).

[F10]

Bounded-function extension applied in both directions converts an event bound with ε=0 and additive error s into ∣∫g dP−∫g dQ∣≤s for every measurable 0≤g≤1.

[F11]

RN integration identity recovers integration against a measure by multiplying by its density.

[F12]

Kernel integration measurability and Every section of a product-measurable function is measurable make the history-section probabilities and their integrals measurable.

[F13]

Natural logarithm is the inverse of the positive real exponential and is defined on the positive likelihood ratios used below.

[F14]

Expectation is integration against the path probability law; bounded privacy-loss variables are integrable.

[F15]

The logarithm product law gives ln⁡(xy)=ln⁡x+ln⁡y for positive x,y.

Proof

1.1A1F1F2F3givenchooseconstruct

Fix neighboring databases D,D′. By [F2], every finite history space is standard Borel. To apply the infinite-sequence form of [F3], append after round k a singleton output space and its unique probability kernel at every later round. The first k coordinates of the resulting path law have exactly the desired finite transcript law; do this for D and D′ to obtain P and Q. Event evaluations of these laws are measurable in the database by [F1].

1.2A1F3F6givenconstruct

We first prove the one-sided estimate from P to Q. Set P0∗=Q0 equal to the point mass on the empty history. Recursively, after constructing the modified D-transcript prefix law Pi−1∗, apply [F6] to the round-i pair Ki(D,h,⋅),Ki(D′,h,⋅) with base history law λi=Pi−1∗. This gives a probability kernel Ki∗ that is pure ε relative to Ki(D′,h,⋅) in both event directions for λi-almost every h, with ∫TV⁡(Ki(D,h,⋅),Ki∗(h,⋅))Pi−1∗(dh)≤δ. Composing the finite modified sequence by [F3] gives a law P∗ and its prefix laws Pi∗.

2.1F1F3step 1.2giveninduction

The prefix laws Pi∗ and Qi are mutually absolutely continuous for each i. They agree at the empty history. If they are equivalent at i−1, then for a product-measurable event B with Qi(B)=0, the iterated integral formula [F3] gives Ki(D′,h,Bh)=0 for Qi−1-almost every h, hence for Pi−1∗-almost every h. The pure reverse inequality from step 1.2 gives Ki∗(h,Bh)=0, so Pi∗(B)=0. Reversing the two kernels proves the converse; induction gives prefix equivalence.

3.1F1F4F13step 1.2step 2.1givenconstruct

For each i, apply [F4] with base measure Pi−1∗ to obtain a jointly measurable density ri(h,y) of Ki∗(h,⋅) with respect to Ki(D′,h,⋅) on one common conull history set. The pure event inequalities imply e−ε≤ri≤eε almost surely there: if either bound failed on a positive-measure fiber set, some level set separated from that bound by 1/n would contradict one event inequality. Clip ri everywhere to [e−ε,eε]; Borel composition preserves measurability, the density is unchanged on the conull set, and Xi(h,y)=ln⁡ri(h,y) is jointly measurable with ∣Xi∣≤ε.

4.1F3F4F11F13F15step 3.1induction

We prove the density formula by induction on prefix length. At the first round, [F4] gives dP1∗/dQ1=r1. Suppose Ri−1=∏j<irj is the density on the first i−1 outputs. For a measurable event A on the first i outputs, [F3] gives Pi∗(A)=∫Pi−1∗(dh)∫1A(h,y)Ki∗(h,dy). For almost every h, [F4] replaces the inner integral by ∫1A(h,y)ri(h,y)Ki(D′,h,dy). Applying [F11] to the outer prefix integral with density Ri−1 yields Pi∗(A)=∫Qi−1(dh)Ri−1(h)∫1A(h,y)ri(h,y)Ki(D′,h,dy)=∫ARi−1(h)ri(h,y)Qi(dh,dy). This proves the induction and hence dP∗/dQ=R=∏i=1kri(Hi−1,Yi). Since every factor is positive and bounded, [F15] gives ln⁡R=∑i=1kXi(Hi−1,Yi) almost surely under both laws.

4.2F3F5F7F8F12F14step 3.1givenconstruct

Put mi(h)=∫Xi(h,y)Ki∗(h,dy). By the density formula and KL definition, mi(h)=D(Ki∗(h,⋅)∥Ki(D′,h,⋅))≤b for Pi−1∗-almost every h, using [F5]. It is measurable by [F7] and [F12]. For every measurable prefix event C, the iterated-prefix identity [F3] gives ∫{Hi−1∈C}Xi dP∗=∫Cmi(h)Pi−1∗(dh). Thus [F8] identifies mi(Hi−1) as the conditional expectation of Xi given the previous transcript. By [F14], the variables are integrable, so Mj=∑i≤j(Xi−mi(Hi−1)) is a martingale. Each increment lies in the history-measurable interval [−ε−mi,ε−mi], of length 2ε.

5.1F5F9step 4.1step 4.2givenalgebra

If ε=0, every Xi=0, so P∗=Q and the pure transcript has zero privacy loss. If ε>0, apply [F9] to step 4.2 with ci=2ε and t=ε2kln⁡(1/δ′). It gives P∗(Mk≥t)≤δ′. Since ∑imi≤kb almost surely, the privacy loss exceeds ε′=kb+t with probability at most δ′. For any event A, split it into A∩{ln⁡R≤ε′} and A∩{ln⁡R>ε′}; the density formula in step 4.1 bounds the first probability by eε′Q(A) and the second by δ′. Thus P∗(A)≤eε′Q(A)+δ′. Applying the same argument under Q with the roles reversed gives Q(A)≤eε′P∗(A)+δ′, because the conditional kernels are pure in both directions and [F5] bounds both KL orientations.

6.1F3F6F10F12step 1.2step 5.1givenalgebra

We compare P and P∗ in total variation. For i=0,…,k, let Hi be the transcript law that uses the modified D kernels for rounds 1,…,i and the original D kernels for rounds i+1,…,k. Consecutive laws share the modified prefix through round i−1, whose law is Pi−1∗, and differ only in the round-i kernel; after that round they use the same continuation kernels. For any final event, integrating that common continuation gives a measurable conditional probability g(h,y) in [0,1] by [F12]. The two-sided test-function bound [F10] and the integrated TV bound in step 1.2 yield TV⁡(Hi−1,Hi)≤δ. The triangle inequality gives TV⁡(P,P∗)≤kδ, hence P(A)≤P∗(A)+kδ. Combining with step 5.1 proves P(A)≤eε′Q(A)+kδ+δ′.

7.1F1step 1.2step 5.1step 6.1given∎

Repeat steps 1.2–6.1 with D′ as the modified side and D as the reference side. This gives Q(A)≤eε′P(A)+kδ+δ′. The ordered pair and event were arbitrary, so [F1] proves the stated differential-privacy guarantee. The condition kδ+δ′≤1 keeps the additive parameter in its declared nontrivial range; no step weakens the claimed epsilon.

LemmaStatement: AI-adaptedProof: AI-adaptedOpen item page →

Approximate privacy admits purification of a joint measure with fixed history marginal

Statement

Assume AC. Let H,Y be arbitrary measurable spaces, let λ be a probability measure on H, and let K,L be probability kernels from H to Y. Suppose ε≥0, 0≤δ≤1, and, for every h and every measurable A⊆Y, K(h,A)≤eεL(h,A)+δ,L(h,A)≤eεK(h,A)+δ. Define probability measures on the product sigma-algebra by R(B)=∫HK(h,Bh)λ(dh),S(B)=∫HL(h,Bh)λ(dh). There is a probability measure T on H×Y whose H marginal is λ, such that, as inequalities of measures, e−εS≤T≤eεS,TV⁡(R,T)≤δ. Here TV⁡(U,V)=sup⁡B∣U(B)−V(B)∣. No countability or topological condition is imposed on either measurable space.

Facts & Assumptions

Given: AC, arbitrary measurable H,Y, probability λ, probability kernels K,L, and the pointwise two-directional event bounds in the Statement.

[A1]

AC is assumed for ordinary Radon–Nikodym derivatives of finite measures; the whole space is a common finite exhaustion.

[F2]

A nonnegative density defines a measure. Monotone convergence extends identities for indicator integrals first to simple functions and then to nonnegative measurable functions.

[F3]

Borel composition preserves measurability of the finite scalar clipping and correction formulas below.

[F4]

At u=0, The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x) gives exp⁡(0)=1/exp⁡(0)>0, hence exp⁡(0)=1. Then The exponential function is strictly increasing gives a=exp⁡(ε)≥1 for ε≥0, and the reciprocal identity gives 1/a=exp⁡(−ε)>0.

Proof

1.1A1F1F2F3givenchooseconstruct

By [F1], the integrands defining R,S are measurable. Countable additivity follows by applying monotone convergence to disjoint sections, and total mass is one. The same argument gives μ=(R+S)/2=λ⊗M, where M=(K+L)/2 is the explicit mixture probability kernel and the notation λ⊗M denotes the displayed iterated integral. Both R,S have marginal λ. By [A1], choose a density of R relative to μ. The inequality 0≤R≤2μ forces this density into [0,2] almost everywhere: a positive-measure level set violating a bound would contradict that measure inequality. Clip it into [0,2] and call the result p; put q=2−p. Thus p,q are finite nonnegative product-measurable densities of R,S relative to μ. The indicator identities extend to nonnegative integrands by [F2].

2.1F1F2F3F4step 1.1givenconstruct

Write a=exp⁡(ε)≥1 by [F4]. Let E={p>aq} and F={p<q/a}, both product-measurable. For every measurable history event C, apply the assumed event inequality to Eh for h∈C, and integrate. The density identities give ∫C×Y(p−aq)+ dμ=R(E∩(C×Y))−aS(E∩(C×Y))≤δλ(C). Similarly ∫C×Y(q/a−p)+ dμ≤(δ/a)λ(C). Define α(h)=∫(p−aq)+(h,y)M(h,dy) and β(h)=∫(q/a−p)+(h,y)M(h,dy). These are finite measurable functions. Localization over all C implies α≤δ and β≤δ/a almost everywhere, since a violating positive-measure level set could be used for C. Likewise, the common history marginals imply ∫p(h,y)M(h,dy)=∫q(h,y)M(h,dy)=1 for λ-almost every h, by equality of their integrals over every C. Let G be the measurable conull set where all four scalar conditions hold. Only the two specified joint level sets and scalar marginal identities have been used; no simultaneous fiberwise density representation is asserted.

3.1F1F3F4step 1.1step 2.1constructalgebra

Put c=min⁡{max⁡{p,q/a},aq} and m(h)=∫c(h,y)M(h,dy). On G, m=1−α+β and q/a≤c≤aq. If m<1, set w=c+1−ma−m(aq−c); if m>1, set w=c−m−1m−1/a(c−q/a); if m=1, set w=c. Every used denominator is strictly positive and its fraction lies in [0,1]. These formulas give q/a≤w≤aq and ∫w(h,y)M(h,dy)=1 on G. Off G, set w=q. All formulas are measurable by [F1] and [F3]; each division is confined to its stated measurable branch. In particular, when a=1, c=q and m=1 on G, so no zero denominator is used.

4.1F1F2step 1.1step 2.1step 3.1algebra∎

Define T(B)=∫Bw dμ. By [F2] this is a measure. The conditional normalization on G and the fact that Gc is λ-null imply T(C×Y)=λ(C), so T is a probability measure with the required marginal. Integrating q/a≤w≤aq gives S/a≤T≤aS. On G, clipping changes p by conditional absolute integral α+β, and the correction changes c in one direction by conditional absolute integral ∣1−m∣=∣α−β∣. Consequently ∫∣p−w∣ dμ≤2∫max⁡{α,β} dλ≤2δ. Because p,w have equal total integral, the positive and negative parts of p−w have the same integral; every event integral lies between these two extrema, attained by its sign sets. Thus TV⁡(R,T)=12∫∣p−w∣ dμ≤δ. This proves all claims, including δ=0 and ε=0.

Source notes

The source gives the clipping/redistribution idea and the advanced-composition reduction for discrete distributions. The proof here supplies the joint-measure construction on arbitrary measurable spaces. Its conclusion concerns measures with a fixed marginal and does not claim a measurable family of fiberwise Radon–Nikodym derivatives or a disintegration of T.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Advanced adaptive composition on arbitrary measurable output spaces

Statement

Assume AC. Let D be a set equipped with its power-set sigma-algebra and a symmetric adjacency relation ∼; this includes finite-support record-count databases with neighbors differing by one added or removed occurrence. Let k≥1, let Y1,…,Yk be arbitrary measurable output spaces, and let round i be a probability kernel Ki(D,h,⋅) on Yi, measurable in the previous transcript h∈Hi−1=∏j<iYj for each database D. Suppose that for every ordered neighboring pair D∼D′, every i, every h, and every measurable A⊆Yi, Ki(D,h,A)≤eεKi(D′,h,A)+δ, where ε≥0 and 0≤δ≤1. If 0<δ′<1 and kδ+δ′≤1, then the full transcript, on the finite product sigma-algebra, is (ε′,kδ+δ′)-differentially private, where ε′=ε2kln⁡(1/δ′)+kε(eε−1).

Facts & Assumptions

Given: AC, the finite adaptive sequence on arbitrary measurable output spaces, the two ordered conditional privacy inequalities at every history, and the stated parameters.

[A1]

AC supplies ordinary RN derivatives of finite measures and is assumed by the concentration supplier below.

[F1]

Differential privacy uses an event inequality for every ordered neighboring pair. Here the same event criterion is used for the stated symmetric adjacency relation on D, whose sigma-algebra is the power set.

[F2]

Measurable sections and kernel integration measurability apply to arbitrary finite product sigma-algebras. Monotone convergence extends indicator identities to nonnegative functions and proves countable additivity of kernel-integrated measures.

[F3]

Joint-measure purification produces, for any supplied history probability λ, a probability T with that marginal, e−ε(λ⊗L)≤T≤eε(λ⊗L), and TV⁡(T,λ⊗K)≤δ under the two pointwise event inequalities.

[F4]

RN integration identifies integrals against density measures; its indicator and simple identities extend to nonnegative functions by [F2], and then to integrable signed functions by positive and negative parts. Density measures are measures.

[F5]

The bounded-test-function extension implies ∣∫g dU−∫g dV∣≤s for measurable 0≤g≤1 whenever TV⁡(U,V)≤s.

[F6]

Conditional expectation is characterized by equality of integrals over all conditioning events.

[F7]

Azuma–Hoeffding bounds the upper tail of a martingale with increment interval lengths ci by exp⁡(−2t2/∑ici2).

[F8]

Borel composition preserves scalar measurability. Logarithm laws and the integral formula log⁡x=∫1xdt/t apply to positive likelihood ratios. In particular log⁡x≤x−1 for x>0: integrate 1/t≤1 from 1 to x when x≥1, and integrate 1/t≥1 from x to 1 with a minus sign when x≤1.

[F9]

At u=0, The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x) gives exp⁡(0)=1/exp⁡(0)>0, hence exp⁡(0)=1. Then The exponential function is strictly increasing gives a=exp⁡(ε)≥1 for ε≥0, and the reciprocal identity gives a−1=exp⁡(−ε)>0.

Proof

1.1F1F2givenconstruct

Fix an ordered neighboring pair D,D′, and abbreviate the two round kernels by Ki,Li. Let H0={∗} and Hi=Hi−1×Yi. For any probability λ on Hi−1, the formula (λ⊗Ki)(B)=∫Ki(h,Bh)λ(dh) defines a probability on Hi: sections and their evaluations are measurable, and countable additivity follows by monotone convergence for disjoint sections. Its history marginal is λ. Starting at the point mass on H0, finite recursion constructs the original prefix laws Pi=Pi−1⊗Ki and Qi=Qi−1⊗Li. Integrals of product-measurable nonnegative functions have the corresponding iterated-integral formula, first for indicators and then by [F2]. No countable-generation hypothesis enters this construction.

2.1A1F2F3F5F9step 1.1constructinduction

Set T0=P0=Q0. Given Ti−1, form Ri=Ti−1⊗Ki and Si=Ti−1⊗Li. Apply [F3] with history law Ti−1 to obtain a probability Ti on Hi with marginal Ti−1, Si/a≤Ti≤aSi, and TV⁡(Ri,Ti)≤δ, where a=exp⁡(ε)≥1 by [F9]. The hypotheses hold at every history, hence also under the modified history law. These are measures only; no conditional kernel for Ti is required. Finite iteration yields consistent prefix marginals of the final probability Tk. Moreover [F5], applied to h↦Ki(h,Bh)∈[0,1], gives TV⁡(Pi,Ri)≤TV⁡(Pi−1,Ti−1). Thus the triangle inequality and induction give TV⁡(Pi,Ti)≤iδ.

3.1A1F2F4F8F9step 1.1step 2.1chooseinduction

By [A1] choose a product-measurable density ri=dTi/dSi. The measure bounds in step 2.1 force a−1≤ri≤a almost everywhere, since otherwise a level set separated from one bound contradicts that bound after integration. Clip the representative into this positive interval everywhere. Write Zi=∏j≤irj as a function on Hi, with Z0=1. We prove dTi/dQi=Zi by induction. If dTi−1/dQi−1=Zi−1, then for any nonnegative measurable g on Hi, [F2] and [F4] give ∫g dTi=∫gri dSi=∫Ti−1(dh)∫g(h,y)ri(h,y)Li(h,dy)=∫Qi−1(dh)Zi−1(h)∫g(h,y)ri(h,y)Li(h,dy)=∫gZi−1ri dQi. The base is the common point mass. Hence Zi is the asserted density and is everywhere positive and finite. In particular log⁡Zk=∑iXi for the measurable prefix variables Xi=log⁡ri, each in [−ε,ε].

4.1F2F4F8F9step 2.1step 3.1constructalgebra

Define measurable functions on Hi−1 by ui(h)=∫ri(h,y)Li(h,dy) and mi(h)=∫ri(h,y)log⁡ri(h,y)Li(h,dy). They are finite by the bounds in step 3.1. Because Ti and Si have the same history marginal Ti−1, their density identity on C×Yi gives ∫Cui dTi−1=Ti−1(C) for every C, so ui=1 almost everywhere under Ti−1. On this conull set, log⁡ri≤ri−1 gives ∫log⁡ri dLi≤0. Therefore mi≤∫(ri−1)log⁡ri dLi≤ε∫∣ri−1∣ dLi. For every a−1≤r≤a, ∣r−1∣≤(a−1)min⁡{r,1}, by separately checking r≥1 and r≤1. Thus mi≤ε(a−1)=:b almost everywhere. This scalar conditional calculation supplies the entropy bound without a fiberwise RN identity.

5.1F2F4F6step 2.1step 3.1step 4.1construct

Work on (Hk,Tk) with the filtration Fi generated by the first i coordinates. For any measurable history event C, consistency of marginals, the density identity for Ti relative to Si, and the iterated-integral formula give ∫{Hi−1∈C}Xi dTk=∫Cmi(h)Ti−1(dh). Hence mi(Hi−1) is a version of ETk[Xi∣Fi−1] by [F6]. It is bounded, as are the Xi, so Mj=∑i≤j(Xi−mi(Hi−1)) is an integrable martingale. Its ith increment lies in the Fi−1-measurable interval [−ε−mi,ε−mi], whose length is 2ε.

6.1F4F7step 2.1step 3.1step 4.1step 5.1algebra

If ε=0, all ri=1, so Tk=Qk and the desired one-sided bound follows from step 2.1 with error kδ. If ε>0, put t=ε2kln⁡(1/δ′)>0. Applying [F7] with interval lengths 2ε gives Tk(Mk≥t)≤exp⁡(−t2/(2kε2))=δ′. Step 4.1 bounds ∑imi≤kb, so Tk(log⁡Zk>kb+t)≤δ′. Set ε′=kb+t. For every transcript event B, split at log⁡Zk≤ε′ and use the density from step 3.1 to obtain Tk(B)≤eε′Qk(B)+δ′. Then step 2.1 gives Pk(B)≤eε′Qk(B)+kδ+δ′.

7.1F1step 1.1step 2.1step 6.1given∎

The preceding construction applies to every ordered neighboring pair. In particular repeat it with D,D′ interchanged, constructing a new modified measure on that side, to get Qk(B)≤eε′Pk(B)+kδ+δ′. This proves differential privacy by [F1]. The proof includes k=1, δ=0, and equality kδ+δ′=1; 0<δ′<1 makes the logarithm finite and positive. All database event evaluations are measurable by the power-set database convention in [F1]. No modified law, density, or exceptional set needs to be selected measurably in the database pair: the event inequality has been proved for each pair separately.

Source notes

The source's privacy-loss and symmetrized-entropy argument supplies the exact constants. Its displayed point probabilities do not establish measurable conditional density versions on arbitrary output spaces. The joint-measure purification lemma and the prefix-law RN argument above supply that extension. Every use of a conditional expectation is verified by an integral identity, without conditioning on individual history points or invoking a regular conditional distribution.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Basic and advanced adaptive composition

Statement

Let databases be finite-support record-count functions, with neighbors differing by one added or removed record occurrence. For k≥1, let round i be a probability kernel Ki(D,h,⋅) on the ith arbitrary measurable output space, conditional on every prior transcript h. Suppose that for every ordered neighboring pair D∼D′, every h, and every measurable round-i event A,

Ki(D,h,A)≤eεiKi(D′,h,A)+δi,

where εi≥0 and δi≥0. If ∑iδi≤1, the full transcript on the finite product sigma-algebra is (∑iεi,∑iδi)-differentially private. Also, assuming AC, if every conditional round has the same parameters (ε,δ) with ε≥0 and 0≤δ≤1, then for any 0<δ′<1 with kδ+δ′≤1, advanced composition on arbitrary measurable output spaces gives parameters (ε′,kδ+δ′), where

ε′=2kln⁡(1/δ′) ε+kε(eε−1).

Facts & Assumptions

Given: The finite adaptive kernels and conditional event inequalities on arbitrary measurable output spaces in the Statement; AC for the advanced clause.

[A1]

AC is assumed for the ordinary Radon–Nikodym and concentration suppliers used only by the advanced clause.

[F1]

Differential privacy is the event inequality for every ordered neighboring pair.

[F2]

Basic adaptive composition applies to arbitrary measurable output spaces and heterogeneous parameters, with additive sums of epsilon and delta.

[F3]

Advanced adaptive composition proves the exact displayed epsilon and additive error on arbitrary measurable output spaces under AC, using joint-measure purification and ordinary prefix-law densities.

Proof

1.1F1F2given

Apply [F2] to the stated round kernels and their parameters. Its every-history hypotheses and arbitrary measurable output scope agree with the Statement, and the condition on the sum of the additive errors places the resulting parameter in the declared range. This gives the basic clause without choice.

2.1A1F1F3given∎

For the common-parameter clause assume [A1] and apply [F3] to the same kernels with common parameters (ε,δ) and the stated δ′. Its hypotheses are exactly the every-history event inequalities and parameter conditions here. Its full-transcript event inequality has epsilon 2kln⁡(1/δ′) ε+kε(eε−1) and additive error kδ+δ′, which gives the advanced clause by [F1].

RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Record-level scope and limits of differential privacy

Remark

The definition on this page is central, record-level privacy for add/remove adjacency. It does not by itself define client-level or local privacy, and keeping data on a device or applying secure aggregation does not establish the event inequalities in this definition. Differential privacy limits the effect of one record on a release; it does not prevent conclusions about an attribute that is strongly correlated with other records or public information.

4 · Examples, counterexamples and false statements

None yet.

Sources