Nat.segment_galois_connection
theoremverifiedformalizationimported Lean
For a strictly monotonic function f : ℕ → ℕ with f 0 = 0, f and segment f form a Galois connection.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Function Set in variable {f : ℕ → ℕ} in theorem Nat.segment_galois_connection (hm : StrictMono f) (h0 : f 0 = 0) : GaloisConnection f (segment f)
- Formalizes
- CSLib, `Nat.segment_galois_connection`
- Lean proof
- By Ching-Tsun Chou, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2025 Ching-Tsun Chou. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.Nat.segment_galois_connection← Nat.segment_galois_connection (Cslib/Foundations/Data/Nat/Segment.lean:178): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- Nat.segment_upper_boundFor a strictly monotonic function
f : ℕ → ℕwithf 0 = 0,k < f (segment f k + 1)for allk : ℕ. - Nat.segment_lower_boundFor a strictly monotonic function
f : ℕ → ℕwithf 0 = 0,f (segment f k) ≤ kfor allk : ℕ. - Nat.segmentThe
f-segment ofk, wheref : ℕ → ℕwill be assumed to be at least StrictMono. - Nat.segment_idemFor a strictly monotonic function
f : ℕ → ℕ, the segment off kisk.
- Nat.segment_upper_boundFor a strictly monotonic function
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Function Set invariable {f : ℕ → ℕ} in/-- For a strictly monotonic function `f : ℕ → ℕ` with `f 0 = 0`, `f` and `segment f` form a Galois connection. -/theorem Nat.segment_galois_connection (hm : StrictMono f) (h0 : f 0 = 0) : GaloisConnection f (segment f) := by intro m k; constructor · intro h by_contra! h_con have h1 : segment f k + 1 ≤ m := by omega have := (StrictMono.le_iff_le hm).mpr h1 have := segment_upper_bound hm h0 k omega · intro h by_contra! h_con have := (StrictMono.le_iff_le hm).mpr h have := segment_lower_bound hm h0 k omega