Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The truncated reciprocal distance kernel

Definition
LL_Decomp1543c_minK

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

For real X,θX,\thetaX,θ, K(X,θ)=XK(X,\theta)=XK(X,θ)=X if ∥θ∥=0\|\theta\|=0∥θ∥=0, and K(X,θ)=min⁡(X,1/(2∥θ∥))K(X,\theta)=\min(X,1/(2\|\theta\|))K(X,θ)=min(X,1/(2∥θ∥)) otherwise.

Definition code
import Mathlib
import Definitions.Def_LL_Decomp1543c_nint

namespace LL_Decomp1543c

open Real Finset ArithmeticFunction

noncomputable def minK (X θ : ℝ) : ℝ := if nint θ = 0 then X else min X (1 / (2 * nint θ))

end LL_Decomp1543c
Read-back

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

For real numbers XXX and θ\thetaθ, minK(X,θ)\mathrm{minK}(X,\theta)minK(X,θ) is a real number defined by cases on n=nint(θ)n=\mathrm{nint}(\theta)n=nint(θ). The function nint\mathrm{nint}nint is imported from another item whose definition is not shown here, and the code uses nnn as a real number, so its exact type and any cast are not visible in this item.

  • If n=0n=0n=0, then minK(X,θ)=X\mathrm{minK}(X,\theta)=XminK(X,θ)=X.
  • If n≠0n\neq 0n=0, then minK(X,θ)=min⁡{X, 12n}\mathrm{minK}(X,\theta)=\min\left\{X,\ \dfrac{1}{2n}\right\}minK(X,θ)=min{X, 2n1​}, the smaller of XXX and 12n\dfrac{1}{2n}2n1​.

No hypotheses are assumed, so XXX and θ\thetaθ range over all reals, including negative values and zero. The division by 2n2n2n occurs only when n≠0n\neq 0n=0, so no division-by-zero junk value appears. When n=0n=0n=0 the bound 12n\dfrac{1}{2n}2n1​ is dropped entirely, so the result is XXX with no cap. When n<0n<0n<0 the bound 12n\dfrac{1}{2n}2n1​ is negative and can be the minimum. The definition is total, so nothing is vacuous.

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