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
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Computational foundations: factorization, KL, and optimization
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Darboux, L'Hôpital, and Taylor's Theorem
- Determinants of Matrices over a Commutative Ring
- Discrete Time Martingales
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Domination and Likelihood Ratios
- Event observation, censoring, truncation
- Feynman–Kac targets and sequential particle filters
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability Spaces and Random Variables
- Finite-Alphabet Entropy and Divergence
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Lebesgue Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Markov Kernels and Markov Chains
- Martingale Inequalities and Convergence
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measure-Theoretic Information and Conditioning
- Measures and Their Basic Properties
- Metric Spaces
- Minimax Lower Bounds
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Parametric survival and reliability
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Quantum Communication and Fingerprinting
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- SCM, DAGs, adjustment
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Standard-Borel Real Codings and Determining Classes
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Integral Logarithm and the Equivalence of Its Characterisations
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Logical flowchart
3 · Definitions, theorems and proofs
Differential privacy, databases, and add/remove adjacency
Definition
Let be a nonempty set of possible records and let . A database is a function with finite support ; is the number of occurrences of record . Let be the set of databases and equip it with the power-set sigma-algebra. For , let be the function that is one at and zero elsewhere. Two databases are neighbors, written , when or for some .
A randomized mechanism with output measurable space is a probability kernel from to : for each , is a probability measure on , and for each , is measurable. Given and , the mechanism is -differentially private if, for every ordered neighboring pair and every output event ,
The mechanism is -differentially private, or pure -differentially private, when . The ordered-pair quantifier includes both directions because is symmetric.
Laplace noise distribution
Definition
Assume Countable Choice. For , let be the probability measure on concentrated on with Lebesgue density there and zero elsewhere. For every Borel set , define
Thus is the equal mixture of the positive exponential law and its reflection in the origin. Define to be the point mass at .
Global L1 sensitivity
Definition
Let and let be a query on databases with the add/remove adjacency relation. Write . When the set of adjacent-pair differences has an attained finite maximum, the global sensitivity of is
The sensitivity is finite when this maximum is finite.
Laplace noise has its stated Lebesgue density
Statement
Assume Countable Choice. For every , the probability measure is absolutely continuous with respect to Lebesgue measure on and has density
Statement references
Facts & Assumptions
Given: and a Borel set .
Countable Choice is the axiom assumed by the cited exponential-law and Lebesgue change-of-variables suppliers; no full Axiom of Choice is invoked.
Laplace distribution: , where is the exponential probability law of rate .
Exponential-law density: for , the density is when and otherwise, and it defines a probability law.
Lebesgue change of variables: a diffeomorphism transforms nonnegative Lebesgue integrals by the absolute Jacobian; for the absolute Jacobian is .
Measure of a degenerate interval: a one-dimensional box with equal endpoints has Lebesgue measure .
Proof
Put and . By [F1] and [F2], the positive mixture half contributes . Applying [F3] to reflection and shows that the reflected half contributes . On , ; on , . The singleton at zero has Lebesgue measure zero by [F4]. Hence .
The identity in step 1.1 holds for every Borel set . Its integrand is nonnegative and measurable; thus every Lebesgue-null Borel set has zero measure, and the displayed function is the claimed Radon–Nikodym density.
Finite independent Laplace noise has product density
Statement
Assume Countable Choice. For and a finite integer , the finite product probability law on has Lebesgue density
where . Its coordinate projections are independent and each has law .
Statement references
Facts & Assumptions
Given: , a finite integer , and the finite product conventions in the Statement.
Countable Choice is inherited from the one-dimensional exponential/Laplace density construction; no stronger choice principle is used here.
One-dimensional density: has density .
Finite product sigma-algebra is generated by measurable rectangles.
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.
Tonelli's theorem permits repeated integration of nonnegative product-measurable functions over the finite product.
Density measure: integrating a nonnegative measurable function over events defines a measure.
Measure uniqueness identifies sigma-finite measures that agree on a generating pi-system under its stated hypotheses.
Independent random elements are random elements whose generated sigma-algebras are independent.
The exponential addition formula gives for all real ; repeated application combines any finite sum in the exponent.
Proof
Define ; the equality factoring the exponential of a finite sum uses [F8]. The function is nonnegative and product-measurable. Repeated application of [F4] gives , using [F1] for each one-dimensional integral. By [F5], is therefore a probability measure.
For a measurable rectangle , repeated Tonelli integration [F4] gives . 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 on the entire product sigma-algebra. Taking unrestricted factors equal to 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].
Laplace mechanism
Definition
Assume Countable Choice. Let be the finite-support count functions on a nonempty record universe, with neighbors formed by adding or removing one record occurrence. Input a database , a finite-dimensional query with finite global sensitivity , and a parameter . If , draw from the finite product law and release . If , release deterministically. The output space is with its Borel sigma-algebra. Equivalently, for each Borel event , the output kernel is when , and when .
Definition references
Facts & Assumptions
Given: A database , finite integer , measurable query , finite , and .
Database domain has the power-set sigma-algebra, so every function out of is measurable.
Countable Choice is assumed through the real-valued Laplace law supplier; the finite product adds no stronger choice requirement.
Global sensitivity is a finite attained maximum over the add/remove neighboring pairs.
Laplace law is a probability measure on for every scale .
Finite products of probability kernels are probability kernels and have the rectangle product law.
Borel sigma-algebra on is the output measurable structure; translations are homeomorphisms and carry Borel sets to Borel sets.
Continuous maps between Borel spaces are measurable; the inverse translation therefore pulls Borel sets back to Borel sets.
Probability-kernel conditions require probability-measure sections and measurable evaluation at each output event.
Verification
By [F2], is finite and nonnegative, so the zero and positive branches cover every allowed input; if , the scale is positive. By [A1], [F3], and [F4], the noise vector has a probability law . For each database , define the output law as the pushforward of under ; the inverse translation is continuous, so [F7] makes the preimage of every Borel set Borel and this is a probability measure.
If , assign the point mass at , which is a probability measure on the Borel output space. For either branch and each Borel event , the evaluation is measurable because every subset of the database domain is measurable by [F1]. Thus the assignment is a probability kernel as required by [F6].
Laplace mechanism privacy
Statement
Assume Countable Choice. For every finite-dimensional query with and finite global sensitivity, and every , the Laplace mechanism is -differentially private under add/remove adjacency.
Statement references
Facts & Assumptions
Given: , a finite-dimensional query , finite sensitivity , , neighboring databases , and a Borel output event .
Countable Choice is inherited through the real Laplace probability law; no stronger choice principle is used.
Sensitivity is the maximum of , where .
Laplace mechanism uses scale when , and releases deterministically when sensitivity is zero.
Product density is for .
Translation change of variables preserves Lebesgue integrals because its Jacobian has absolute value one.
Differential privacy is the event inequality for every ordered neighboring pair and every output event.
The exponential addition formula, strict monotonicity, and positivity and the reciprocal identity give , make increasing, and give for real .
Proof
Suppose and put . By [F2]–[F4], the output law at database has Lebesgue density , since [F4] translates the product noise density from [F3] by .
For every , coordinatewise triangle inequalities give . The densities in [F3] are positive, and [F6] gives for real . Therefore , where the inequality uses monotonicity from [F6]. Interchanging proves the reverse pointwise ratio bound; integrating both bounds over yields the two event inequalities.
If , [F1] forces for every neighboring pair, hence . The deterministic output laws are identical, so both event inequalities hold with (and ). Combining this case with step 2.1 and applying [F5] proves the result.
Exponential-mechanism utility sensitivity
Definition
Let be the finite-support count functions on a nonempty record universe, with add/remove-one-occurrence adjacency. Let be a nonempty finite set independent of the database, and let be a real-valued utility. When the set of adjacent-pair utility differences has an attained finite maximum, the global utility sensitivity of is
The sensitivity is positive when ; the exponential mechanism on this page uses that positive-sensitivity case.
Exponential mechanism
Definition
Let be the finite-support count functions on a nonempty record universe, with add/remove-one-occurrence adjacency. Input a database , a parameter , a nonempty finite database-independent range , and a real-valued utility with finite positive global utility sensitivity . For each , set Output with probability . Equip with its power-set sigma-algebra and define for each ; this is the probability kernel from databases to outputs.
Definition references
Facts & Assumptions
Given: , a nonempty finite set , a real-valued utility , and a finite sensitivity .
Utility sensitivity is the attained finite maximum of adjacent-pair score differences over the database-independent finite range.
The real exponential is finite on every real input, and exponential positivity gives strictly positive values.
Probability measure means a measure of total mass one.
The database domain has the power-set sigma-algebra.
Probability kernel means each section is a probability measure and each event evaluation is measurable in the source.
Verification
Since and each score is real, [F2] makes every weight finite and positive. The nonempty finite sum is therefore finite and strictly positive. For , define . This is nonnegative, equals one on , and is countably additive because a disjoint family of subsets of finite has only finitely many nonempty members. Thus each section is a probability measure by [F3].
For every , 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.
Exponential mechanism privacy and utility
Statement
Let be the set of finite-support record-count databases, with neighbors defined by adding or removing one record occurrence. Let be a nonempty finite set independent of the database, and let be a real-valued utility with finite positive attained global utility sensitivity . For , use weights and normalize them over as in the exponential mechanism. Its output law is -differentially private. For a fixed database , let For every , if denotes the random output, then
Statement references
Facts & Assumptions
Given: A nonempty finite database-independent range , utility , , , neighboring databases , and .
Exponential mechanism assigns weight , normalizer , and output mass .
Utility sensitivity gives for every neighboring pair and every .
Finiteness and nonemptiness of make attained and .
Differential privacy requires the event inequality for both ordered directions of every neighboring pair.
Natural logarithm and its inverse/exponential laws give for .
The exponential addition formula, strict monotonicity, and positivity and the reciprocal identity give , make increasing, and give for real .
Proof
For every , [F2] and monotonicity and addition for from [F6] give ; summing gives . Applying the same argument with interchanged gives . Since the weights and normalizers are positive, [F6] then yields . Interchanging gives the reverse point-mass bound. Summing over any event gives both event inequalities, so [F4] proves privacy.
By [F3], the maximizing set is nonempty and its elements each have weight . Let be the event in the Statement. For each , its defining score inequality, monotonicity and addition for from [F6], and [F5] imply . There are at most such elements, while the normalizer is at least the sum of the maximizing weights, namely . Therefore the probability of is at most . If is empty its probability is zero and the same bound holds.
Differential privacy inequality for bounded measurable functions
Statement
Let and be probability measures on a measurable space. Suppose , , and for every measurable set . Then every measurable function with satisfies
Statement references
Facts & Assumptions
Given: Probability measures , , , the event inequality in the Statement, and a measurable with .
Expectation is integration against the probability measure.
Simple integrals are the finite sums for disjoint measurable and .
Monotone convergence passes increasing nonnegative functions through each integral.
Proof
For each integer , put and define . Each is a measurable simple function and . Every level counted at stage contributes the two levels and at stage , so . The largest dyadic level not exceeding any fixed differs from by less than , so .
Apply the given event inequality to the level sets in step 1.1 and use [F3] on disjoint simple representations. Partition the range into for and . Then , while each level set is the disjoint union of . Rearranging these finite sums gives . This holds for every .
Let in step 2.1. By [F4] and step 1.1, both nonnegative integrals converge to the corresponding integrals of , so .
Differential privacy is preserved under randomized postprocessing
Statement
Let and . Let be an -differentially private probability kernel from databases to a measurable space , and let be a data-independent probability kernel from to a measurable space . Then the composed kernel is -differentially private.
Statement references
Facts & Assumptions
Given: An -differentially private probability kernel and a data-independent probability kernel .
Differential privacy means for every ordered neighboring pair and every measurable event.
Probability kernels have measurable event evaluations with probability-measure sections.
Bounded-function extension: the one-sided event inequality for probability measures extends to every measurable with the same parameters.
Kernel composition is .
Kernel composition theorem ensures the displayed composition is a probability kernel.
Proof
Fix ordered neighboring databases and an event in the output sigma-algebra of . The function is measurable and takes values in by [F2].
Apply [F3] to the event inequality for and with this . Then [F4] identifies the two integrals with and , giving . The pair and event were arbitrary, and [F5] makes a probability kernel, so [F1] proves the claim.
Pure differential privacy bounds relative entropy
Statement
Assume the Axiom of Choice. Let and be probability measures on a measurable space measurably isomorphic to a Polish space, and let . If
for every measurable set , then their Kullback–Leibler divergence satisfies
Statement references
Facts & Assumptions
Given: AC, probability measures on a standard-Borel space, , and both event inequalities in the Statement.
Axiom of Choice is assumed by the Radon–Nikodym density and KL suppliers used below.
Standard-Borel space is a measurable space of the stated standard-Borel class.
Radon–Nikodym theorem: for finite probability measures with , there is a measurable density with for every measurable .
Integration against a density: if , then integrating a nonnegative measurable function against equals integrating its product with against , whenever defined.
KL divergence uses when , and assigns otherwise.
KL nonnegativity gives for probability measures under AC.
Exponential monotonicity, exponential positivity and reciprocals, and the natural-logarithm reciprocal law imply , , and for .
Borel composition preserves measurability; in particular the reciprocal map on makes measurable on the set where .
Proof
The standard-Borel hypotheses are explicit as required by [F1]. Since for every measurable , . Choose a Radon–Nikodym density using [A1] and [F2].
By [F6], and . The inequality forces -almost everywhere: otherwise some set has positive -measure and violates the inequality after integration. Similarly forces -almost everywhere, since any positive-measure set where violates that inequality. Thus almost everywhere.
Let , , , and . Since , the set maximizes this difference and gives its negative. Hence . The event inequalities on and give and , respectively. Adding yields , so .
The lower bound in step 2.1 makes and equivalent. Define on and on its null complement; [F7] makes it measurable. By [F3], for every measurable , so . The logarithm reciprocal identity in [F6] gives almost everywhere, and both log densities are bounded in absolute value by ; [F4] therefore gives finite divergences and . By [F5], , and step 3.1 gives . Therefore .
Approximate-DP kernels admit a nearby pure-DP kernel on standard-Borel targets
Statement
Assume AC. Let and be measurable spaces measurably isomorphic to Polish spaces, let be a probability measure on , and let be probability kernels from to . Let and . Suppose that for -almost every , both inequalities
hold for every measurable . Then there is a probability kernel from to such that for -almost every and every measurable ,
and
where over measurable events.
Statement references
Facts & Assumptions
Given: AC, standard-Borel spaces , probability measure , probability kernels , , , and the two event inequalities for -almost every and every measurable event.
Axiom of Choice is assumed by the jointly measurable RN-kernel and countable-algebra suppliers.
Standard-Borel spaces are measurable spaces in the stated standard-Borel class.
Probability kernels have probability-measure sections and measurable event evaluations.
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.
Countable determining algebra: a standard-Borel target has a countable algebra generating its sigma-algebra and determining finite measures.
Kernel integration measurability: integrating a nonnegative product-measurable function against a probability kernel gives a measurable function of the source point.
Density measures: integrating a nonnegative measurable section over events defines a measure.
Measurable sections: every section of a product-measurable function is measurable.
Borel composition preserves measurability; in particular finite-valued replacements and the clipping and correction functions below remain measurable.
At , The exponential is positive and satisfies gives , hence . Then The exponential function is strictly increasing gives for , and the reciprocal identity gives .
Proof
Let , which is a probability kernel by [F2]. For every , implies , so both sections are absolutely continuous with respect to . Apply [F3] twice to obtain jointly measurable densities. Replace any value by 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 and . Let be the countable generating algebra in [F4], containing . Define to be the set of for which, for every , both and hold, and both DP inequalities hold for . By [F2], [F5], and countability of , is measurable. It has full -measure by the joint representation property and the hypothesis. For , [F6] and [F7] make the density integrals finite measures; they agree with and on , so [F4] gives the density representations on every measurable event.
For fixed , put , a finite measure. Let be the measurable sets approximable in -measure by members of . Complements preserve symmetric-difference measure, and proves closure under finite unions. If and , put and , for . The are disjoint and , so countable additivity and finiteness of give . Approximate each of the first sets closely enough that their finite union has arbitrarily small symmetric-difference measure from . Thus is a sigma-algebra containing , so it is the full target sigma-algebra. For any measurable , choose with . Then both and , so the two inequalities on pass to every measurable .
Write and by [F9]. On , set , , and . These quantities are finite and measurable in by [F5] and [F8]. The sets and are measurable by [F7]. Step 2.1 and the density identities give and . Also , so . Hence .
Define a corrected density on as follows. If , let and . Its denominator is positive and because , so and . If , let and . Here and because , so and . If , set . These formulas are product-measurable by [F8], and in every case and . Set off and define . By [F5], this is measurable in for each ; for each it is a probability measure by [F6] and the normalization, and for it equals the probability measure . Thus is a probability kernel. For , integrate and use the density representation of L to obtain the claimed two-sided pure-DP inequalities.
For , clipping changes by total integral , while correction moves in one direction and changes its integral by . Thus . For probability densities with equal integral, : every event integral is bounded by the positive-part integral and attains it. Hence on . This TV function is measurable: applying the approximation argument of step 2.1 to shows its supremum may be taken over , whose kernel evaluations are measurable. Since is conull, integration proves the asserted bound.
Basic adaptive composition
Statement
Let be the finite-support count functions on a nonempty record universe, with neighbors formed by adding or removing one record occurrence. Let and let be measurable output spaces. For each round , let be a probability kernel on for every database and prior transcript . Suppose that for every neighboring pair , every prior transcript , and every measurable event ,
where and . If , then the full transcript is -differentially private on the finite product sigma-algebra.
Statement references
Facts & Assumptions
Given: The finite sequence of history-dependent probability kernels, common neighboring-database relation, and the conditional event inequalities in the Statement.
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.
Probability kernels have measurable event evaluations and probability-measure sections.
Finite product sigma-algebra is generated by measurable rectangles.
Sections of product-measurable sets are measurable.
Kernel integration measurability: integrating a nonnegative product-measurable function against a probability kernel gives a measurable function of the history.
Bounded-function extension: a prefix event inequality extends to every measurable function with values in with the same additive error.
Kernel composition uses iterated integration.
Composed probability kernels remain probability kernels and their event values are the iterated integrals.
The exponential addition formula gives for all real .
Proof
Put and . For fixed and , define for measurable . By [F4], is measurable; taking sections preserves the whole space, complements, and countable disjoint unions, so is a probability measure by [F2]. By [F5], is measurable, so is a probability kernel. Starting with the point mass on , compose these kernels using [F7]–[F8] to obtain transcript laws with . 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.
Write and , with . We prove by induction that for every measurable ; it is equality at the one-point prefix . Suppose it holds at , fix an event , and put and . By [F2], [F4], and [F5], these are measurable and lie in . The round- event inequality and imply , because for . Let ; it is measurable and -valued. Integrating first against , applying [F6] to the induction hypothesis, then using and [F9] with , gives . The same argument with interchanged proves the reverse ordered inequality. At , [F1] gives the asserted differential-privacy guarantee.
Advanced adaptive composition for standard-Borel outputs
Statement
Assume AC. Let be the finite-support count functions on a nonempty record universe, with neighbors formed by adding or removing one record occurrence. Let , let each round output space and each finite transcript-prefix space be a measurable space measurably isomorphic to a Polish space, and let be the probability kernel for round conditional on prior transcript . Suppose that for every , every , every , and every measurable round- event ,
where and . If and , then the finite-product full transcript is -differentially private, where
Statement references
Facts & Assumptions
Given: AC, adaptive rounds with -private conditional kernels for every history, standard-Borel output and finite-prefix spaces, and with .
Axiom of Choice is assumed by the RN, path-law, conditional-KL, and Azuma suppliers.
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.
Finite products of standard-Borel spaces remain standard Borel.
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.
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.
Pure-DP KL bound: if two probability laws satisfy both pure event inequalities, then , where ; the same holds with reversed.
Kernel purification: under AC, an pair of kernels has a pure- replacement within integrated total variation under any supplied history probability.
Conditional KL is the integral of the fiberwise KL divergence; Conditional KL is measurable for supplied kernels makes its integrand measurable.
Conditional expectation is characterized by measurability and equality of integrals over every event in the conditioning sigma-algebra.
Azuma–Hoeffding: if martingale differences have history-measurable interval bounds of length , then the upper tail at is at most .
Bounded-function extension applied in both directions converts an event bound with and additive error into for every measurable .
RN integration identity recovers integration against a measure by multiplying by its density.
Kernel integration measurability and Every section of a product-measurable function is measurable make the history-section probabilities and their integrals measurable.
Natural logarithm is the inverse of the positive real exponential and is defined on the positive likelihood ratios used below.
Expectation is integration against the path probability law; bounded privacy-loss variables are integrable.
The logarithm product law gives for positive .
Proof
Fix neighboring databases . By [F2], every finite history space is standard Borel. To apply the infinite-sequence form of [F3], append after round a singleton output space and its unique probability kernel at every later round. The first coordinates of the resulting path law have exactly the desired finite transcript law; do this for and to obtain and . Event evaluations of these laws are measurable in the database by [F1].
We first prove the one-sided estimate from to . Set equal to the point mass on the empty history. Recursively, after constructing the modified -transcript prefix law , apply [F6] to the round- pair with base history law . This gives a probability kernel that is pure relative to in both event directions for -almost every , with . Composing the finite modified sequence by [F3] gives a law and its prefix laws .
The prefix laws and are mutually absolutely continuous for each . They agree at the empty history. If they are equivalent at , then for a product-measurable event with , the iterated integral formula [F3] gives for -almost every , hence for -almost every . The pure reverse inequality from step 1.2 gives , so . Reversing the two kernels proves the converse; induction gives prefix equivalence.
For each , apply [F4] with base measure to obtain a jointly measurable density of with respect to on one common conull history set. The pure event inequalities imply almost surely there: if either bound failed on a positive-measure fiber set, some level set separated from that bound by would contradict one event inequality. Clip everywhere to ; Borel composition preserves measurability, the density is unchanged on the conull set, and is jointly measurable with .
We prove the density formula by induction on prefix length. At the first round, [F4] gives . Suppose is the density on the first outputs. For a measurable event on the first outputs, [F3] gives . For almost every , [F4] replaces the inner integral by . Applying [F11] to the outer prefix integral with density yields . This proves the induction and hence . Since every factor is positive and bounded, [F15] gives almost surely under both laws.
Put . By the density formula and KL definition, for -almost every , using [F5]. It is measurable by [F7] and [F12]. For every measurable prefix event , the iterated-prefix identity [F3] gives . Thus [F8] identifies as the conditional expectation of given the previous transcript. By [F14], the variables are integrable, so is a martingale. Each increment lies in the history-measurable interval , of length .
If , every , so and the pure transcript has zero privacy loss. If , apply [F9] to step 4.2 with and . It gives . Since almost surely, the privacy loss exceeds with probability at most . For any event , split it into and ; the density formula in step 4.1 bounds the first probability by and the second by . Thus . Applying the same argument under with the roles reversed gives , because the conditional kernels are pure in both directions and [F5] bounds both KL orientations.
We compare and in total variation. For , let be the transcript law that uses the modified kernels for rounds and the original kernels for rounds . Consecutive laws share the modified prefix through round , whose law is , and differ only in the round- kernel; after that round they use the same continuation kernels. For any final event, integrating that common continuation gives a measurable conditional probability in by [F12]. The two-sided test-function bound [F10] and the integrated TV bound in step 1.2 yield . The triangle inequality gives , hence . Combining with step 5.1 proves .
Repeat steps 1.2–6.1 with as the modified side and as the reference side. This gives . The ordered pair and event were arbitrary, so [F1] proves the stated differential-privacy guarantee. The condition keeps the additive parameter in its declared nontrivial range; no step weakens the claimed epsilon.
Approximate privacy admits purification of a joint measure with fixed history marginal
Statement
Assume AC. Let be arbitrary measurable spaces, let be a probability measure on , and let be probability kernels from to . Suppose , , and, for every and every measurable , Define probability measures on the product sigma-algebra by There is a probability measure on whose marginal is , such that, as inequalities of measures, Here . No countability or topological condition is imposed on either measurable space.
Statement references
Facts & Assumptions
Given: AC, arbitrary measurable , probability , probability kernels , and the pointwise two-directional event bounds in the Statement.
AC is assumed for ordinary Radon–Nikodym derivatives of finite measures; the whole space is a common finite exhaustion.
Probability kernels, measurable sections, and kernel integration measurability apply on the arbitrary product sigma-algebra.
A nonnegative density defines a measure. Monotone convergence extends identities for indicator integrals first to simple functions and then to nonnegative measurable functions.
Borel composition preserves measurability of the finite scalar clipping and correction formulas below.
At , The exponential is positive and satisfies gives , hence . Then The exponential function is strictly increasing gives for , and the reciprocal identity gives .
Proof
By [F1], the integrands defining are measurable. Countable additivity follows by applying monotone convergence to disjoint sections, and total mass is one. The same argument gives , where is the explicit mixture probability kernel and the notation denotes the displayed iterated integral. Both have marginal . By [A1], choose a density of relative to . The inequality forces this density into almost everywhere: a positive-measure level set violating a bound would contradict that measure inequality. Clip it into and call the result ; put . Thus are finite nonnegative product-measurable densities of relative to . The indicator identities extend to nonnegative integrands by [F2].
Write by [F4]. Let and , both product-measurable. For every measurable history event , apply the assumed event inequality to for , and integrate. The density identities give . Similarly . Define and . These are finite measurable functions. Localization over all implies and almost everywhere, since a violating positive-measure level set could be used for . Likewise, the common history marginals imply for -almost every , by equality of their integrals over every . Let 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.
Put and . On , and . If , set ; if , set ; if , set . Every used denominator is strictly positive and its fraction lies in . These formulas give and on . Off , set . All formulas are measurable by [F1] and [F3]; each division is confined to its stated measurable branch. In particular, when , and on , so no zero denominator is used.
Define . By [F2] this is a measure. The conditional normalization on and the fact that is -null imply , so is a probability measure with the required marginal. Integrating gives . On , clipping changes by conditional absolute integral , and the correction changes in one direction by conditional absolute integral . Consequently . Because have equal total integral, the positive and negative parts of have the same integral; every event integral lies between these two extrema, attained by its sign sets. Thus . This proves all claims, including and .
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 .
Advanced adaptive composition on arbitrary measurable output spaces
Statement
Assume AC. Let 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 , let be arbitrary measurable output spaces, and let round be a probability kernel on , measurable in the previous transcript for each database . Suppose that for every ordered neighboring pair , every , every , and every measurable , where and . If and , then the full transcript, on the finite product sigma-algebra, is -differentially private, where
Statement references
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.
AC supplies ordinary RN derivatives of finite measures and is assumed by the concentration supplier below.
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 , whose sigma-algebra is the power set.
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.
Joint-measure purification produces, for any supplied history probability , a probability with that marginal, , and under the two pointwise event inequalities.
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.
The bounded-test-function extension implies for measurable whenever .
Conditional expectation is characterized by equality of integrals over all conditioning events.
Azuma–Hoeffding bounds the upper tail of a martingale with increment interval lengths by .
Borel composition preserves scalar measurability. Logarithm laws and the integral formula apply to positive likelihood ratios. In particular for : integrate from to when , and integrate from to with a minus sign when .
At , The exponential is positive and satisfies gives , hence . Then The exponential function is strictly increasing gives for , and the reciprocal identity gives .
Proof
Fix an ordered neighboring pair , and abbreviate the two round kernels by . Let and . For any probability on , the formula defines a probability on : 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 , finite recursion constructs the original prefix laws and . 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.
Set . Given , form and . Apply [F3] with history law to obtain a probability on with marginal , , and , where by [F9]. The hypotheses hold at every history, hence also under the modified history law. These are measures only; no conditional kernel for is required. Finite iteration yields consistent prefix marginals of the final probability . Moreover [F5], applied to , gives . Thus the triangle inequality and induction give .
By [A1] choose a product-measurable density . The measure bounds in step 2.1 force 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 as a function on , with . We prove by induction. If , then for any nonnegative measurable on , [F2] and [F4] give . The base is the common point mass. Hence is the asserted density and is everywhere positive and finite. In particular for the measurable prefix variables , each in .
Define measurable functions on by and . They are finite by the bounds in step 3.1. Because and have the same history marginal , their density identity on gives for every , so almost everywhere under . On this conull set, gives . Therefore . For every , , by separately checking and . Thus almost everywhere. This scalar conditional calculation supplies the entropy bound without a fiberwise RN identity.
Work on with the filtration generated by the first coordinates. For any measurable history event , consistency of marginals, the density identity for relative to , and the iterated-integral formula give . Hence is a version of by [F6]. It is bounded, as are the , so is an integrable martingale. Its th increment lies in the -measurable interval , whose length is .
If , all , so and the desired one-sided bound follows from step 2.1 with error . If , put . Applying [F7] with interval lengths gives . Step 4.1 bounds , so . Set . For every transcript event , split at and use the density from step 3.1 to obtain . Then step 2.1 gives .
The preceding construction applies to every ordered neighboring pair. In particular repeat it with interchanged, constructing a new modified measure on that side, to get . This proves differential privacy by [F1]. The proof includes , , and equality ; 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.
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 , let round be a probability kernel on the th arbitrary measurable output space, conditional on every prior transcript . Suppose that for every ordered neighboring pair , every , and every measurable round- event ,
where and . If , the full transcript on the finite product sigma-algebra is -differentially private. Also, assuming AC, if every conditional round has the same parameters with and , then for any with , advanced composition on arbitrary measurable output spaces gives parameters , where
Statement references
Facts & Assumptions
Given: The finite adaptive kernels and conditional event inequalities on arbitrary measurable output spaces in the Statement; AC for the advanced clause.
AC is assumed for the ordinary Radon–Nikodym and concentration suppliers used only by the advanced clause.
Differential privacy is the event inequality for every ordered neighboring pair.
Basic adaptive composition applies to arbitrary measurable output spaces and heterogeneous parameters, with additive sums of epsilon and delta.
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
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.
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 and additive error , which gives the advanced clause by [F1].
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
- Cynthia Dwork and Aaron Roth, The Algorithmic Foundations of Differential Privacy
- Salil Vadhan, The Complexity of Differential Privacy, 2017 manuscript
- Dwork and Roth, The Algorithmic Foundations of Differential Privacy, Lemma 3.17 and Theorem 3.20
- Dwork and Roth, The Algorithmic Foundations of Differential Privacy, Theorem 3.20
- Vadhan, The Complexity of Differential Privacy, Lemma 2.4 and Claim 2.5