AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.ProgressiveL2Truncation
8 named declarations scanned from AutoSamplingTheory/TechnicalLemmas/StochasticProcesses/ProgressiveL2Truncation.lean.
Declarations
def AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.ProgressiveL2Truncation.clipProcess Partial Not mapped
- Pointwise clipping of a stochastic process.
def clipProcess (n : ℕ) (eta : ℝ≥0 → Omega → ℝ) : ℝ≥0 → Omega → ℝ :=
fun t omega => clipNat n (eta t omega)
AutoSamplingTheory/TechnicalLemmas/StochasticProcesses/ProgressiveL2Truncation.lean:26published source at ed709a7f320d
theorem AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.ProgressiveL2Truncation.clipProcess_stronglyProgressive Partial Not mapped
No declaration docstring.
theorem clipProcess_stronglyProgressive
(eta : ProgressiveL2Integrand filtration mu T) (n : ℕ) :
IsStronglyProgressive filtration (clipProcess n eta.process) := by
intro t
exact stronglyMeasurable_clipNat (eta.progressive t) n
AutoSamplingTheory/TechnicalLemmas/StochasticProcesses/ProgressiveL2Truncation.lean:29published source at ed709a7f320d
theorem AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.ProgressiveL2Truncation.processFunction_clipProcess Partial Not mapped
No declaration docstring.
theorem processFunction_clipProcess
(eta : ℝ≥0 → Omega → ℝ) (n : ℕ) :
processFunction (clipProcess n eta) =
fun z => clipNat n (processFunction eta z) :=
rfl
AutoSamplingTheory/TechnicalLemmas/StochasticProcesses/ProgressiveL2Truncation.lean:35published source at ed709a7f320d
theorem AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.ProgressiveL2Truncation.clipProcess_memLp Partial Not mapped
No declaration docstring.
theorem clipProcess_memLp
(eta : ProgressiveL2Integrand filtration mu T) (n : ℕ) :
MemLp (processFunction (clipProcess n eta.process)) 2
(processTimeMeasure mu T) := by
rw [processFunction_clipProcess]
exact clipNat_memLp eta.memLp n
/-- Clipping as an endomorphism of the progressive `L2` integrand domain. -/
AutoSamplingTheory/TechnicalLemmas/StochasticProcesses/ProgressiveL2Truncation.lean:41published source at ed709a7f320d
def AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.ProgressiveL2Truncation.clipped Partial Compiled
- Clipping as an endomorphism of the progressive `L2` integrand domain.
noncomputable def clipped
(eta : ProgressiveL2Integrand filtration mu T) (n : ℕ) :
ProgressiveL2Integrand filtration mu T where
process := clipProcess n eta.process
progressive := clipProcess_stronglyProgressive eta n
memLp := clipProcess_memLp eta n
AutoSamplingTheory/TechnicalLemmas/StochasticProcesses/ProgressiveL2Truncation.lean:49published source at ed709a7f320dOpen detailed card
theorem AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.ProgressiveL2Truncation.clipped_process Partial Not mapped
No declaration docstring.
@[simp] theorem clipped_process
(eta : ProgressiveL2Integrand filtration mu T) (n : ℕ) :
(clipped eta n).process = clipProcess n eta.process :=
rfl
AutoSamplingTheory/TechnicalLemmas/StochasticProcesses/ProgressiveL2Truncation.lean:56published source at ed709a7f320d
theorem AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.ProgressiveL2Truncation.clipped_abs_le Partial Not mapped
No declaration docstring.
theorem clipped_abs_le
(eta : ProgressiveL2Integrand filtration mu T) (n : ℕ)
(t : ℝ≥0) (omega : Omega) :
|(clipped eta n).process t omega| ≤ (n : ℝ) :=
abs_clipNat_le n _
/-- Bounded progressive truncations converge to the original integrand in
the actual product-space `Lp` object. -/
AutoSamplingTheory/TechnicalLemmas/StochasticProcesses/ProgressiveL2Truncation.lean:61published source at ed709a7f320d
theorem AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.ProgressiveL2Truncation.tendsto_clipped_toLp Partial Not mapped
- Bounded progressive truncations converge to the original integrand in the actual product-space `Lp` object.
theorem tendsto_clipped_toLp
(eta : ProgressiveL2Integrand filtration mu T) :
Tendsto (fun n => (clipped eta n).toLp) atTop (𝓝 eta.toLp) := by
simpa [ProgressiveL2Integrand.toLp, clipped, processFunction_clipProcess] using
(tendsto_clipNat_toLp eta.memLp)
end ProgressiveL2Truncation
end StochasticProcesses
end TechnicalLemmas
end AutoSamplingTheory
AutoSamplingTheory/TechnicalLemmas/StochasticProcesses/ProgressiveL2Truncation.lean:69published source at ed709a7f320dOpen detailed card
Complete Lean source
AutoSamplingTheory/TechnicalLemmas/StochasticProcesses/ProgressiveL2Truncation.lean — full module with imports and context
import AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.CoefficientTruncation
import AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.ProgressiveL2
/-!
# Truncation in the progressive L2 domain
Pointwise clipping preserves strong progressiveness and square integrability.
The resulting bounded progressive processes converge to the original process
in the product-space `L2` norm.
-/
namespace AutoSamplingTheory
namespace TechnicalLemmas
namespace StochasticProcesses
namespace ProgressiveL2Truncation
open Filter MeasureTheory
open scoped NNReal Topology
open CoefficientTruncation ElementaryItoIntegral ProgressiveL2
variable {Omega : Type*} {m : MeasurableSpace Omega}
{filtration : Filtration ℝ≥0 m} {mu : Measure Omega} {T : ℝ≥0}
/-- Pointwise clipping of a stochastic process. -/
def clipProcess (n : ℕ) (eta : ℝ≥0 → Omega → ℝ) : ℝ≥0 → Omega → ℝ :=
fun t omega => clipNat n (eta t omega)
theorem clipProcess_stronglyProgressive
(eta : ProgressiveL2Integrand filtration mu T) (n : ℕ) :
IsStronglyProgressive filtration (clipProcess n eta.process) := by
intro t
exact stronglyMeasurable_clipNat (eta.progressive t) n
theorem processFunction_clipProcess
(eta : ℝ≥0 → Omega → ℝ) (n : ℕ) :
processFunction (clipProcess n eta) =
fun z => clipNat n (processFunction eta z) :=
rfl
theorem clipProcess_memLp
(eta : ProgressiveL2Integrand filtration mu T) (n : ℕ) :
MemLp (processFunction (clipProcess n eta.process)) 2
(processTimeMeasure mu T) := by
rw [processFunction_clipProcess]
exact clipNat_memLp eta.memLp n
/-- Clipping as an endomorphism of the progressive `L2` integrand domain. -/
noncomputable def clipped
(eta : ProgressiveL2Integrand filtration mu T) (n : ℕ) :
ProgressiveL2Integrand filtration mu T where
process := clipProcess n eta.process
progressive := clipProcess_stronglyProgressive eta n
memLp := clipProcess_memLp eta n
@[simp] theorem clipped_process
(eta : ProgressiveL2Integrand filtration mu T) (n : ℕ) :
(clipped eta n).process = clipProcess n eta.process :=
rfl
theorem clipped_abs_le
(eta : ProgressiveL2Integrand filtration mu T) (n : ℕ)
(t : ℝ≥0) (omega : Omega) :
|(clipped eta n).process t omega| ≤ (n : ℝ) :=
abs_clipNat_le n _
/-- Bounded progressive truncations converge to the original integrand in
the actual product-space `Lp` object. -/
theorem tendsto_clipped_toLp
(eta : ProgressiveL2Integrand filtration mu T) :
Tendsto (fun n => (clipped eta n).toLp) atTop (𝓝 eta.toLp) := by
simpa [ProgressiveL2Integrand.toLp, clipped, processFunction_clipProcess] using
(tendsto_clipNat_toLp eta.memLp)
end ProgressiveL2Truncation
end StochasticProcesses
end TechnicalLemmas
end AutoSamplingTheory