Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

MarkovProcess.Time.DenseTimeApproximationFromAbove

Definition
MarkovProcessModule_MarkovProcess_Time_DenseTimeApproximationFromAbove

by WillR · Oct 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

markovprocessmarkovprocess-module-importscope-mainscott-armstrongsource-faithful

Dense-time approximation from above

Every nonnegative real time is the limit of a strictly decreasing sequence of dense times whose physical values stay strictly above the limit. This includes time zero and times that already belong to the dense carrier; choosing strict upper approximants gives one uniform API for all cuts.

This is deterministic order-topological infrastructure and makes no stochastic-process claim.

Complete pinned Lean module MarkovProcess.Time.DenseTimeApproximationFromAbove by Scott Armstrong (Apache-2.0). Contains the original definitions, instances, theorems and proofs in their original declaration order. Only local MarkovProcess import directives have been rewritten for Prove2Me; source mathematical declarations are unchanged. The bundle must pass Prove2Me's remote compiler before it can be used as a dependency.

Definition code
/-
Copyright (c) 2026 Scott Armstrong. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Armstrong
-/
import Definitions.Def_MarkovProcessModule_MarkovProcess_Continuity_DenseTimeContinuousExtension

/-!
# Dense-time approximation from above

Every nonnegative real time is the limit of a strictly decreasing sequence of dense times whose
physical values stay strictly above the limit. This includes time zero and times that already
belong to the dense carrier; choosing strict upper approximants gives one uniform API for all
cuts.

This is deterministic order-topological infrastructure and makes no stochastic-process claim.
-/

open Filter Topology
open scoped NNReal

namespace MarkovProcess

/-- Every nonnegative real time admits strictly decreasing dense-time approximants whose physical
values remain strictly above it. -/
theorem exists_denseTime_seq_strictAnti_tendsto (s : NNReal) :
    ∃ q : ℕ → DenseTime,
      StrictAnti q ∧
        (∀ n, s < DenseTime.castOrderEmbedding (q n)) ∧
          Tendsto (fun n ↦ DenseTime.castOrderEmbedding (q n)) atTop (nhds s) := by
  obtain ⟨q, hqAnti, hqAbove, hq⟩ :=
    ContinuousPath.denseRange_castOrderEmbedding.exists_seq_strictAnti_tendsto
      DenseTime.castOrderEmbedding.monotone s
  exact ⟨q, hqAnti, fun n ↦ hqAbove n, by
    simpa only [Function.comp_apply] using! hq⟩

end MarkovProcess
Source
https://github.com/scottnarmstrong/MarkovProcess/blob/1f8060caa137731fa08029592019eeaf9d997fe5/MarkovProcess/Time/DenseTimeApproximationFromAbove.lean

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