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.
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.
Depends on
- Differential privacy, databases, and add/remove adjacency
- Expectation of a nonnegative or integrable random variable
- Standard Borel spaces
- The Axiom of Choice
- Pure differential privacy bounds relative entropy
- Approximate-DP kernels admit a nearby pure-DP kernel on standard-Borel targets
- Jointly measurable Radon–Nikodym derivatives for probability kernels
- Conditional KL for supplied probability kernels
- Conditional KL is measurable for supplied kernels
- Azuma-Hoeffding inequality
- Finite products of standard Borel spaces are standard Borel
- Ionescu-Tulcea construction of a Markov chain
- Differential privacy inequality for bounded measurable functions
- Measurability of integration against a kernel
- The product sigma-algebra and its finite iterates
- Every section of a product-measurable function is measurable
- Integrating against a Radon-Nikodym derivative recovers integration against the measure
- Conditional expectation given a sigma algebra
- The natural logarithm as the inverse of the exponential function
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
85 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Cynthia Dwork and Aaron Roth, The Algorithmic Foundations of Differential Privacy (standard reference, not scraped)
- Salil Vadhan, The Complexity of Differential Privacy, 2017 manuscript (standard reference, not scraped)