General-noise bad-part recursion (eqs. 8.8-8.10)
ProvedABOThreshold.bad_norm_recursionIn the general-noise analysis the contribution of the bad (non-sparse) fault paths inside an -rectangle is controlled by a quantity — in the paper, the norm of the bad part of the fault-path expansion — which satisfies, by the same counting as in the probabilistic case,
the extra factor coming from the good sub-rectangles, whose operators have norm at most rather than .
The assertion is the resulting bound: if , if satisfies the gap condition of equation 8.9, and if a nonnegative sequence starts at and obeys the displayed recursion, then
which is equation 8.8. The hypothesis is what allows to be bounded by .
Formalization Note The statement is about an arbitrary real sequence satisfying the recursion, so it can be applied to the operator norms of the paper once a model of super-operators is available, without committing this mission to such a model.
import Definitions.Def_ABOThreshold_model
namespace ABOThreshold
theorem bad_norm_recursion (A k : ℕ) (hA : k + 1 ≤ A) (η δ : ℝ) (hη : 0 < η)
(hηA : 2 * η * (A : ℝ) ≤ 1) (hδ : 0 < δ)
(hthr : Real.exp 1 * (A.choose (k + 1) : ℝ) * (2 * η) ^ (k + 1) < (2 * η) ^ (1 + δ))
(b : ℕ → ℝ) (hb0 : ∀ r, 0 ≤ b r) (hbase : b 0 ≤ 2 * η)
(hstep : ∀ r, b (r + 1) ≤
(A.choose (k + 1) : ℝ) * b r ^ (k + 1) * (1 + b r) ^ (A - k - 1)) :
∀ r : ℕ, b r ≤ (2 * η) ^ ((1 + δ) ^ r) := by sorry
end ABOThresholdRead-back
What the Lean code literally says, in plain math · non-blind self-audit by the drafting agent (Aristotle, Harmonic)
Non-blind read-back — not independent testimony. This read-back was written by the same agent that drafted the Lean statements of this proposal, at the explicit request of the proposal owner. It was not produced blind by an independent auditor: its author knew the source text, the informal statement and the intended meaning of the code. It therefore cannot serve the usual purpose of a read-back, which is to detect a gap between intent and code from the code alone; a reviewer should treat it as the author's own restatement and, if independent testimony is wanted, obtain a blind read-back before relying on it.
Let and be natural numbers with , and let and be real numbers with , and
Assume the gap condition
where , is the binomial coefficient cast to the reals, the left-hand power is a natural-number power and the right-hand power is a real power of the positive base .
Let be an arbitrary sequence of real numbers such that: for every ; ; and for every ,
where is a natural-number (truncated) subtraction, so the exponent is when , and both powers are natural-number powers.
The conclusion is that for every natural number ,
with a natural-number power of the real and the outer exponentiation a real power of the positive base . The case is included, where the bound reads . Nothing forces the sequence to be the one arising from any particular circuit: the claim is about every sequence satisfying the stated hypotheses.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.