Finite dyadic block
DefinitionLL_Decomp1543a_tBlockFor natural and real , define .
Definition code
import Mathlib open Real Finset ArithmeticFunction namespace LL_Decomp1543a noncomputable def tBlock (N : ℕ) (M : ℝ) : Finset ℕ := (Icc 1 N).filter (fun t => M < t ∧ (t : ℝ) ≤ 2 * M) end LL_Decomp1543a
Read-back
What the Lean code literally says, in plain math · claude-haiku
Let and . The definition is the finite set of natural numbers satisfying three conditions: (natural-number inequalities, so the set is empty when ), (strict, with viewed as a real number), and (non-strict, in ). Written out:
No division or natural-number subtraction occurs, so there are no junk values. The set is empty whenever , and whenever , which covers every , including all negative . For it consists of the integers in the interval that also lie in . The lower bound always excludes . The definition has no hypotheses, so no statement is vacuous, and it is defined for every pair .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.