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.
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.
Depends on
- Exponential mechanism
- Exponential-mechanism utility sensitivity
- Differential privacy, databases, and add/remove adjacency
- The natural logarithm as the inverse of the exponential function
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
- The exponential addition formula $\exp(x+y)=\exp(x)\exp(y)$
- The exponential function is strictly increasing
- The exponential is positive and satisfies $\exp(-x)=1/\exp(x)$
Used by
- Finite-range private selection Example
Dependency tree · two levels
27 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)