Closed form of the concatenation recursion:
ProvedKLZ97.levelError_closed_formIterating the one-level reduction for levels of concatenation gives the closed form
where is the failure parameter at concatenation level and is the number of minimal pairs of error locations that can make an encoded gate fail. This is the statement quoted in Section I.F of the paper: after iterations of the concatenation procedure the effective error is .
import Mathlib import Definitions.Def_KLZ97_model
namespace KLZ97
theorem levelError_closed_form (f p : ℝ) (h : ℕ) :
levelError f p h = f ^ (2 ^ h - 1) * p ^ (2 ^ h) := 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.
For every pair of real numbers and and every natural number , the quantity defined by the recursion , satisfies
The two exponents are natural numbers. The exponent is a subtraction of natural numbers; since for every , it never truncates. At the claim reads , and at it reads .
There are no hypotheses of any kind: and are arbitrary reals, and in particular may be zero or negative, and no threshold, smallness or positivity condition is assumed. The claim is an exact identity, not an inequality or an asymptotic statement.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.