Threshold form of the concatenated error:
ProvedKLZ97.levelError_eq_threshold_powThe level- failure parameter rewritten so that the threshold is visible: for ,
The combination is the quantity that must be less than for concatenation to help, which is the threshold condition of the paper's analysis.
import Mathlib import Definitions.Def_KLZ97_model
namespace KLZ97
theorem levelError_eq_threshold_pow (f p : ℝ) (hf : f ≠ 0) (h : ℕ) :
levelError f p h = (f * p) ^ (2 ^ h) / f := 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 with , and every natural number , the quantity defined by the recursion , satisfies
The exponent is a natural number and the division is ordinary real division, legitimate because is assumed. At the right-hand side is .
The only hypothesis is . In particular may be negative, is arbitrary, and no inequality between and — no threshold condition — is assumed; the claim is an exact identity valid on the whole of its domain.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.