AFTD Auto-Formalizing Theoretical Domains

IsTestFunction.pi

theoremverifiedformalizationimported Lean

IsTestFunction.pi

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Module in
variable
  {X} [NormedAddCommGroup X] [NormedSpace ℝ X]
  {U} [NormedAddCommGroup U] [NormedSpace ℝ U]
  {V'} [NormedAddCommGroup V'] [NormedSpace ℝ V'] in
open ContDiff InnerProductSpace MeasureTheory in
@[fun_prop]
lemma IsTestFunction.pi {ι} [Fintype ι] {φ : X → ι → U} (hφ : ∀ i, IsTestFunction (φ · i)) :
    IsTestFunction (fun x i => φ x i)
Formalizes
Physlib, `IsTestFunction.pi`
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 IsTestFunction.pi
--- Physlib/Mathematics/VariationalCalculus/IsTestFunction.lean:78 (IsTestFunction.pi)
+++ as compiled here
@@ -1 +1,9 @@
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+open Module in
+variable
+  {X} [NormedAddCommGroup X] [NormedSpace ℝ X]
+  {U} [NormedAddCommGroup U] [NormedSpace ℝ U]
+  {V'} [NormedAddCommGroup V'] [NormedSpace ℝ V'] in
+open ContDiff InnerProductSpace MeasureTheory in
 @[fun_prop]
Verified
09 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • IsTestFunctionA test function is a smooth function with compact support.
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Module invariable  {X} [NormedAddCommGroup X] [NormedSpace ℝ X]  {U} [NormedAddCommGroup U] [NormedSpace ℝ U]  {V'} [NormedAddCommGroup V'] [NormedSpace ℝ V'] inopen ContDiff InnerProductSpace MeasureTheory in@[fun_prop]lemma IsTestFunction.pi {ι} [Fintype ι] {φ : X → ι → U} (hφ : ∀ i, IsTestFunction (φ · i)) :    IsTestFunction (fun x i => φ x i) where  smooth := contDiff_pi' (fun i => (hφ i).smooth)  supp := by    let K : ι → Set X := fun i =>      Classical.choose (exists_compact_iff_hasCompactSupport.mpr (hφ i).supp)    have hK (i : ι) := Classical.choose_spec (exists_compact_iff_hasCompactSupport.mpr (hφ i).supp)    refine exists_compact_iff_hasCompactSupport.mp      ⟨⋃ i, K i, isCompact_iUnion (fun i => (hK i).1), fun x hx => ?_⟩    simp at hx    conv_lhs =>      enter [i]      rw [(hK i).2 x (hx i)]    rfl
See it in the graphDiscuss this resultChallenge it