Covariance Under Continuous Linear Equivalences
ProvedFunctionalInequalities.Covariance.operator_map_continuousLinearEquiv_readableThis describes covariance under a continuous linear equivalence.
Let and be real inner-product spaces with Borel measurable structures, assume the required completeness and second-countability conditions on , let be a finite measure on , and let
be a continuous linear equivalence. Then the covariance operator of the pushforward measure satisfies
No finite-second-moment assumption is required: when the relevant second moment is absent, the covariance operators are zero by the underlying convention.
The result is the operator conjugation law used for linear changes of variables.
Original Lean declaration header
Within namespace FunctionalInequalities. Shown in its original module context. Proof omitted.
theorem Covariance.operator_map_continuousLinearEquiv
(ν : Measure V₁) [IsFiniteMeasure ν] (T : V₁ ≃L[ℝ] V₂) :
Covariance.operator (ν.map T) =
((T : V₁ →L[ℝ] V₂).comp (Covariance.operator ν)).comp (T : V₁ →L[ℝ] V₂).adjoint
Module navigation
Module: Probability/Transport.
Definition modules: Probability/Covariance/Basic.
Previous: Probability.tilted_smul_pos · Next: Probability.affineSupport_mapContinuousLinearEquiv.
Source excerpt, lines 296–299 · Frozen source 408915f.
import Definitions.Def_KLSModular_FunctionalInequalities_Probability_Transport
open MeasureTheory Filter Topology InnerProductSpace
universe u v
variable {V₁ : Type u} [NormedAddCommGroup V₁] [InnerProductSpace ℝ V₁]
[MeasurableSpace V₁] [BorelSpace V₁]
variable {V₂ : Type v} [NormedAddCommGroup V₂] [InnerProductSpace ℝ V₂]
[MeasurableSpace V₂] [BorelSpace V₂]
variable [CompleteSpace V₁] [SecondCountableTopology V₁] [CompleteSpace V₂] [SecondCountableTopology V₂]
omit [SecondCountableTopology V₁]
theorem FunctionalInequalities.Covariance.operator_map_continuousLinearEquiv_readable
(ν : Measure V₁) [IsFiniteMeasure ν] (T : V₁ ≃L[ℝ] V₂) :
Covariance.operator (ν.map T) =
((T : V₁ →L[ℝ] V₂).comp (Covariance.operator ν)).comp (T : V₁ →L[ℝ] V₂).adjoint := by sorry