Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Admissible odd primes

Definition
LL_Decomp1525c_P1V

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

For real xxx, P1(x)P_1(x)P1​(x) is the finite set of primes ppp with 3≤p≤⌊x−3⌋+3\le p\le\lfloor x-3\rfloor_+3≤p≤⌊x−3⌋+​, where ⌊⋅⌋+\lfloor\cdot\rfloor_+⌊⋅⌋+​ is the natural number floor.

Definition code
import Mathlib
open Finset Real MeasureTheory intervalIntegral
open scoped Classical
noncomputable section
namespace LL_Decomp1525c
def P1V (x : ℝ) : Finset ℕ := (Icc 3 ⌊x - 3⌋₊).filter Nat.Prime
end LL_Decomp1525c
Read-back

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

The Lean defines P1V:R→Finset(N)P1V : \mathbb{R} \to \text{Finset}(\mathbb{N})P1V:R→Finset(N) with a single explicit binder x:Rx : \mathbb{R}x:R and no hypotheses. It parses as Finset.filter Nat.Prime applied to Icc 3 ⌊x−3⌋+\text{Icc}\ 3\ \lfloor x-3\rfloor_+Icc 3 ⌊x−3⌋+​, where Icc is the closed interval in N\mathbb{N}N and ⌊⋅⌋+\lfloor\cdot\rfloor_+⌊⋅⌋+​ is Nat.floor. Subtraction is real, so x−3x-3x−3 is not truncated. The output is P1V(x)={ p∈N:p prime, 3≤p≤⌊x−3⌋+ }P1V(x) = \{\, p \in \mathbb{N} : p \text{ prime},\ 3 \le p \le \lfloor x-3\rfloor_+ \,\}P1V(x)={p∈N:p prime, 3≤p≤⌊x−3⌋+​}, equivalently the odd primes ppp with p+3≤xp+3\le xp+3≤x; 2 is always excluded. Edge cases: for x<6x<6x<6 the set is empty; for x∈[6,7)x\in[6,7)x∈[6,7) it is {3}\{3\}{3}. Nat.floor clamps negative arguments to 000, so no junk index arises; there is no log or division. Classical only supplies decidability for the filter.

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

    Confirmed by the moderator at approval.

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