Below the threshold condition holds
ProvedABOThreshold.threshold_lt_imp_conditionLet be the maximal number of locations in a rectangle and let be the number of faulty sub-rectangles a rectangle tolerates. The threshold for probabilistic noise is .
The assertion is that every error rate in the range satisfies the threshold condition
This is the sentence "it is easy to see that any satisfies the threshold condition" that follows Definition 20, and it is what licenses using the threshold condition throughout the recursive analysis whenever the error rate is below the threshold.
Formalization Note The paper prints with exponent ; the exponent is used here, since it is the one for which this statement is true and it is what solving the threshold condition gives.
import Definitions.Def_ABOThreshold_model
namespace ABOThreshold
theorem threshold_lt_imp_condition (A k : ℕ) (hk : 1 ≤ k) (η : ℝ) (hη : 0 < η)
(hlt : η < thresholdProb A k) : ThresholdCondition A k η := 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 be a real number with . Write for the natural-number binomial coefficient cast to the reals; it equals when . Suppose
where the right-hand side is the real power of the nonnegative real base with real exponent (so the right-hand side is when , making the hypothesis unsatisfiable in that case, given ).
The conclusion is
with a natural-number power . No upper bound on other than the displayed one is assumed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.