Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Inner product-constrained interval

Definition
LL_Decomp1543a_mRange

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

For real c,Uc,Uc,U and natural N,tN,tN,t, define M(c,N,U,t)={m∈N:1≤m≤N, cN<mt≤N, U<m}\mathcal M(c,N,U,t)=\{m\in\mathbb N:1\le m\le N,\ cN<mt\le N,\ U<m\}M(c,N,U,t)={m∈N:1≤m≤N, cN<mt≤N, U<m}.

Definition code
import Mathlib

open Real Finset ArithmeticFunction

namespace LL_Decomp1543a
noncomputable def mRange (c : ℝ) (N : ℕ) (U : ℝ) (t : ℕ) : Finset ℕ :=
  (Icc 1 N).filter (fun m => c * N < ((m * t : ℕ) : ℝ) ∧ m * t ≤ N ∧ U < m)
end LL_Decomp1543a
Read-back

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

For real ccc, natural NNN, real UUU and natural ttt, mRange(c,N,U,t)\mathrm{mRange}(c,N,U,t)mRange(c,N,U,t) is the finite set of natural numbers mmm with 1≤m≤N1 \le m \le N1≤m≤N, cN<mtcN < mtcN<mt, mt≤Nmt \le Nmt≤N, and U<mU < mU<m. The product mtmtmt is formed in N\mathbb{N}N and then viewed as a real in the condition cN<mtcN < mtcN<mt, while mt≤Nmt \le Nmt≤N is a natural-number inequality and U<mU < mU<m compares the real UUU with mmm viewed as a real. No hypothesis restricts ccc, NNN, UUU or ttt. If N=0N=0N=0 the set is empty. If t=0t=0t=0 then mt=0mt=0mt=0, so the set is {m:1≤m≤N, U<m}\{m : 1 \le m \le N,\ U < m\}{m:1≤m≤N, U<m} when cN<0cN < 0cN<0 and empty otherwise. If t≥1t \ge 1t≥1, the condition mt≤Nmt \le Nmt≤N already forces m≤N/tm \le N/tm≤N/t. If U<1U < 1U<1, the condition U<mU < mU<m holds for every m≥1m \ge 1m≥1. The output is a set of natural numbers, not a count.

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