MarkovProcess: continuousPathTrajectory_map_shift
ProvedMarkovProcess.SubMarkovKernelSemigroup.IsFellerKernelSemigroup.continuousPathTrajectory_map_shiftmarkovprocessmarkovprocess-v3j-full
Source-faithful Lean theorem from Scott Armstrong's MarkovProcess formalisation. The exact hypotheses and mathematical conclusion appear in the formal statement.
Preamble
import Definitions.Def_MarkovProcess_V3H_Continuity_DenseTimeContinuousExtension_479df42c
import Definitions.Def_MarkovProcess_V3H_Feller_BackwardC0Integral_1512e54f
import Definitions.Def_MarkovProcess_V3H_FiniteTime_CoordinateProductActiveReduction_0fcd6a29
import Definitions.Def_MarkovProcess_V3H_FiniteTime_FiniteSetKernelCompactTestTransport_3904fd05
import Definitions.Def_MarkovProcess_V3H_FiniteTime_FiniteSetKernelShift_14b03019
import Definitions.Def_MarkovProcess_V3H_FiniteTime_KernelRestriction_041bf9e5
import Definitions.Def_MarkovProcess_V3H_Kernel_FiniteRestrictionIdentification_619c5320
import Definitions.Def_MarkovProcess_V3H_Time_FiniteDenseApproximationOrdered_4fc0c4f5
import Definitions.Def_MarkovProcess_V3H_Trajectory_DenseRestrictionMarginals_931e4c17
import Mathlib.Algebra.Order.Floor.Semiring
import Mathlib.Algebra.Order.Sub.Basic
import Mathlib.Analysis.Normed.Operator.Basic
import Mathlib.Analysis.SpecificLimits.Basic
import Mathlib.Data.Fin.Tuple.Basic
import Mathlib.Data.Finset.Sort
import Mathlib.Data.Fintype.Card
import Mathlib.Data.NNRat.Defs
import Mathlib.Data.NNReal.Defs
import Mathlib.Data.Rat.Cast.Order
import Mathlib.Data.Rat.Encodable
import Mathlib.Logic.Denumerable
import Mathlib.MeasureTheory.Constructions.BorelSpace.Basic
import Mathlib.MeasureTheory.Constructions.Polish.Basic
import Mathlib.MeasureTheory.Constructions.Projective
import Mathlib.MeasureTheory.Function.ConvergenceInMeasure
import Mathlib.MeasureTheory.Integral.BoundedContinuousFunction
import Mathlib.MeasureTheory.Integral.CompactlySupported
import Mathlib.MeasureTheory.Integral.DominatedConvergence
import Mathlib.MeasureTheory.Integral.Lebesgue.Markov
import Mathlib.MeasureTheory.Integral.RieszMarkovKakutani.Real
import Mathlib.MeasureTheory.MeasurableSpace.Constructions
import Mathlib.MeasureTheory.MeasurableSpace.Embedding
import Mathlib.MeasureTheory.Measure.RegularityCompacts
import Mathlib.MeasureTheory.OuterMeasure.BorelCantelli
import Mathlib.Order.Fin.Basic
import Mathlib.Probability.Kernel.Composition.Comp
import Mathlib.Probability.Kernel.Composition.CompProd
import Mathlib.Probability.Kernel.Composition.IntegralCompProd
import Mathlib.Probability.Kernel.Composition.KernelLemmas
import Mathlib.Probability.Kernel.Composition.Lemmas
import Mathlib.Probability.Kernel.Composition.MapComap
import Mathlib.Probability.Kernel.Composition.MeasureComp
import Mathlib.Probability.Kernel.Disintegration.StandardBorel
import Mathlib.Probability.Kernel.IonescuTulcea.Traj
import Mathlib.Probability.Kernel.MeasurableIntegral
import Mathlib.Probability.Process.Filtration
import Mathlib.Probability.Process.Kolmogorov
import Mathlib.Topology.CompactOpen
import Mathlib.Topology.ContinuousMap.CompactlySupported
import Mathlib.Topology.ContinuousMap.SecondCountableSpace
import Mathlib.Topology.ContinuousMap.StoneWeierstrass
import Mathlib.Topology.ContinuousMap.ZeroAtInfty
import Mathlib.Topology.LocallyFinite
import Mathlib.Topology.Order.IsLUB
import Mathlib.Topology.Separation.CompletelyRegular
import Mathlib.Topology.UrysohnsLemma
/-
Copyright (c) 2026 Scott Armstrong. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Armstrong
-/
/-!
# Deterministic shifts of Feller trajectory laws
The canonical continuous trajectory of a conservative Feller kernel semigroup restarts after
every deterministic nonnegative time. The proof identifies all finite coordinates of the dense
restriction and then uses injectivity of dense restriction on continuous-path kernels.
This is an unconditional kernel-law identity. The conditional form is in
`Trajectory/FellerConditional.lean` and the strong Markov property in
`Trajectory/FellerStoppingRestart.lean`; no Hunt-process property is asserted.
-/
open MeasureTheory ProbabilityTheory
open scoped NNReal
namespace MarkovProcess
namespace SubMarkovKernelSemigroup
noncomputable section
open IsConservative
variable {alpha : Type*} [MetricSpace alpha] [CompleteSpace alpha]
[MeasurableSpace alpha] [BorelSpace alpha] [SecondCountableTopology alpha]
[LocallyCompactSpace alpha] [StandardBorelSpace alpha] [Nonempty alpha]
end
end SubMarkovKernelSemigroup
end MarkovProcess
open MarkovProcess
open MarkovProcess.SubMarkovKernelSemigroup
/-
Copyright (c) 2026 Scott Armstrong. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Armstrong
-/
/-!
# Deterministic shifts of Feller trajectory laws
The canonical continuous trajectory of a conservative Feller kernel semigroup restarts after
every deterministic nonnegative time. The proof identifies all finite coordinates of the dense
restriction and then uses injectivity of dense restriction on continuous-path kernels.
This is an unconditional kernel-law identity. The conditional form is in
`Trajectory/FellerConditional.lean` and the strong Markov property in
`Trajectory/FellerStoppingRestart.lean`; no Hunt-process property is asserted.
-/
open MeasureTheory ProbabilityTheory
open scoped NNReal
open IsConservative
variable {alpha : Type*} [MetricSpace alpha] [CompleteSpace alpha]
[MeasurableSpace alpha] [BorelSpace alpha] [SecondCountableTopology alpha]
[LocallyCompactSpace alpha] [StandardBorelSpace alpha] [Nonempty alpha]
open MarkovProcess.SubMarkovKernelSemigroup in
Formal statement
theorem MarkovProcess.SubMarkovKernelSemigroup.IsFellerKernelSemigroup.continuousPathTrajectory_map_shift
(P : SubMarkovKernelSemigroup alpha) (hFeller : P.IsFellerKernelSemigroup)
(hP : P.IsConservative) (default : ContinuousPath alpha)
(hK : ∀ x, ∃ p q gamma : ℝ, ∃ M : ℝ≥0,
IsKolmogorovProcess (fun r omega ↦ omega r)
(denseTimeTrajectory P hP DenseTime.enumeration
DenseTime.castOrderEmbedding.toEmbedding x) p q M ∧
0 < gamma ∧ gamma < (q - 1) / p)
(s : NNReal) :
(continuousPathTrajectory P hP default).map (ContinuousPath.shift s) =
(continuousPathTrajectory P hP default).comp (P s) := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).