AFTD Auto-Formalizing Theoretical Domains

IsLocalizedFunctionTransform.add

theoremverifiedformalizationimported Lean

IsLocalizedFunctionTransform.add

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.add {V'} [NormedAddCommGroup V'] {F G : (X → U) → (Y → V')}
    (hF : IsLocalizedFunctionTransform F) (hG : IsLocalizedFunctionTransform G) :
    IsLocalizedFunctionTransform (fun φ => F φ + G φ)
Formalizes
Physlib, `IsLocalizedFunctionTransform.add`
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.add
--- Physlib/Mathematics/VariationalCalculus/IsLocalizedfunctionTransform.lean:84 (IsLocalizedFunctionTransform.add)
+++ as compiled here
@@ -1,2 +1,12 @@
-lemma add {V} [NormedAddCommGroup V] {F 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.add {V'} [NormedAddCommGroup V'] {F G : (X → U) → (Y → V')}
     (hF : IsLocalizedFunctionTransform F) (hG : IsLocalizedFunctionTransform G) :
Verified
09 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2

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.add {V'} [NormedAddCommGroup V'] {F G : (X → U) → (Y → V')}    (hF : IsLocalizedFunctionTransform F) (hG : IsLocalizedFunctionTransform G) :    IsLocalizedFunctionTransform (fun φ => F φ + G φ) := by  intro K cK  obtain ⟨L,cL,h⟩ := hF K cK  obtain ⟨L',cL',h'⟩ := hG K cK  use L ∪ L'  constructor  · exact cL.union cL'  · intro φ φ' hφ    have hL : ∀ x ∈ L, φ x = φ' x := by      intro x hx; apply hφ; simp_all    have hL' : ∀ x ∈ L', φ x = φ' x := by      intro x hx; apply hφ; simp_all    simp +contextual (disch:=assumption) [h φ φ', h' φ φ']
See it in the graphDiscuss this resultChallenge it