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.

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.

Depends on

Used by

Dependency tree · two levels

35 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