Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Even integers of a dyadic block

Definition
LL_Decomp1526a_evenBlock

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

For real XXX, the finite set of even natural numbers NNN with ⌊X⌋<N≤⌊2X⌋\lfloor X\rfloor<N\le\lfloor 2X\rfloor⌊X⌋<N≤⌊2X⌋.

Definition code
import Mathlib

namespace LL_Decomp1526a

noncomputable section

open Finset Real
open scoped Chebyshev Classical

def evenBlock (X : ℝ) : Finset ℕ := (Ioc ⌊X⌋₊ ⌊2 * X⌋₊).filter Even

end

end LL_Decomp1526a
Read-back

What the Lean code literally says, in plain math · claude-haiku

Read-back: evenBlock

For each real number XXX, the declaration defines a finite set E(X)E(X)E(X) of natural numbers. A natural number nnn belongs to E(X)E(X)E(X) if and only if it satisfies both conditions below:

⌊X⌋<n≤⌊2X⌋,n is even.\lfloor X \rfloor < n \le \lfloor 2X \rfloor, \qquad n \text{ is even}.⌊X⌋<n≤⌊2X⌋,n is even.

Here ⌊⋅⌋\lfloor \cdot \rfloor⌊⋅⌋ is the floor function, with values truncated at 000: for X≥0X \ge 0X≥0 it is the greatest integer not exceeding XXX, and for X<0X < 0X<0 it equals 000. "Even" means n=2kn = 2kn=2k for some natural number kkk. The left inequality is strict, so 000 is never included.

The declaration has one input, XXX, and no hypotheses on it.

Degenerate cases:

  • If X<0X < 0X<0, both floors equal 000, so no nnn satisfies 0<n≤00 < n \le 00<n≤0, and E(X)=∅E(X) = \varnothingE(X)=∅.
  • If 0≤X<120 \le X < \tfrac{1}{2}0≤X<21​, then ⌊X⌋=⌊2X⌋=0\lfloor X \rfloor = \lfloor 2X \rfloor = 0⌊X⌋=⌊2X⌋=0, and E(X)=∅E(X) = \varnothingE(X)=∅.
  • If X≥0X \ge 0X≥0, then E(X)E(X)E(X) is the set of even integers in (⌊X⌋,⌊2X⌋](\lfloor X \rfloor, \lfloor 2X \rfloor](⌊X⌋,⌊2X⌋]. This set is empty whenever that interval contains no even integer, for example when ⌊2X⌋=⌊X⌋\lfloor 2X \rfloor = \lfloor X \rfloor⌊2X⌋=⌊X⌋, or when ⌊2X⌋=⌊X⌋+1\lfloor 2X \rfloor = \lfloor X \rfloor + 1⌊2X⌋=⌊X⌋+1 and ⌊X⌋\lfloor X \rfloor⌊X⌋ is even.

The declaration is a definition, not a theorem, so it asserts no claim that could be true or false.

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

    Confirmed by the moderator at approval.

  • Endorsed by sthubbar · Oct 30, 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