Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Size of the even block

Proved
LL_Decomp1526a.card_evenBlock_le

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

number-theory

For every real X≥0X\ge 0X≥0, the number of even natural numbers NNN with ⌊X⌋<N≤⌊2X⌋\lfloor X\rfloor<N\le\lfloor 2X\rfloor⌊X⌋<N≤⌊2X⌋ is at most X/2+1X/2+1X/2+1, as a real number.

Preamble
import Mathlib
import Definitions.Def_LL_Decomp1526a_evenBlock

open Finset Real
open scoped Chebyshev Classical
Formal statement
namespace LL_Decomp1526a
theorem card_evenBlock_le {X : ℝ} (hX : 0 ≤ X) : (#(evenBlock X) : ℝ) ≤ X / 2 + 1 := by sorry
end LL_Decomp1526a
Source
Ramaré 1995, Section 2.3, p. 653, the expected count X/2X/2X/2.
Read-back

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

Read-back: LL_Decomp1526a.card_evenBlock_le

Statement. For every real number XXX with 0≤X0 \le X0≤X, the cardinality of the finite set evenBlock(X)\mathrm{evenBlock}(X)evenBlock(X), read as a real number, is at most X2+1\frac{X}{2} + 12X​+1.

∣evenBlock(X)∣≤X2+1|\mathrm{evenBlock}(X)| \le \frac{X}{2} + 1∣evenBlock(X)∣≤2X​+1

Binders and hypotheses.

  • XXX: a real number, universally quantified.
  • Hypothesis 0≤X0 \le X0≤X. This is the only hypothesis. No other assumption on XXX is made, so XXX need not be an integer.

Objects.

  • ∣ ⋅ ∣|\,\cdot\,|∣⋅∣ is the number of elements of a finite set. The count is compared with X2+1\frac{X}{2} + 12X​+1 as a real number.
  • evenBlock(X)\mathrm{evenBlock}(X)evenBlock(X) is defined in a separate file that this read-back did not expand. Its elements and its dependence on XXX are therefore not described here. The bound is only as explicit as that definition, which an auditor must check separately.

Edge cases.

  • X=0X = 0X=0 is allowed. The bound then reads ∣evenBlock(0)∣≤1|\mathrm{evenBlock}(0)| \le 1∣evenBlock(0)∣≤1.
  • There is no upper limit on XXX.
  • Negative XXX is excluded, and the statement says nothing about it.

Strength. The inequality is non-strict (≤\le≤). The bound is X2\frac{X}{2}2X​ plus a constant 111.

Proof status. The proof is sorry, so the statement is not proved in this file.

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