Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

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.

Depends on

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