AFTD Auto-Formalizing Theoretical Domains

IsLocalizedFunctionTransform.comp

theoremverifiedformalizationimported Lean

IsLocalizedFunctionTransform.comp

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open InnerProductSpace MeasureTheory ContDiff in
variable
  {X} [NormedAddCommGroup X]
  {Y} [NormedAddCommGroup Y]
  {Z} [NormedAddCommGroup Z]
  {U}
  {V'}
  {W} in
lemma IsLocalizedFunctionTransform.comp {F : (Y → V') → (Z → W)} {G : (X → U) → (Y → V')}
    (hF : IsLocalizedFunctionTransform F) (hG : IsLocalizedFunctionTransform G) :
    IsLocalizedFunctionTransform (F ∘ G)
Formalizes
Physlib, `IsLocalizedFunctionTransform.comp`
Lean proof
By Tomas Skrivan, Joseph Tooby-Smith, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2025 Tomas Skrivan. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.
What was changed in IsLocalizedFunctionTransform.comp
--- Physlib/Mathematics/VariationalCalculus/IsLocalizedfunctionTransform.lean:50 (IsLocalizedFunctionTransform.comp)
+++ as compiled here
@@ -1,2 +1,12 @@
-lemma comp {F : (Y → V) → (Z → W)} {G : (X → U) → (Y → V)}
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+open InnerProductSpace MeasureTheory ContDiff in
+variable
+  {X} [NormedAddCommGroup X]
+  {Y} [NormedAddCommGroup Y]
+  {Z} [NormedAddCommGroup Z]
+  {U}
+  {V'}
+  {W} in
+lemma IsLocalizedFunctionTransform.comp {F : (Y → V') → (Z → W)} {G : (X → U) → (Y → V')}
     (hF : IsLocalizedFunctionTransform F) (hG : IsLocalizedFunctionTransform G) :
Verified
09 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • IsLocalizedFunctionTransformFunction transformation F is localizable if the values of the transformed function F φ on some compact set K can depend only on the…
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen InnerProductSpace MeasureTheory ContDiff invariable  {X} [NormedAddCommGroup X]  {Y} [NormedAddCommGroup Y]  {Z} [NormedAddCommGroup Z]  {U}  {V'}  {W} inlemma IsLocalizedFunctionTransform.comp {F : (Y → V') → (Z → W)} {G : (X → U) → (Y → V')}    (hF : IsLocalizedFunctionTransform F) (hG : IsLocalizedFunctionTransform G) :    IsLocalizedFunctionTransform (F ∘ G) := by  intro K cK  obtain ⟨K', cK', h'⟩ := hF K cK  obtain ⟨K'', cK'', h''⟩ := hG K' cK'  use K''  constructor  · exact cK''  · intro φ φ' hφ    apply h' _ _ (fun _ hx' => h'' _ _ hφ _ hx')
See it in the graphDiscuss this resultChallenge it