Below threshold the concatenated error tends to
ProvedKLZ97.levelError_tendsto_zeroExistence of a threshold, in its asymptotic form: if the physical failure parameter is non-negative and lies below the threshold , that is , then the concatenated failure parameter tends to as the number of concatenation levels tends to infinity. This is the sense in which computation of arbitrary accuracy becomes possible below threshold.
import Mathlib import Definitions.Def_KLZ97_model
namespace KLZ97
theorem levelError_tendsto_zero (f p : ℝ) (hf : 0 < f) (hp : 0 ≤ p) (hfp : f * p < 1) :
Filter.Tendsto (levelError f p) Filter.atTop (nhds 0) := by sorry
end KLZ97Read-back
What the Lean code literally says, in plain math · Aristotle (Harmonic) — non-blind, authored by the drafting agent
Non-blind read-back — not independent testimony. This read-back was written by the same agent that drafted the Lean statement it describes, at the explicit request of the proposal owner, and not by an independent auditor working blind from the code alone. It therefore cannot corroborate the faithfulness of the formalization, and a reviewer should not treat it as independent evidence: it carries exactly the blind spots of the author of the statement.
Let and be real numbers with , and . Consider the sequence , , indexed by natural numbers . The claim is that this sequence converges to as , in the usual topology of : for every neighbourhood of there is an with for all .
The hypotheses are exactly: strict positivity of , non-negativity of , and the strict inequality . They are simultaneously satisfiable — for instance , — so the statement is not vacuous. The boundary case is excluded, and is allowed, in which case the sequence is identically from the start. Nothing is claimed about the rate of convergence, about monotonicity of the sequence, or about what happens when .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.