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.

Laplace mechanism privacy

Statement

Assume Countable Choice. For every finite-dimensional query f:D→Rd with d≥1 and finite global L1 sensitivity, and every ε>0, the Laplace mechanism is (ε,0)-differentially private under add/remove adjacency.

Facts & Assumptions

Given: d≥1, a finite-dimensional query f, finite sensitivity Δ1f, ε>0, neighboring databases D∼D′, and a Borel output event A⊆Rd.

[A1]

Countable Choice is inherited through the real Laplace probability law; no stronger choice principle is used.

[F1]

Sensitivity is the maximum of ∥f(D)−f(D′)∥1, where ∥x∥1=∑j=1d∣xj∣.

[F2]

Laplace mechanism uses scale b=Δ1f/ε when Δ1f>0, and releases f(D) deterministically when sensitivity is zero.

[F3]

Product density is (2b)−dexp⁡(−∥z∥1/b) for b>0.

[F4]

Translation change of variables preserves Lebesgue integrals because its Jacobian has absolute value one.

[F5]

Differential privacy is the event inequality for every ordered neighboring pair and every output event.

[F6]

The exponential addition formula, strict monotonicity, and positivity and the reciprocal identity give exp⁡(u+v)=exp⁡(u)exp⁡(v), make exp⁡ increasing, and give exp⁡(−u)=1/exp⁡(u)>0 for real u,v.

Proof

1.1A1F2F3F4givenconstruct

Suppose Δ1f>0 and put b=Δ1f/ε. By [F2]–[F4], the output law at database D has Lebesgue density pD(x)=(2b)−dexp⁡(−∥x−f(D)∥1/b), since [F4] translates the product noise density from [F3] by f(D).

2.1F1F6step 1.1givenalgebra

For every x∈Rd, coordinatewise triangle inequalities give ∥x−f(D′)∥1−∥x−f(D)∥1≤∥f(D)−f(D′)∥1≤Δ1f. The densities in [F3] are positive, and [F6] gives exp⁡(−u)/exp⁡(−v)=exp⁡(v−u) for real u,v. Therefore pD(x)/pD′(x)=exp⁡((∥x−f(D′)∥1−∥x−f(D)∥1)/b)≤exp⁡(Δ1f/b)=eε, where the inequality uses monotonicity from [F6]. Interchanging D,D′ proves the reverse pointwise ratio bound; integrating both bounds over A yields the two event inequalities.

3.1F1F2F5step 2.1algebra∎

If Δ1f=0, [F1] forces ∥f(D)−f(D′)∥1=0 for every neighboring pair, hence f(D)=f(D′). The deterministic output laws are identical, so both event inequalities hold with δ=0 (and ε≥0). Combining this case with step 2.1 and applying [F5] proves the result.

Depends on

Used by

Dependency tree · two levels

49 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