Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sharpness.

Proved
FHENoise.NoiseCkt.sqChain_noise_eq_iterD

by raver1975 · Sep 17, 2026 · Mathlib c5ea003 (Lean v4.30.0)

aether-catalogcryptography

Sharpness. Over ℤ (expansion factor γ = 1), with a relinearization that adds exactly k ≥ 0 to the phase and an input of phase b ≥ 0, the noise of the depth-d squaring circuit equals the iterate iterD 1 k d b exactly. Hence the master bound of NoiseGrowth, and with it the dichotomy above, is tight and not an artefact of the estimates.

theorem FHENoise.NoiseCkt.sqChain_noise_eq_iterD(s b k : ℤ) (hb : 0 ≤ b) (hk : 0 ≤ k) :
    ∀ d, noise intGauge s
        ((sqChain d).evalEnc (fun c => c + Polynomial.C k) (fun _ => Polynomial.C b))
      = iterD 1 (k : ℝ) d (b : ℝ) := by sorry

Formalization Note Transplanted verbatim from the Aether Catalog source Cryptography/FHE/NoiseDichotomy.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.

Preamble
-- Thm stub generated from Cryptography/FHE/NoiseDichotomy.lean
import Mathlib
import Definitions.Def_Cryptography_FHE_NoiseDichotomy
import Definitions.Def_Cryptography_FHE_NoiseGauge
import Definitions.Def_Cryptography_FHE_NoiseGrowth

/-!
# The bootstrapping dichotomy: when is a levelled FHE scheme noise-stable?

Homomorphic multiplication followed by relinearization transforms the
(normalized) noise level `x` by the quadratic map

`noiseStep γ D x = γ · x² + D`,

where `γ ≥ 1` is the ring expansion factor and `D ≥ 0` is the key-switching
noise surcharge.  Everything about unbounded-depth evaluation is governed by the
orbit structure of this one-dimensional quadratic dynamical system, and the
governing quantity is the discriminant `1 - 4γD`.

## Main results

* `noiseStep_dichotomy` — **the dichotomy**: an invariant noise budget exists
  (i.e. `∃ Q ≥ 0, γQ² + D ≤ Q`) **iff** `4γD ≤ 1`.  There is no middle ground.
* `iterD_le_of_invariant` — inside the stable regime the noise never leaves the
  invariant interval, at *any* multiplicative depth: no bootstrapping needed.
* `noiseFixedPoint_spec` — the explicit stable budget
  `Q = (1 - √(1 - 4γD)) / (2γ)`, an exact fixed point, with `Q ≤ 1/(2γ)`.
* `iterD_ge_linear` and `exists_depth_exceeding` — **bootstrapping necessity**:
  when `4γD > 1` the noise grows at least linearly with slope
  `c = D - 1/(4γ) > 0`, so *every* decryption radius is exceeded after finitely
  many levels, and an explicit depth bound is given.
* `sqChain_noise_eq_iterD` — sharpness: over `ℤ` the recursion is *attained*, so
  the dichotomy is not an artefact of lossy bounding.
* `unbounded_depth_correct` / `bootstrap_needed_at_depth` — the two sides of the
  dichotomy transported back to statements about decrypting circuits.
-/

open FHENoise

-- open removed: section is not a namespace

noncomputable section

/-! ## 1. The quadratic noise map and its orbits -/







/-! ## 2. The stable regime -/





/-! ## 3. The unstable regime -/





/-! ## 3b. Convergence of the stable orbit -/



/-! ## 4. Sharpness: the recursion is attained over `ℤ` -/

open NoiseCkt
Formal statement
theorem FHENoise.NoiseCkt.sqChain_noise_eq_iterD(s b k : ℤ) (hb : 0 ≤ b) (hk : 0 ≤ k) :
    ∀ d, noise intGauge s
        ((sqChain d).evalEnc (fun c => c + Polynomial.C k) (fun _ => Polynomial.C b))
      = iterD 1 (k : ℝ) d (b : ℝ) := by sorry
Source
https://github.com/paulklemstine/Lean/blob/53c2925a02/Catalog/Cryptography/FHE/NoiseDichotomy.lean#L254

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me