Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite dyadic block

Definition
LL_Decomp1543a_tBlock

by sthubbar · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

For natural NNN and real MMM, define T(N,M)={t∈N:1≤t≤N, M<t≤2M}T(N,M)=\{t\in\mathbb N:1\le t\le N,\ M<t\le2M\}T(N,M)={t∈N:1≤t≤N, M<t≤2M}.

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 N∈NN \in \mathbb{N}N∈N and M∈RM \in \mathbb{R}M∈R. The definition tBlock⁡(N,M)\operatorname{tBlock}(N, M)tBlock(N,M) is the finite set of natural numbers ttt satisfying three conditions: 1≤t≤N1 \le t \le N1≤t≤N (natural-number inequalities, so the set is empty when N=0N = 0N=0), M<tM < tM<t (strict, with ttt viewed as a real number), and t≤2Mt \le 2Mt≤2M (non-strict, in R\mathbb{R}R). Written out:

tBlock⁡(N,M)={ t∈N:1≤t≤N, M<t≤2M }.\operatorname{tBlock}(N, M) = \{\, t \in \mathbb{N} : 1 \le t \le N,\ M < t \le 2M \,\}.tBlock(N,M)={t∈N:1≤t≤N, M<t≤2M}.

No division or natural-number subtraction occurs, so there are no junk values. The set is empty whenever M≥NM \ge NM≥N, and whenever 2M<12M < 12M<1, which covers every M<1/2M < 1/2M<1/2, including all negative MMM. For M≥1/2M \ge 1/2M≥1/2 it consists of the integers in the interval (M,2M](M, 2M](M,2M] that also lie in {1,…,N}\{1, \dots, N\}{1,…,N}. The lower bound 111 always excludes t=0t = 0t=0. The definition has no hypotheses, so no statement is vacuous, and it is defined for every pair (N,M)(N, M)(N,M).

Human review
  • Endorsed by Shuze Chen · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by sthubbar · Oct 29, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me