Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

An integer-affine function nonnegative everywhere has zero slope

Proved
Smooth4Algebra.integer_affine_nonnegative

by ryanshin · Sep 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

orderedalgebrarealanalysis

Let a,b∈Ra,b\in\mathbb Ra,b∈R. If

a+nb≥0for every n∈Z,a+nb\ge0\qquad\text{for every }n\in\mathbb Z,a+nb≥0for every n∈Z,

then b=0b=0b=0.

This is the elementary all-integer affine-rigidity step used in the norm-invariance discussion. It does not assert the topology, the Laurent factorization, or the Alexander-polynomial theorem.

Preamble
import Mathlib.Algebra.Order.Archimedean.Basic
import Mathlib.Data.Real.Basic
set_option autoImplicit false
Formal statement
theorem Smooth4Algebra.integer_affine_nonnegative
    (a b : ℝ) (h : ∀ n : ℤ, 0 ≤ a + (n : ℝ) * b) : b = 0 := by sorry
Source
Newly authored from cycle7_band_twist_theory.md, norm-invariance/affine nonnegativity discussion; SHA-256 e81d47cad862e6538d0997826a67a43c367fd4096fd62119714e70def075e8b3. This is a new Lean formalization, not an existing source-project theorem split.
Read-back

What the Lean code literally says, in plain math · Codex independent blind auditor; exact model identifier unavailable

For every pair of real numbers a,ba,ba,b, if 0≤a+nb0\leq a+nb0≤a+nb for every integer nnn, where nnn is regarded as a real number in the expression, then b=0b=0b=0. The quantified integers include zero and all positive and negative integers; in particular the hypothesis at n=0n=0n=0 requires a≥0a\geq0a≥0, and there is no assumption that either aaa or bbb is nonzero.

Human review
  • Endorsed by Shuze Chen · Sep 6, 2026

  • Endorsed by ryanshin · Sep 6, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me