Affine Transport of Subgradient Images
ProvedFunctionalInequalities.Analysis.subgradientImage_comp_affineEquiv_symm_readableThis establishes the affine transport law for subgradient images.
Let be a finite-dimensional real inner-product space, let , let be an affine equivalence, and let . If is the linear part of , then
The image on the right is the set image under the adjoint of the inverse linear part. The declaration is subgradientImage_comp_affineEquiv_symm_readable; it is an exact set equality and does not involve volume or determinant factors.
Original Lean declaration header
Within namespace FunctionalInequalities.Analysis. Shown in its original module context. Proof omitted.
theorem subgradientImage_comp_affineEquiv_symm (u : E → ℝ) (e : E ≃ᵃ[ℝ] E) (G : Set E) :
subgradientImage (u ∘ e.symm) (e '' G) =
(LinearMap.adjoint (e.linear.symm : E →ₗ[ℝ] E)) '' subgradientImage u G
Module navigation
Module: Analysis/Convex/Alexandrov.
Definition modules: Analysis/Convex/Subgradient.
Previous: infDist_frontier_le_of_forall_inner_le · Next: volume_subgradientImage_comp_affineEquiv_symm.
Source excerpt, lines 1774–1776 · Frozen source 408915f.
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_Convex_Alexandrov
variable {E : Type*}
variable [NormedAddCommGroup E]
variable [InnerProductSpace ℝ E] [FiniteDimensional ℝ E]
theorem FunctionalInequalities.Analysis.subgradientImage_comp_affineEquiv_symm_readable (u : E → ℝ) (e : E ≃ᵃ[ℝ] E) (G : Set E) :
subgradientImage (u ∘ e.symm) (e '' G) =
(LinearMap.adjoint (e.linear.symm : E →ₗ[ℝ] E)) '' subgradientImage u G := by sorry