Samplinglib
Lean gate not recorded for this source state main · 9bb7a7394ab0

Divergence: mathematical reading route

Read the statements and derivations in source order. Every result has its own optional Lean statement and proof. Source assumptions, library reuse and unproved boundaries are kept explicit.

  1. Define pointwise coordinate divergence
  2. Unfold the coordinate-divergence convention
  3. A supplied Fréchet derivative gives the coordinate trace
  4. Use the canonical Fréchet derivative in the trace formula
  5. The PiLp equivalence preserves coordinate vectors
  6. Differentiate the radial cutoff after PiLp transport
  7. The cutoff-gradient cross term tends to zero in L¹
  8. The cutoff main term converges under integration
  9. Integrable norm tails outside expanding Euclidean balls vanish
  10. The trace of a rank-one derivative term is its scalar evaluation
  11. Transport the raw-coordinate trace to Euclidean divergence
  12. Ignore the box boundary and a countable exceptional set
  13. Pointwise trace transport on an almost-everywhere differentiability set
  14. Obtain the a.e. trace bridge from derivatives off a countable set
  15. Transfer trace integrability to coordinate divergence
  16. The box divergence formula with an explicit a.e. representation bridge
  17. The box divergence formula from trace integrability
  18. Zero normal components make the signed face sum zero
  19. Update-form boundary zeros cancel the face sum
  20. Vanishing outside the open box forces both boundary component zeros
  21. Off-open-box vanishing cancels the signed face sum
  22. Ordinary support containment means zero outside the open box
  23. A smooth compactly supported cutoff at one point of an open box
  24. Pass from closed support to ordinary support
  25. A pointwise cutoff with both support interfaces
  26. A smooth nonnegative function with exactly the open box as nonzero set
  27. Exact ordinary support and nonnegativity give positivity inside the box
  28. Strict outer endpoints enclose a closed inner box
  29. A single smooth plateau on an entire inner closed box
  30. A cutoff at one inner-box point with support in the outer box
  31. Ordinary support inside the open box cancels all face terms
  32. A scalar cutoff zero off the box localizes any vector field
  33. Scalar ordinary support localizes the product field
  34. Scalar closed support localizes the product's ordinary support
  35. Continuity of a scalar times a vector field on the closed box
  36. The pointwise scalar-vector product derivative
  37. Apply the product derivative on a common exceptional-set complement
  38. Continuity of the product-rule trace from exactly its scalar components
  39. Full field continuity implies continuity of the product-rule trace
  40. A continuous product-rule trace is integrable on a closed box
  41. A scalar cutoff zero off the box cancels product-field faces
  42. Scalar ordinary support cancels product-field faces
  43. Scalar topological support cancels product-field faces
  44. A vanishing signed face sum gives zero box divergence integral
  45. Zero inserted-face components give zero box divergence integral
  46. Zero updated-endpoint components give zero box divergence integral
  47. Off-open-box vanishing gives zero box divergence integral
  48. Open-box ordinary support gives zero box divergence integral
  49. Scalar off-box vanishing gives zero product divergence integral
  50. Scalar ordinary support gives zero product divergence integral
  51. Scalar closed support gives zero product divergence integral
  52. Off-box scalar vanishing with separate product regularity gives zero box integral
  53. Off-box scalar vanishing with continuous product trace gives zero box integral
  54. Off-box scalar vanishing with continuous trace components gives zero box integral
  55. Scalar support with separate product regularity gives zero box integral
  56. Scalar support with the canonical vector-field derivative gives zero box integral
  57. Scalar support with continuous product trace gives zero box integral
  58. Scalar support with continuous trace components gives zero box integral
  59. A compactly supported C¹ field has zero whole-space divergence integral
Samplinglib mathematical lesson

Define pointwise coordinate divergence

AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.coordinateDivergence · def · Teaching coverage

Read this first

Mathematical statement

For a finite coordinate set ι, a vector field F:V→V and x∈V, define the coordinate divergence by summing the directional derivative of its i-th component along the i-th coordinate vector. Every summand is totalized: it is zero if that one-dimensional derivative does not exist.

\[\operatorname{Div}F(x):=\sum_{i\in\iota}\operatorname{deriv}_{t=0}\bigl[t\mapsto(F(x+t e_i))_i\bigr],\qquad e_i=\operatorname{single}(i,1).\]
Lean statement · coordinateDivergence

The inferred finite type supplies the index set. `noncomputable def` introduces a real-valued function; it does not assert any derivative exists.

Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

noncomputable def coordinateDivergence
    {ι : Type*} [Fintype ι] [DecidableEq ι]
    (F : EuclideanSpace ℝ ι → EuclideanSpace ℝ ι)
    (x : EuclideanSpace ℝ ι) : ℝ

Exact module and namespace context

Proof roadmap

  1. 1Evaluate and sum coordinate line derivatives

    For each i, restrict the scalar component F_i to the line through x in direction e_i, take Mathlib's totalized real derivative at zero, and add these finitely many scalars. This constructs a value; it is not an integration theorem.

Full assumptions and notation

All objects and hypotheses

  • ι is a finite type with chosen finite enumeration and decidable equality; V=EuclideanSpace ℝ ι carries the Euclidean ℓ² norm. Empty ι is allowed.
  • F:V→V and x∈V are arbitrary; no differentiability, measurability, or support hypothesis.

Construction and meaning

1. Evaluate and sum coordinate line derivatives

For each i, restrict the scalar component F_i to the line through x in direction e_i, take Mathlib's totalized real derivative at zero, and add these finitely many scalars. This constructs a value; it is not an integration theorem.

\[\partial_i^{\rm tot}F_i(x)=\operatorname{lineDeriv}_{\mathbb R}F_i(x,e_i),\qquad \operatorname{Div}F(x)=\sum_i\partial_i^{\rm tot}F_i(x).\]
Corresponding Lean step

Definition body: finite sum of lineDeriv ℝ (fun y => F y i) x (EuclideanSpace.single i 1).

Lean verification

The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

Lean construction · coordinateDivergence

The body takes one totalized line derivative for each coordinate and forms their finite sum. There is no theorem being proved, and no differentiation hypothesis is hidden in this construction.

Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

Download module (.lean)
noncomputable def coordinateDivergence
    {ι : Type*} [Fintype ι] [DecidableEq ι]
    (F : EuclideanSpace ℝ ι → EuclideanSpace ℝ ι)
    (x : EuclideanSpace ℝ ι) : ℝ :=
  ∑ i, lineDeriv ℝ (fun y : EuclideanSpace ℝ ι => F y i) x
    (EuclideanSpace.single i (1 : ℝ))

Exact module and namespace context

Scope and omitted-condition boundaries
  • Do not replace this definition by a classical divergence formula without establishing the needed derivatives.
  • A finite sum over an empty coordinate type is zero.
Sources, dependencies, and reuse

Source and reuse

Samplinglib parents called

    Mathlib API called (external library)

    • lineDeriv
    • EuclideanSpace.single

    Mathematical sources

    Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

    Samplinglib mathematical lesson

    Unfold the coordinate-divergence convention

    AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.coordinateDivergence_eq_sum_lineDeriv · theorem · Teaching coverage

    Read this first

    Mathematical statement

    For arbitrary F:V→V and x∈V with a finite coordinate set, coordinate divergence is exactly the defining sum of totalized line derivatives.

    \[\operatorname{Div}F(x)=\sum_i\operatorname{lineDeriv}_{\mathbb R}F_i(x,e_i).\]
    Lean statement · coordinateDivergence_eq_sum_lineDeriv

    This is an evaluation wrapper exposing the definition, not a new divergence identity.

    Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

    theorem coordinateDivergence_eq_sum_lineDeriv
        {ι : Type*} [Fintype ι] [DecidableEq ι]
        (F : EuclideanSpace ℝ ι → EuclideanSpace ℝ ι)
        (x : EuclideanSpace ℝ ι) :
        coordinateDivergence F x =
          ∑ i, lineDeriv ℝ (fun y : EuclideanSpace ℝ ι => F y i) x
            (EuclideanSpace.single i (1 : ℝ))

    Exact module and namespace context

    Proof roadmap

    1. 1Read the definition

      Both sides are the same expression after expanding coordinateDivergence, so their equality requires no additional calculus.

    Full assumptions and notation

    All objects and hypotheses

    • ι is a finite type with chosen finite enumeration and decidable equality; V=EuclideanSpace ℝ ι carries the Euclidean ℓ² norm. Empty ι is allowed.
    • F:V→V and x∈V; no regularity assumptions.

    Mathematical proof

    1. Read the definition

    Both sides are the same expression after expanding coordinateDivergence, so their equality requires no additional calculus.

    \[\operatorname{Div}F(x)\equiv\sum_i\partial_i^{\rm tot}F_i(x).\]
    Corresponding Lean step

    rfl checks definitional equality.

    Lean verification

    The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

    Lean proof · coordinateDivergence_eq_sum_lineDeriv

    Both sides are the same expression after expanding coordinateDivergence, so their equality requires no additional calculus. The Lean correspondence in that step identifies the exact existing rule or definitional reduction used.

    Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

    Download module (.lean)
    theorem coordinateDivergence_eq_sum_lineDeriv
        {ι : Type*} [Fintype ι] [DecidableEq ι]
        (F : EuclideanSpace ℝ ι → EuclideanSpace ℝ ι)
        (x : EuclideanSpace ℝ ι) :
        coordinateDivergence F x =
          ∑ i, lineDeriv ℝ (fun y : EuclideanSpace ℝ ι => F y i) x
            (EuclideanSpace.single i (1 : ℝ)) := rfl

    Exact module and namespace context

    Scope and omitted-condition boundaries
    • No integral or derivative-existence result.
    Sources, dependencies, and reuse

    Source and reuse

    Samplinglib parents called

    Mathlib API called (external library)

    • lineDeriv

    Mathematical sources

    Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

    Samplinglib mathematical lesson

    A supplied Fréchet derivative gives the coordinate trace

    AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.coordinateDivergence_eq_sum_fderiv_apply_of_hasFDerivAt · theorem · Teaching coverage

    Read this first

    Mathematical statement

    For finite-dimensional Euclidean V, if F:V→V has Fréchet derivative A:V→L[ℝ]V at x, its coordinate divergence at x is the sum of the diagonal components A(e_i)_i.

    \[DF(x)=A\quad\Longrightarrow\quad\operatorname{Div}F(x)=\sum_i(Ae_i)_i.\]
    Lean statement · coordinateDivergence_eq_sum_fderiv_apply_of_hasFDerivAt

    `HasFDerivAt F F' x` supplies a concrete continuous linear derivative F′. The proof identifies each line derivative; it does not simply assume the trace formula.

    Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

    theorem coordinateDivergence_eq_sum_fderiv_apply_of_hasFDerivAt
        {ι : Type*} [Fintype ι] [DecidableEq ι]
        {F : EuclideanSpace ℝ ι → EuclideanSpace ℝ ι}
        {F' : EuclideanSpace ℝ ι →L[ℝ] EuclideanSpace ℝ ι}
        {x : EuclideanSpace ℝ ι}
        (hF : HasFDerivAt F F' x) :
        coordinateDivergence F x =
          ∑ i, F' (EuclideanSpace.single i (1 : ℝ)) i

    Exact module and namespace context

    Proof roadmap

    1. 1Differentiate each scalar component

      Let p_i:V→ℝ be continuous linear coordinate projection. Composing p_i with the derivative of F gives the derivative p_i∘A of F_i at x.

    2. 2Restrict the derivative to the coordinate line and sum

      The derivative along e_i is (p_i∘A)(e_i)=(Ae_i)_i. Substitute these identities into the finite sum defining divergence.

    Full assumptions and notation

    All objects and hypotheses

    • ι is a finite type with chosen finite enumeration and decidable equality; V=EuclideanSpace ℝ ι carries the Euclidean ℓ² norm. Empty ι is allowed.
    • F:V→V, A:V→L[ℝ]V, x∈V, and HasFDerivAt F A x.

    Mathematical proof

    1. Differentiate each scalar component

    Let p_i:V→ℝ be continuous linear coordinate projection. Composing p_i with the derivative of F gives the derivative p_i∘A of F_i at x.

    \[D F_i(x)=p_i\circ A.\]
    Corresponding Lean step

    PiLp.proj; pr.hasFDerivAt.comp x hF.

    2. Restrict the derivative to the coordinate line and sum

    The derivative along e_i is (p_i∘A)(e_i)=(Ae_i)_i. Substitute these identities into the finite sum defining divergence.

    \[\partial_iF_i(x)=(Ae_i)_i,\qquad\operatorname{Div}F(x)=\sum_i(Ae_i)_i.\]
    Corresponding Lean step

    hcomp.hasLineDerivAt (EuclideanSpace.single i 1); hline.lineDeriv; Finset.sum_congr.

    Lean verification

    The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

    Lean proof · coordinateDivergence_eq_sum_fderiv_apply_of_hasFDerivAt

    The source first let p_i:V→ℝ be continuous linear coordinate projection. Composing p_i with the derivative of F gives the derivative p_i∘A of F_i at x. It finishes as follows: The derivative along e_i is (p_i∘A)(e_i)=(Ae_i)_i. Substitute these identities into the finite sum defining divergence. Intermediate steps below identify the actual helper calls and the conditions each one needs.

    Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

    Download module (.lean)
    theorem coordinateDivergence_eq_sum_fderiv_apply_of_hasFDerivAt
        {ι : Type*} [Fintype ι] [DecidableEq ι]
        {F : EuclideanSpace ℝ ι → EuclideanSpace ℝ ι}
        {F' : EuclideanSpace ℝ ι →L[ℝ] EuclideanSpace ℝ ι}
        {x : EuclideanSpace ℝ ι}
        (hF : HasFDerivAt F F' x) :
        coordinateDivergence F x =
          ∑ i, F' (EuclideanSpace.single i (1 : ℝ)) i := by
      dsimp [coordinateDivergence]
      refine Finset.sum_congr rfl ?_
      intro i _hi
      let pr : EuclideanSpace ℝ ι →L[ℝ] ℝ :=
        PiLp.proj (p := 2) (𝕜 := ℝ) (fun _ : ι => ℝ) i
      have hcomp : HasFDerivAt (fun y : EuclideanSpace ℝ ι => F y i)
          (pr.comp F') x := by
        simpa [pr, Function.comp_def] using (pr.hasFDerivAt.comp x hF)
      have hline := hcomp.hasLineDerivAt (EuclideanSpace.single i (1 : ℝ))
      simpa [pr] using hline.lineDeriv

    Exact module and namespace context

    Scope and omitted-condition boundaries
    • Pointwise only: no trace integrability or boundary statement.
    Sources, dependencies, and reuse

    Source and reuse

    Samplinglib parents called

    Mathlib API called (external library)

    • PiLp.proj
    • ContinuousLinearMap.hasFDerivAt
    • HasFDerivAt.comp
    • HasFDerivAt.hasLineDerivAt
    • HasLineDerivAt.lineDeriv
    • Finset.sum_congr

    Mathematical sources

    Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

    Samplinglib mathematical lesson

    Use the canonical Fréchet derivative in the trace formula

    AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.coordinateDivergence_eq_sum_fderiv_apply_of_differentiableAt · theorem · Teaching coverage

    Read this first

    Mathematical statement

    If F:V→V is Fréchet differentiable at x, its coordinate divergence equals the coordinate trace sum of the canonical fderiv ℝ F x.

    \[F\text{ differentiable at }x\quad\Longrightarrow\quad\operatorname{Div}F(x)=\sum_i(D F(x)e_i)_i.\]
    Lean statement · coordinateDivergence_eq_sum_fderiv_apply_of_differentiableAt

    This removes a separately supplied derivative map only because `DifferentiableAt` is assumed; totalization alone would not justify the replacement.

    Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

    theorem coordinateDivergence_eq_sum_fderiv_apply_of_differentiableAt
        {ι : Type*} [Fintype ι] [DecidableEq ι]
        {F : EuclideanSpace ℝ ι → EuclideanSpace ℝ ι}
        {x : EuclideanSpace ℝ ι}
        (hF : DifferentiableAt ℝ F x) :
        coordinateDivergence F x =
          ∑ i, fderiv ℝ F x (EuclideanSpace.single i (1 : ℝ)) i

    Exact module and namespace context

    Proof roadmap

    1. 1Supply the canonical derivative to the existing trace identity

      Differentiability certifies that fderiv is an actual derivative at x. Substitute this witness in the preceding theorem.

    Full assumptions and notation

    All objects and hypotheses

    • ι is a finite type with chosen finite enumeration and decidable equality; V=EuclideanSpace ℝ ι carries the Euclidean ℓ² norm. Empty ι is allowed.
    • F:V→V, x∈V, and DifferentiableAt ℝ F x.

    Mathematical proof

    1. Supply the canonical derivative to the existing trace identity

    Differentiability certifies that fderiv is an actual derivative at x. Substitute this witness in the preceding theorem.

    \[A:=\operatorname{fderiv}_{\mathbb R}F(x),\qquad DF(x)=A.\]
    Corresponding Lean step

    coordinateDivergence_eq_sum_fderiv_apply_of_hasFDerivAt hF.hasFDerivAt.

    Lean verification

    The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

    Lean proof · coordinateDivergence_eq_sum_fderiv_apply_of_differentiableAt

    Differentiability certifies that fderiv is an actual derivative at x. Substitute this witness in the preceding theorem. The Lean correspondence in that step identifies the exact existing rule or definitional reduction used.

    Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

    Download module (.lean)
    theorem coordinateDivergence_eq_sum_fderiv_apply_of_differentiableAt
        {ι : Type*} [Fintype ι] [DecidableEq ι]
        {F : EuclideanSpace ℝ ι → EuclideanSpace ℝ ι}
        {x : EuclideanSpace ℝ ι}
        (hF : DifferentiableAt ℝ F x) :
        coordinateDivergence F x =
          ∑ i, fderiv ℝ F x (EuclideanSpace.single i (1 : ℝ)) i :=
      coordinateDivergence_eq_sum_fderiv_apply_of_hasFDerivAt hF.hasFDerivAt

    Exact module and namespace context

    Scope and omitted-condition boundaries
    • No claim of differentiability at other points.
    Sources, dependencies, and reuse

    Source and reuse

    Samplinglib parents called

    Mathlib API called (external library)

    • DifferentiableAt.hasFDerivAt

    Mathematical sources

    Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

    Samplinglib mathematical lesson

    The PiLp equivalence preserves coordinate vectors

    AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.continuousLinearEquiv_apply_euclideanSpace_single · theorem · Teaching coverage

    Read this first

    Mathematical statement

    For a finite coordinate type ι and any i∈ι, the canonical equivalence from Euclidean coordinates to the raw function space sends the Euclidean i-th unit vector to the raw i-th unit function.

    \[e(\operatorname{EuclideanSingle}(i,1))=\operatorname{PiSingle}(i,1).\]
    Lean statement · continuousLinearEquiv_apply_euclideanSpace_single

    The equivalence preserves coordinates, but it is not asserted to preserve the supremum and ℓ² norms.

    Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

    theorem continuousLinearEquiv_apply_euclideanSpace_single
        {ι : Type*} [Fintype ι] [DecidableEq ι] (i : ι) :
        (PiLp.continuousLinearEquiv 2 ℝ (fun _ : ι => ℝ))
          (EuclideanSpace.single i (1 : ℝ)) = Pi.single i (1 : ℝ)

    Exact module and namespace context

    Proof roadmap

    1. 1Compare every coordinate

      At coordinate j both vectors have value one when j=i and zero otherwise. Extensional equality of functions proves the asserted vector equality.

    Full assumptions and notation

    All objects and hypotheses

    • ι is a finite type with chosen finite enumeration and decidable equality; V=EuclideanSpace ℝ ι carries the Euclidean ℓ² norm. Empty ι is allowed.
    • e:V≃L[ℝ](ι→ℝ) is PiLp.continuousLinearEquiv 2 ℝ (fun _=>ℝ); i∈ι.

    Mathematical proof

    1. Compare every coordinate

    At coordinate j both vectors have value one when j=i and zero otherwise. Extensional equality of functions proves the asserted vector equality.

    \[\bigl(e(e_i^V)\bigr)_j=\begin{cases}1,&j=i,\\0,&j\ne i,\end{cases}=(e_i^P)_j.\]
    Corresponding Lean step

    ext j; PiLp.continuousLinearEquiv_apply; EuclideanSpace.single; case split j = i and simplification of Pi.single.

    Lean verification

    The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

    Lean proof · continuousLinearEquiv_apply_euclideanSpace_single

    At coordinate j both vectors have value one when j=i and zero otherwise. Extensional equality of functions proves the asserted vector equality. The Lean correspondence in that step identifies the exact existing rule or definitional reduction used.

    Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

    Download module (.lean)
    theorem continuousLinearEquiv_apply_euclideanSpace_single
        {ι : Type*} [Fintype ι] [DecidableEq ι] (i : ι) :
        (PiLp.continuousLinearEquiv 2 ℝ (fun _ : ι => ℝ))
          (EuclideanSpace.single i (1 : ℝ)) = Pi.single i (1 : ℝ) := by
      ext j
      rw [PiLp.continuousLinearEquiv_apply]
      simp [EuclideanSpace.single]
      by_cases h : j = i
      · subst h
        simp [Pi.single]
      · simp [Pi.single, h]

    Exact module and namespace context

    Scope and omitted-condition boundaries
    • No isometry or change-of-variables-integration claim.
    Sources, dependencies, and reuse

    Source and reuse

    Samplinglib parents called

      Mathlib API called (external library)

      • PiLp.continuousLinearEquiv_apply
      • EuclideanSpace.single
      • Pi.single

      Mathematical sources

      • Current ASTIS source — Exact statement and actual proof/construction authority; raw code intentionally omitted from this packet.
      • Existing curated module card — Existing declaration-specific attribution entry, read as documentation without a new source-equivalence verdict.
      • Existing focused test — Exact named declaration invocation located in an existing example; no test was run.

      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

      Samplinglib mathematical lesson

      Differentiate the radial cutoff after PiLp transport

      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.hasFDerivAt_radialSmoothCutoff_comp_toLp · theorem · Teaching coverage

      Read this first

      Mathematical statement

      Let n∈ℕ, R>0 and x∈P. Write χ_R for the Euclidean radial cutoff and η_R=χ_R∘T on raw coordinates. Then η_R has derivative Dχ_R(Tx)∘T at x, where T is regarded as a continuous linear map.

      \[D\eta_R(x)=D\chi_R(Tx)\circ T,\qquad \eta_R(x)=\chi_R(Tx).\]
      Lean statement · hasFDerivAt_radialSmoothCutoff_comp_toLp

      The result is `HasFDerivAt`, so it certifies genuine differentiability, not merely a totalized fderiv expression. The inverse of e is T.

      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

      theorem hasFDerivAt_radialSmoothCutoff_comp_toLp
          {n : ℕ} {R : ℝ} (hR : 0 < R) (x : Fin (n + 1) → ℝ) :
          HasFDerivAt
            (fun z => Cutoff.radialSmoothCutoff R
              (WithLp.toLp 2 z : EuclideanSpace ℝ (Fin (n + 1))))
            ((fderiv ℝ
                (Cutoff.radialSmoothCutoff R :
                  EuclideanSpace ℝ (Fin (n + 1)) → ℝ)
                (WithLp.toLp 2 x)).comp
              (PiLp.continuousLinearEquiv
                2 ℝ (fun _ : Fin (n + 1) => ℝ)).symm.toContinuousLinearMap)
            x

      Exact module and namespace context

      Proof roadmap

      1. 1Differentiate the linear coordinate conversion

        The derivative of T at every point is its own continuous linear map.

      2. 2Differentiate the smooth Euclidean cutoff and compose

        Positive radius makes χ_R smooth on V, hence differentiable at Tx. The Fréchet chain rule gives the claimed composite derivative.

      Full assumptions and notation

      All objects and hypotheses

      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
      • R∈ℝ with R>0; x∈P; χ_R is Cutoff.radialSmoothCutoff on V.

      Mathematical proof

      1. Differentiate the linear coordinate conversion

      The derivative of T at every point is its own continuous linear map.

      \[DT(x)=T.\]
      Corresponding Lean step

      PiLp.hasFDerivAt_toLp; the derivative is e.symm.toContinuousLinearMap.

      2. Differentiate the smooth Euclidean cutoff and compose

      Positive radius makes χ_R smooth on V, hence differentiable at Tx. The Fréchet chain rule gives the claimed composite derivative.

      \[D(\chi_R\circ T)(x)=D\chi_R(Tx)\circ T.\]
      Corresponding Lean step

      Cutoff.radialSmoothCutoff_contDiff hR; .differentiable ... .hasFDerivAt; hcutoff.comp x htoLp.

      Lean verification

      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

      Lean proof · hasFDerivAt_radialSmoothCutoff_comp_toLp

      The source first the derivative of T at every point is its own continuous linear map. It finishes as follows: Positive radius makes χ_R smooth on V, hence differentiable at Tx. The Fréchet chain rule gives the claimed composite derivative. Intermediate steps below identify the actual helper calls and the conditions each one needs.

      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

      Download module (.lean)
      theorem hasFDerivAt_radialSmoothCutoff_comp_toLp
          {n : ℕ} {R : ℝ} (hR : 0 < R) (x : Fin (n + 1) → ℝ) :
          HasFDerivAt
            (fun z => Cutoff.radialSmoothCutoff R
              (WithLp.toLp 2 z : EuclideanSpace ℝ (Fin (n + 1))))
            ((fderiv ℝ
                (Cutoff.radialSmoothCutoff R :
                  EuclideanSpace ℝ (Fin (n + 1)) → ℝ)
                (WithLp.toLp 2 x)).comp
              (PiLp.continuousLinearEquiv
                2 ℝ (fun _ : Fin (n + 1) => ℝ)).symm.toContinuousLinearMap)
            x := by
        let e : EuclideanSpace ℝ (Fin (n + 1)) ≃L[ℝ] (Fin (n + 1) → ℝ) :=
          PiLp.continuousLinearEquiv 2 ℝ (fun _ : Fin (n + 1) => ℝ)
        have htoLp : HasFDerivAt
            (fun z : Fin (n + 1) → ℝ =>
              (WithLp.toLp 2 z : EuclideanSpace ℝ (Fin (n + 1))))
            e.symm.toContinuousLinearMap x := by
          simpa [e] using
            (PiLp.hasFDerivAt_toLp (𝕜 := ℝ)
              (E := fun _ : Fin (n + 1) => ℝ) 2 x)
        have hcutoff : HasFDerivAt
            (Cutoff.radialSmoothCutoff R :
              EuclideanSpace ℝ (Fin (n + 1)) → ℝ)
            (fderiv ℝ
              (Cutoff.radialSmoothCutoff R :
                EuclideanSpace ℝ (Fin (n + 1)) → ℝ)
              (WithLp.toLp 2 x))
            (WithLp.toLp 2 x) :=
          ((Cutoff.radialSmoothCutoff_contDiff hR).differentiable
            (WithTop.coe_ne_zero.mpr WithTop.top_ne_zero)
            (WithLp.toLp 2 x)).hasFDerivAt
        simpa [Function.comp_def, e] using hcutoff.comp x htoLp

      Exact module and namespace context

      Scope and omitted-condition boundaries
      • Pointwise derivative producer only; no support enclosure in a box or integral estimate.
      Sources, dependencies, and reuse

      Source and reuse

      Samplinglib parents called

      Mathlib API called (external library)

      • PiLp.hasFDerivAt_toLp
      • HasFDerivAt.comp

      Mathematical sources

      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

      Samplinglib mathematical lesson

      The cutoff-gradient cross term tends to zero in L¹

      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.tendsto_integral_norm_fderiv_radialSmoothCutoff_comp_toLp_apply · theorem · Teaching coverage

      Read this first

      Mathematical statement

      Let μ be any measure on raw P and G:P→P be μ-integrable. With η_R=χ_R∘T, the integral of the absolute value of Dη_R(x) applied to G(x) tends to zero as the real radius R tends to positive infinity.

      \[\lim_{R\to+\infty}\int_P\bigl|D\eta_R(x)[G(x)]\bigr|\,d\mu(x)=0.\]
      Lean statement · tendsto_integral_norm_fderiv_radialSmoothCutoff_comp_toLp_apply

      `Integrable G μ` is the only analytic input. The output integrates a real norm of a scalar derivative application. All estimates are required only eventually in R, so no assertion about nonpositive-radius smoothness is needed.

      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

      theorem tendsto_integral_norm_fderiv_radialSmoothCutoff_comp_toLp_apply
          {n : ℕ} {μ : Measure (Fin (n + 1) → ℝ)}
          {G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ}
          (hG : Integrable G μ) :
          Tendsto
            (fun R : ℝ =>
              ∫ x, ‖fderiv ℝ
                (fun z => Cutoff.radialSmoothCutoff R
                  (WithLp.toLp 2 z : EuclideanSpace ℝ (Fin (n + 1))))
                x (G x)‖ ∂μ)
            atTop (𝓝 0)

      Exact module and namespace context

      Proof roadmap

      1. 1Fix a first-derivative constant and an integrable dominator

        Choose C>0 from the Euclidean radial derivative bound. Since ‖G‖ is integrable, so is b(x)=C‖T‖op‖G(x)‖.

      2. 2Establish a.e. strong measurability for positive radii

        The composition η_R is smooth for R>0, so its derivative is continuous. Evaluating this continuous linear-map field on the a.e. strongly measurable G, then taking the norm, gives an a.e. strongly measurable integrand.

      3. 3Keep the norm-conversion constant in the derivative estimate

        The transported chain rule and operator norm inequalities give |Dη_R(x)[G(x)]|≤(C/R)‖T‖op‖G(x)‖. For R≥1 this is at most b(x).

      4. 4Prove pointwise decay by squeezing

        At each fixed x the right side is a constant times 1/R, hence tends to zero. Nonnegativity squeezes the integrand to zero.

      5. 5Apply dominated convergence along real radii

        The real atTop filter has a countable basis. Eventual measurability, eventual domination by b∈L¹, and a.e. pointwise convergence allow the limit through the integral; the integral of zero is zero.

      Full assumptions and notation

      All objects and hypotheses

      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
      • μ is an arbitrary measure on P; no finiteness or probability assumption.
      • G:P→P is Integrable G μ, including a.e. strong measurability and integrability of its supremum norm.
      • For every real R the integrand is expressed by totalized fderiv. For the eventually positive radii used in the proof, η_R is smooth and fderiv is its genuine derivative.

      Mathematical proof

      1. Fix a first-derivative constant and an integrable dominator

      Choose C>0 from the Euclidean radial derivative bound. Since ‖G‖ is integrable, so is b(x)=C‖T‖op‖G(x)‖.

      \[\|D\chi_R(y)\|_{\rm op}\le C/R,\qquad b(x):=C\|T\|_{\rm op}\|G(x)\|\in L^1(\mu).\]
      Corresponding Lean step

      Cutoff.radialSmoothCutoff_fderiv_bound; hG.norm.const_mul.

      2. Establish a.e. strong measurability for positive radii

      The composition η_R is smooth for R>0, so its derivative is continuous. Evaluating this continuous linear-map field on the a.e. strongly measurable G, then taking the norm, gives an a.e. strongly measurable integrand.

      \[x\mapsto D\eta_R(x)\text{ continuous},\qquad x\mapsto |D\eta_R(x)[G(x)]|\text{ a.e. strongly measurable}.\]
      Corresponding Lean step

      PiLp.contDiff_toLp; ContDiff.continuous_fderiv; ContinuousLinearMap.flip (ContinuousLinearMap.apply ℝ ℝ); aestronglyMeasurable_comp₂.

      3. Keep the norm-conversion constant in the derivative estimate

      The transported chain rule and operator norm inequalities give |Dη_R(x)[G(x)]|≤(C/R)‖T‖op‖G(x)‖. For R≥1 this is at most b(x).

      \[|D\eta_R(x)[G(x)]|\le\frac{C}{R}\|T\|_{\rm op}\|G(x)\|\le b(x)\quad(R\ge1).\]
      Corresponding Lean step

      hasFDerivAt_radialSmoothCutoff_comp_toLp ... .fderiv; ContinuousLinearMap.le_opNorm; ContinuousLinearMap.opNorm_comp_le; div_le_self.

      4. Prove pointwise decay by squeezing

      At each fixed x the right side is a constant times 1/R, hence tends to zero. Nonnegativity squeezes the integrand to zero.

      \[0\le |D\eta_R(x)[G(x)]|\le\frac{C\|T\|_{\rm op}\|G(x)\|}{R}\longrightarrow0.\]
      Corresponding Lean step

      squeeze_zero'; tendsto_const_nhds.div_atTop tendsto_id and .mul_const.

      5. Apply dominated convergence along real radii

      The real atTop filter has a countable basis. Eventual measurability, eventual domination by b∈L¹, and a.e. pointwise convergence allow the limit through the integral; the integral of zero is zero.

      \[\int_P |D\eta_R[G]|\,d\mu\longrightarrow\int_P0\,d\mu=0.\]
      Corresponding Lean step

      MeasureTheory.tendsto_integral_filter_of_dominated_convergence with bound, hmeas, hdom, hbound_integrable, hpoint.

      Lean verification

      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

      Lean proof · tendsto_integral_norm_fderiv_radialSmoothCutoff_comp_toLp_apply

      The source first choose C>0 from the Euclidean radial derivative bound. Since ‖G‖ is integrable, so is b(x)=C‖T‖op‖G(x)‖. It finishes as follows: The real atTop filter has a countable basis. Eventual measurability, eventual domination by b∈L¹, and a.e. pointwise convergence allow the limit through the integral; the integral of zero is zero. Intermediate steps below identify the actual helper calls and the conditions each one needs.

      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

      Download module (.lean)
      theorem tendsto_integral_norm_fderiv_radialSmoothCutoff_comp_toLp_apply
          {n : ℕ} {μ : Measure (Fin (n + 1) → ℝ)}
          {G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ}
          (hG : Integrable G μ) :
          Tendsto
            (fun R : ℝ =>
              ∫ x, ‖fderiv ℝ
                (fun z => Cutoff.radialSmoothCutoff R
                  (WithLp.toLp 2 z : EuclideanSpace ℝ (Fin (n + 1))))
                x (G x)‖ ∂μ)
            atTop (𝓝 0) := by
        let e : EuclideanSpace ℝ (Fin (n + 1)) ≃L[ℝ] (Fin (n + 1) → ℝ) :=
          PiLp.continuousLinearEquiv 2 ℝ (fun _ : Fin (n + 1) => ℝ)
        obtain ⟨C, hC_pos, hC⟩ :=
          Cutoff.radialSmoothCutoff_fderiv_bound
            (E := EuclideanSpace ℝ (Fin (n + 1)))
        let bound : (Fin (n + 1) → ℝ) → ℝ :=
          fun x => (C * ‖e.symm.toContinuousLinearMap‖) * ‖G x‖
        have hbound_integrable : Integrable bound μ := by
          exact (hG.norm.const_mul (C * ‖e.symm.toContinuousLinearMap‖))
        have hmeas :
            ∀ᶠ R : ℝ in atTop,
              AEStronglyMeasurable
                (fun x => ‖fderiv ℝ
                  (fun z => Cutoff.radialSmoothCutoff R
                    (WithLp.toLp 2 z : EuclideanSpace ℝ (Fin (n + 1))))
                  x (G x)‖) μ := by
          filter_upwards [eventually_gt_atTop (0 : ℝ)] with R hR
          have hsmooth :
              ContDiff ℝ (⊤ : ℕ∞)
                (fun z : Fin (n + 1) → ℝ =>
                  Cutoff.radialSmoothCutoff R
                    (WithLp.toLp 2 z : EuclideanSpace ℝ (Fin (n + 1)))) :=
            (Cutoff.radialSmoothCutoff_contDiff hR).comp
              (PiLp.contDiff_toLp (𝕜 := ℝ) (E := fun _ : Fin (n + 1) => ℝ))
          have hderiv :
              AEStronglyMeasurable
                (fun x => fderiv ℝ
                  (fun z : Fin (n + 1) → ℝ =>
                    Cutoff.radialSmoothCutoff R
                      (WithLp.toLp 2 z : EuclideanSpace ℝ (Fin (n + 1))))
                  x) μ :=
            (hsmooth.continuous_fderiv
              (WithTop.coe_ne_zero.mpr WithTop.top_ne_zero)).aestronglyMeasurable
          let eval :
              ((Fin (n + 1) → ℝ) →L[ℝ] ℝ) →L[ℝ]
                (Fin (n + 1) → ℝ) →L[ℝ] ℝ :=
            ContinuousLinearMap.flip (ContinuousLinearMap.apply ℝ ℝ)
          exact
            (eval.aestronglyMeasurable_comp₂
              hderiv hG.aestronglyMeasurable).norm
        have hdom :
            ∀ᶠ R : ℝ in atTop, ∀ᵐ x ∂μ,
              ‖(fun x => ‖fderiv ℝ
                (fun z => Cutoff.radialSmoothCutoff R
                  (WithLp.toLp 2 z : EuclideanSpace ℝ (Fin (n + 1))))
                x (G x)‖) x‖ ≤ bound x := by
          filter_upwards [eventually_ge_atTop (1 : ℝ)] with R hR
          filter_upwards with x
          have hR_pos : 0 < R := lt_of_lt_of_le zero_lt_one hR
          have hfderiv :
              fderiv ℝ
                (fun z => Cutoff.radialSmoothCutoff R
                  (WithLp.toLp 2 z : EuclideanSpace ℝ (Fin (n + 1))))
                x =
              (fderiv ℝ
                (Cutoff.radialSmoothCutoff R :
                  EuclideanSpace ℝ (Fin (n + 1)) → ℝ)
                (WithLp.toLp 2 x)).comp e.symm.toContinuousLinearMap :=
            (hasFDerivAt_radialSmoothCutoff_comp_toLp hR_pos x).fderiv
          rw [norm_norm, hfderiv]
          calc
            ‖((fderiv ℝ
                (Cutoff.radialSmoothCutoff R :
                  EuclideanSpace ℝ (Fin (n + 1)) → ℝ)
                (WithLp.toLp 2 x)).comp e.symm.toContinuousLinearMap) (G x)‖
                ≤ ‖(fderiv ℝ
                    (Cutoff.radialSmoothCutoff R :
                      EuclideanSpace ℝ (Fin (n + 1)) → ℝ)
                    (WithLp.toLp 2 x)).comp e.symm.toContinuousLinearMap‖ * ‖G x‖ :=
              ContinuousLinearMap.le_opNorm _ _
            _ ≤ ((C / R) * ‖e.symm.toContinuousLinearMap‖) * ‖G x‖ := by
              gcongr
              exact (ContinuousLinearMap.opNorm_comp_le _ _).trans
                (mul_le_mul_of_nonneg_right
                  (hC R hR_pos (WithLp.toLp 2 x)) (norm_nonneg _))
            _ ≤ bound x := by
              dsimp [bound]
              gcongr
              exact div_le_self hC_pos.le hR
        have hpoint :
            ∀ᵐ x ∂μ,
              Tendsto
                (fun R : ℝ => ‖fderiv ℝ
                  (fun z => Cutoff.radialSmoothCutoff R
                    (WithLp.toLp 2 z : EuclideanSpace ℝ (Fin (n + 1))))
                  x (G x)‖)
                atTop (𝓝 0) := by
          filter_upwards with x
          refine squeeze_zero'
            (g := fun R =>
              ((C / R) * ‖e.symm.toContinuousLinearMap‖) * ‖G x‖) ?_ ?_ ?_
          · exact Filter.Eventually.of_forall fun R => norm_nonneg _
          · filter_upwards [eventually_gt_atTop (0 : ℝ)] with R hR
            have hfderiv :
                fderiv ℝ
                  (fun z => Cutoff.radialSmoothCutoff R
                    (WithLp.toLp 2 z : EuclideanSpace ℝ (Fin (n + 1))))
                  x =
                (fderiv ℝ
                  (Cutoff.radialSmoothCutoff R :
                    EuclideanSpace ℝ (Fin (n + 1)) → ℝ)
                  (WithLp.toLp 2 x)).comp e.symm.toContinuousLinearMap :=
              (hasFDerivAt_radialSmoothCutoff_comp_toLp hR x).fderiv
            rw [hfderiv]
            calc
              ‖((fderiv ℝ
                  (Cutoff.radialSmoothCutoff R :
                    EuclideanSpace ℝ (Fin (n + 1)) → ℝ)
                  (WithLp.toLp 2 x)).comp e.symm.toContinuousLinearMap) (G x)‖
                  ≤ ‖(fderiv ℝ
                        (Cutoff.radialSmoothCutoff R :
                          EuclideanSpace ℝ (Fin (n + 1)) → ℝ)
                        (WithLp.toLp 2 x)).comp e.symm.toContinuousLinearMap‖ *
                        ‖G x‖ := ContinuousLinearMap.le_opNorm _ _
              _ ≤ ((C / R) * ‖e.symm.toContinuousLinearMap‖) * ‖G x‖ := by
                gcongr
                exact (ContinuousLinearMap.opNorm_comp_le _ _).trans
                  (mul_le_mul_of_nonneg_right
                    (hC R hR (WithLp.toLp 2 x)) (norm_nonneg _))
          · simpa [mul_assoc] using
              (tendsto_const_nhds.div_atTop tendsto_id).mul_const
                (‖e.symm.toContinuousLinearMap‖ * ‖G x‖)
        have hDCT :=
          MeasureTheory.tendsto_integral_filter_of_dominated_convergence
            (μ := μ) (l := atTop)
            (F := fun R x => ‖fderiv ℝ
              (fun z => Cutoff.radialSmoothCutoff R
                (WithLp.toLp 2 z : EuclideanSpace ℝ (Fin (n + 1))))
              x (G x)‖)
            (f := fun _ => (0 : ℝ)) bound hmeas hdom hbound_integrable hpoint
        simpa using hDCT

      Exact module and namespace context

      Scope and omitted-condition boundaries
      • The raw supremum norm is not identified with the Euclidean norm: the factor ‖T‖op is retained.
      • This proves a generic cross-term limit, not integrability of any particular physical field or invariance.
      Sources, dependencies, and reuse

      Source and reuse

      Samplinglib parents called

      Mathlib API called (external library)

      • PiLp.contDiff_toLp
      • ContDiff.continuous_fderiv
      • ContinuousLinearMap.aestronglyMeasurable_comp₂
      • ContinuousLinearMap.le_opNorm
      • ContinuousLinearMap.opNorm_comp_le
      • MeasureTheory.tendsto_integral_filter_of_dominated_convergence
      • squeeze_zero'

      Mathematical sources

      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

      Samplinglib mathematical lesson

      The cutoff main term converges under integration

      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.tendsto_integral_radialSmoothCutoff_comp_toLp_smul · theorem · Teaching coverage

      Read this first

      Mathematical statement

      Let μ be any measure on P, let W be a real normed vector space, and let H:P→W be μ-integrable. Multiplication by η_R(x)=χ_R(Tx) converges to the identity under the Mathlib Bochner integral as R→+∞.

      \[\lim_{R\to+\infty}\int_P\eta_R(x)H(x)\,d\mu(x)=\int_PH(x)\,d\mu(x).\]
      Lean statement · tendsto_integral_radialSmoothCutoff_comp_toLp_smul

      The codomain type named F in Lean is called W here to distinguish it from a vector field. No completeness assumption is added; the statement uses Mathlib's totalized Bochner integral conventions.

      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

      theorem tendsto_integral_radialSmoothCutoff_comp_toLp_smul
          {n : ℕ} {F : Type*} [NormedAddCommGroup F] [NormedSpace ℝ F]
          {μ : Measure (Fin (n + 1) → ℝ)}
          {H : (Fin (n + 1) → ℝ) → F}
          (hH : Integrable H μ) :
          Tendsto
            (fun R : ℝ => ∫ x,
              Cutoff.radialSmoothCutoff R
                (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) • H x ∂μ)
            atTop (𝓝 (∫ x, H x ∂μ))

      Exact module and namespace context

      Proof roadmap

      1. 1Check eventual measurability

        For R>0, η_R is continuous by smoothness of χ_R and continuity of T. Its product with the a.e. strongly measurable H is a.e. strongly measurable.

      2. 2Dominate by the source norm

        Every cutoff value lies in [0,1], for all real R. Thus ‖η_R(x)H(x)‖≤‖H(x)‖, with integrable right side.

      3. 3Use pointwise plateau exhaustion

        For every fixed x, χ_R(Tx)→1. Continuity of scalar multiplication gives η_R(x)H(x)→H(x).

      4. 4Pass to the integral

        Apply the filter version of dominated convergence with bound ‖H‖ and limit H.

      Full assumptions and notation

      All objects and hypotheses

      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
      • W is a normed additive commutative group with NormedSpace ℝ W; no CompleteSpace hypothesis is retained.
      • μ is any measure on P; H:P→W satisfies Integrable H μ.

      Mathematical proof

      1. Check eventual measurability

      For R>0, η_R is continuous by smoothness of χ_R and continuity of T. Its product with the a.e. strongly measurable H is a.e. strongly measurable.

      \[\eta_R\text{ continuous},\quad \eta_R H\text{ a.e. strongly measurable}\quad(R>0).\]
      Corresponding Lean step

      Cutoff.radialSmoothCutoff_contDiff; PiLp.continuous_toLp; AEStronglyMeasurable.smul.

      2. Dominate by the source norm

      Every cutoff value lies in [0,1], for all real R. Thus ‖η_R(x)H(x)‖≤‖H(x)‖, with integrable right side.

      \[0\le\eta_R\le1,\qquad \|\eta_R(x)H(x)\|\le\|H(x)\|,\qquad \|H\|\in L^1(\mu).\]
      Corresponding Lean step

      Cutoff.radialSmoothCutoff_mem_Icc; norm_smul; abs_of_nonneg; hH.norm.

      3. Use pointwise plateau exhaustion

      For every fixed x, χ_R(Tx)→1. Continuity of scalar multiplication gives η_R(x)H(x)→H(x).

      \[\eta_R(x)\to1\quad\Longrightarrow\quad\eta_R(x)H(x)\to H(x).\]
      Corresponding Lean step

      Cutoff.radialSmoothCutoff_tendsto_one (WithLp.toLp 2 x); .smul_const (H x).

      4. Pass to the integral

      Apply the filter version of dominated convergence with bound ‖H‖ and limit H.

      \[\int \eta_RH\,d\mu\longrightarrow\int H\,d\mu.\]
      Corresponding Lean step

      MeasureTheory.tendsto_integral_filter_of_dominated_convergence.

      Lean verification

      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

      Lean proof · tendsto_integral_radialSmoothCutoff_comp_toLp_smul

      The source first for R>0, η_R is continuous by smoothness of χ_R and continuity of T. Its product with the a.e. strongly measurable H is a.e. strongly measurable. It finishes as follows: Apply the filter version of dominated convergence with bound ‖H‖ and limit H. Intermediate steps below identify the actual helper calls and the conditions each one needs.

      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

      Download module (.lean)
      theorem tendsto_integral_radialSmoothCutoff_comp_toLp_smul
          {n : ℕ} {F : Type*} [NormedAddCommGroup F] [NormedSpace ℝ F]
          {μ : Measure (Fin (n + 1) → ℝ)}
          {H : (Fin (n + 1) → ℝ) → F}
          (hH : Integrable H μ) :
          Tendsto
            (fun R : ℝ => ∫ x,
              Cutoff.radialSmoothCutoff R
                (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) • H x ∂μ)
            atTop (𝓝 (∫ x, H x ∂μ)) := by
        have hmeas :
            ∀ᶠ R : ℝ in atTop,
              AEStronglyMeasurable
                (fun x : Fin (n + 1) → ℝ =>
                  Cutoff.radialSmoothCutoff R
                    (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) • H x) μ := by
          filter_upwards [eventually_gt_atTop (0 : ℝ)] with R hR
          exact
            (((Cutoff.radialSmoothCutoff_contDiff hR).continuous.comp
              (PiLp.continuous_toLp 2 _)).aestronglyMeasurable).smul
              hH.aestronglyMeasurable
        have hdom :
            ∀ᶠ R : ℝ in atTop, ∀ᵐ x ∂μ,
              ‖Cutoff.radialSmoothCutoff R
                  (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) • H x‖ ≤
                ‖H x‖ := by
          filter_upwards with R
          filter_upwards with x
          have hcutoff :=
            Cutoff.radialSmoothCutoff_mem_Icc R
              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1)))
          rw [norm_smul, Real.norm_eq_abs, abs_of_nonneg hcutoff.1]
          exact mul_le_of_le_one_left (norm_nonneg _) hcutoff.2
        have hpoint :
            ∀ᵐ x ∂μ,
              Tendsto
                (fun R : ℝ =>
                  Cutoff.radialSmoothCutoff R
                    (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) • H x)
                atTop (𝓝 (H x)) := by
          filter_upwards with x
          simpa using
            (Cutoff.radialSmoothCutoff_tendsto_one
              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1)))).smul_const (H x)
        exact MeasureTheory.tendsto_integral_filter_of_dominated_convergence
          (μ := μ) (l := atTop)
          (F := fun R x =>
            Cutoff.radialSmoothCutoff R
              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) • H x)
          (f := H) (fun x => ‖H x‖) hmeas hdom hH.norm hpoint

      Exact module and namespace context

      Scope and omitted-condition boundaries
      • No Gibbs-specific integrability, derivative cross-term estimate, or integration-by-parts identity is inferred.
      • The usual Banach-space integral reading applies when W is complete; the exact Lean theorem does not require that extra hypothesis.
      Sources, dependencies, and reuse

      Source and reuse

      Samplinglib parents called

      Mathlib API called (external library)

      • PiLp.continuous_toLp
      • MeasureTheory.AEStronglyMeasurable.smul
      • norm_smul
      • MeasureTheory.tendsto_integral_filter_of_dominated_convergence

      Mathematical sources

      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

      Samplinglib mathematical lesson

      Integrable norm tails outside expanding Euclidean balls vanish

      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.tendsto_setIntegral_norm_norm_ge_comp_toLp · theorem · Teaching coverage

      Read this first

      Mathematical statement

      For any measure μ on P, real normed vector space W, and μ-integrable H:P→W, the integral of ‖H(x)‖ over the closed exterior set {x:R≤‖Tx‖₂} tends to zero as R→+∞.

      \[\lim_{R\to+\infty}\int_{\{x:R\le\|Tx\|_2\}}\|H(x)\|\,d\mu(x)=0.\]
      Lean statement · tendsto_setIntegral_norm_norm_ge_comp_toLp

      The tail boundary is included by the non-strict inequality. This generic measure-theoretic theorem does not assume that μ is finite, has a density, or is a Gibbs measure.

      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

      theorem tendsto_setIntegral_norm_norm_ge_comp_toLp
          {n : ℕ} {F : Type*} [NormedAddCommGroup F] [NormedSpace ℝ F]
          {μ : Measure (Fin (n + 1) → ℝ)}
          {H : (Fin (n + 1) → ℝ) → F}
          (hH : Integrable H μ) :
          Tendsto
            (fun R : ℝ => ∫ x in
              {x : Fin (n + 1) → ℝ |
                R ≤ ‖(WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1)))‖},
              ‖H x‖ ∂μ)
            atTop (𝓝 0)

      Exact module and namespace context

      Proof roadmap

      1. 1Construct a decreasing measurable family

        The norm of Tx is continuous, so E_R={x:R≤‖Tx‖₂} is measurable. If R≤S, then E_S⊆E_R.

      2. 2Show that no point survives all tail sets

        For fixed x, choosing R=‖Tx‖₂+1 excludes x. Hence the intersection over all real R is empty.

      3. 3Use decreasing-set integral convergence

        The integrable function ‖H‖ is integrable on E_0. The antitone set-integral theorem gives convergence to its integral over the empty intersection, which is zero.

      Full assumptions and notation

      All objects and hypotheses

      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
      • W is a real normed vector space; no completeness assumption.
      • μ is any measure on P; H:P→W is μ-integrable. The integral itself is real-valued.

      Mathematical proof

      1. Construct a decreasing measurable family

      The norm of Tx is continuous, so E_R={x:R≤‖Tx‖₂} is measurable. If R≤S, then E_S⊆E_R.

      \[E_R=\{x:R\le\|Tx\|_2\},\qquad R\le S\Longrightarrow E_S\subseteq E_R.\]
      Corresponding Lean step

      measurableSet_le; continuous_norm.comp (PiLp.continuous_toLp 2 _); hs_antitone.

      2. Show that no point survives all tail sets

      For fixed x, choosing R=‖Tx‖₂+1 excludes x. Hence the intersection over all real R is empty.

      \[\bigcap_{R\in\mathbb R}E_R=\varnothing.\]
      Corresponding Lean step

      Set.mem_iInter.mp hx (‖WithLp.toLp 2 x‖ + 1) and the resulting impossible inequality.

      3. Use decreasing-set integral convergence

      The integrable function ‖H‖ is integrable on E_0. The antitone set-integral theorem gives convergence to its integral over the empty intersection, which is zero.

      \[\int_{E_R}\|H\|\,d\mu\longrightarrow\int_{\cap_RE_R}\|H\|\,d\mu=0.\]
      Corresponding Lean step

      tendsto_setIntegral_of_antitone hs_measurable hs_antitone ⟨0, hH.norm.integrableOn⟩.

      Lean verification

      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

      Lean proof · tendsto_setIntegral_norm_norm_ge_comp_toLp

      The source first the norm of Tx is continuous, so E_R={x:R≤‖Tx‖₂} is measurable. If R≤S, then E_S⊆E_R. It finishes as follows: The integrable function ‖H‖ is integrable on E_0. The antitone set-integral theorem gives convergence to its integral over the empty intersection, which is zero. Intermediate steps below identify the actual helper calls and the conditions each one needs.

      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

      Download module (.lean)
      theorem tendsto_setIntegral_norm_norm_ge_comp_toLp
          {n : ℕ} {F : Type*} [NormedAddCommGroup F] [NormedSpace ℝ F]
          {μ : Measure (Fin (n + 1) → ℝ)}
          {H : (Fin (n + 1) → ℝ) → F}
          (hH : Integrable H μ) :
          Tendsto
            (fun R : ℝ => ∫ x in
              {x : Fin (n + 1) → ℝ |
                R ≤ ‖(WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1)))‖},
              ‖H x‖ ∂μ)
            atTop (𝓝 0) := by
        let s : ℝ → Set (Fin (n + 1) → ℝ) :=
          fun R => {x | R ≤ ‖(WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1)))‖}
        have hs_measurable : ∀ R, MeasurableSet (s R) := by
          intro R
          exact measurableSet_le measurable_const
            ((continuous_norm.comp (PiLp.continuous_toLp 2 _)).measurable)
        have hs_antitone : Antitone s := by
          intro R S hRS x hx
          exact hRS.trans hx
        have hs_iInter : ⋂ R : ℝ, s R = ∅ := by
          apply Set.Subset.antisymm
          · intro x hx
            have hx' := Set.mem_iInter.mp hx
              (‖(WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1)))‖ + 1)
            simp only [s, Set.mem_ofPred_eq] at hx'
            linarith
          · exact Set.empty_subset _
        have htail := tendsto_setIntegral_of_antitone
          hs_measurable hs_antitone ⟨0, hH.norm.integrableOn⟩
        simpa [s, hs_iInter] using htail

      Exact module and namespace context

      Scope and omitted-condition boundaries
      • No rate of tail decay is given.
      Sources, dependencies, and reuse

      Source and reuse

      Samplinglib parents called

        Mathlib API called (external library)

        • measurableSet_le
        • PiLp.continuous_toLp
        • MeasureTheory.tendsto_setIntegral_of_antitone

        Mathematical sources

        Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

        Samplinglib mathematical lesson

        The trace of a rank-one derivative term is its scalar evaluation

        AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.sum_smulRight_apply_pi_single_eq_apply · theorem · Teaching coverage

        Read this first

        Mathematical statement

        For a finite coordinate type ι, a continuous real linear functional ℓ:(ι→ℝ)→ℝ and a vector g∈(ι→ℝ), the diagonal sum of the rank-one operator v↦ℓ(v)g equals ℓ(g).

        \[\sum_i\bigl((\ell\otimes g)e_i\bigr)_i=\ell(g),\qquad(\ell\otimes g)(v):=\ell(v)g.\]
        Lean statement · sum_smulRight_apply_pi_single_eq_apply

        `smulRight G` constructs the rank-one continuous linear map. The prime in χ′ is merely a variable name here; no scalar function with that derivative is assumed.

        Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

        theorem sum_smulRight_apply_pi_single_eq_apply
            {ι : Type*} [Fintype ι] [DecidableEq ι]
            (χ' : (ι → ℝ) →L[ℝ] ℝ) (G : ι → ℝ) :
            ∑ i, ((χ'.smulRight G) (Pi.single i (1 : ℝ))) i = χ' G

        Exact module and namespace context

        Proof roadmap

        1. 1Identify each diagonal term

          The i-th component of ℓ(e_i)g is ℓ(e_i)g_i. By linearity and commutativity of real multiplication this equals ℓ(g_i e_i).

        2. 2Reassemble the vector inside the linear functional

          Move the finite sum inside ℓ. The standard coordinate expansion gives Σ_i g_i e_i=g, yielding ℓ(g).

        Full assumptions and notation

        All objects and hypotheses

        • ι is a finite type with Fintype and DecidableEq; empty ι is allowed.
        • P=(ι→ℝ), ℓ:P→L[ℝ]ℝ, and g∈P; no differentiability or measure.

        Mathematical proof

        1. Identify each diagonal term

        The i-th component of ℓ(e_i)g is ℓ(e_i)g_i. By linearity and commutativity of real multiplication this equals ℓ(g_i e_i).

        \[\bigl((\ell\otimes g)e_i\bigr)_i=\ell(e_i)g_i=\ell(g_i e_i).\]
        Corresponding Lean step

        ContinuousLinearMap.smulRight_apply; Pi.smul_apply; smul_eq_mul; mul_comm.

        2. Reassemble the vector inside the linear functional

        Move the finite sum inside ℓ. The standard coordinate expansion gives Σ_i g_i e_i=g, yielding ℓ(g).

        \[\sum_i\ell(g_i e_i)=\ell\!\left(\sum_i g_i e_i\right)=\ell(g).\]
        Corresponding Lean step

        map_sum; pi_eq_sum_univ' G.

        Lean verification

        The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

        Lean proof · sum_smulRight_apply_pi_single_eq_apply

        The source first the i-th component of ℓ(e_i)g is ℓ(e_i)g_i. By linearity and commutativity of real multiplication this equals ℓ(g_i e_i). It finishes as follows: Move the finite sum inside ℓ. The standard coordinate expansion gives Σ_i g_i e_i=g, yielding ℓ(g). Intermediate steps below identify the actual helper calls and the conditions each one needs.

        Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

        Download module (.lean)
        theorem sum_smulRight_apply_pi_single_eq_apply
            {ι : Type*} [Fintype ι] [DecidableEq ι]
            (χ' : (ι → ℝ) →L[ℝ] ℝ) (G : ι → ℝ) :
            ∑ i, ((χ'.smulRight G) (Pi.single i (1 : ℝ))) i = χ' G := by
          calc
            ∑ i, ((χ'.smulRight G) (Pi.single i (1 : ℝ))) i =
                ∑ i, χ' ((G i) • Pi.single (M := fun _ : ι => ℝ) i (1 : ℝ)) := by
              apply Finset.sum_congr rfl
              intro i _hi
              simp [ContinuousLinearMap.smulRight_apply, Pi.smul_apply, smul_eq_mul,
                mul_comm]
            _ = χ' (∑ i, (G i) • Pi.single (M := fun _ : ι => ℝ) i (1 : ℝ)) := by
              rw [map_sum]
            _ = χ' G := by rw [← pi_eq_sum_univ' G]

        Exact module and namespace context

        Scope and omitted-condition boundaries
        • Pure linear algebra, not a divergence product theorem by itself.
        Sources, dependencies, and reuse

        Source and reuse

        Samplinglib parents called

          Mathlib API called (external library)

          • ContinuousLinearMap.smulRight_apply
          • map_sum
          • pi_eq_sum_univ'

          Mathematical sources

          Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

          Samplinglib mathematical lesson

          Transport the raw-coordinate trace to Euclidean divergence

          AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.coordinateDivergence_wrapped_toPi_trace_of_hasFDerivAt · theorem · Teaching coverage

          Read this first

          Mathematical statement

          Let ι be finite, P=(ι→ℝ), V=EuclideanSpace ℝ ι, T:P≃L[ℝ]V the canonical coordinate conversion, and W_F=T∘F∘T⁻¹. If F:P→P has Fréchet derivative A:P→L[ℝ]P at x∈P, then Div W_F(Tx)=Σ_i(Ae_i)_i in raw coordinates.

          \[DF(x)=A\quad\Longrightarrow\quad\operatorname{Div}(T\circ F\circ T^{-1})(Tx)=\sum_i(Ae_i^P)_i.\]
          Lean statement · coordinateDivergence_wrapped_toPi_trace_of_hasFDerivAt

          The conclusion evaluates Euclidean divergence at Tx but retains an ordinary raw-Pi trace on the right. It is a pointwise representation bridge, not a measure transport theorem.

          Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

          theorem coordinateDivergence_wrapped_toPi_trace_of_hasFDerivAt
              {ι : Type*} [Fintype ι] [DecidableEq ι]
              {F : (ι → ℝ) → ι → ℝ}
              {F' : (ι → ℝ) →L[ℝ] (ι → ℝ)}
              {x : ι → ℝ}
              (hF : HasFDerivAt F F' x) :
              coordinateDivergence
                  (fun y : EuclideanSpace ℝ ι =>
                    (WithLp.toLp 2 (F (WithLp.ofLp y)) : EuclideanSpace ℝ ι))
                  (WithLp.toLp 2 x : EuclideanSpace ℝ ι) =
                ∑ i, F' (Pi.single i (1 : ℝ)) i

          Exact module and namespace context

          Proof roadmap

          1. 1Transport the derivative through both linear conversions

            The derivative of T⁻¹ is T⁻¹ and the derivative of T is T. Two chain-rule applications give D W_F(Tx)=T∘A∘T⁻¹.

          2. 2Take the Euclidean coordinate trace

            The existing pointwise trace theorem applies to this genuine derivative of W_F.

          3. 3Cancel coordinate representations in each summand

            T⁻¹ sends e_i^V to e_i^P and T preserves coordinate values. Thus each summand becomes (Ae_i^P)_i.

          Full assumptions and notation

          All objects and hypotheses

          • ι is finite with Fintype and DecidableEq; P has its supremum norm and V its ℓ² norm.
          • F:P→P, A:P→L[ℝ]P, x∈P and HasFDerivAt F A x.

          Mathematical proof

          1. Transport the derivative through both linear conversions

          The derivative of T⁻¹ is T⁻¹ and the derivative of T is T. Two chain-rule applications give D W_F(Tx)=T∘A∘T⁻¹.

          \[D W_F(Tx)=T\circ A\circ T^{-1}.\]
          Corresponding Lean step

          PiLp.hasFDerivAt_ofLp; PiLp.hasFDerivAt_toLp; hF.comp ... hofLp; htoLp.comp ... hF_ofLp.

          2. Take the Euclidean coordinate trace

          The existing pointwise trace theorem applies to this genuine derivative of W_F.

          \[\operatorname{Div}W_F(Tx)=\sum_i\bigl(T A T^{-1}e_i^V\bigr)_i.\]
          Corresponding Lean step

          coordinateDivergence_eq_sum_fderiv_apply_of_hasFDerivAt hwrapped.

          3. Cancel coordinate representations in each summand

          T⁻¹ sends e_i^V to e_i^P and T preserves coordinate values. Thus each summand becomes (Ae_i^P)_i.

          \[T^{-1}e_i^V=e_i^P,\qquad(Tv)_i=v_i.\]
          Corresponding Lean step

          continuousLinearEquiv_apply_euclideanSpace_single; ContinuousLinearMap.comp_apply; Finset.sum_congr.

          Lean verification

          The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

          Lean proof · coordinateDivergence_wrapped_toPi_trace_of_hasFDerivAt

          The source first the derivative of T⁻¹ is T⁻¹ and the derivative of T is T. Two chain-rule applications give D W_F(Tx)=T∘A∘T⁻¹. It finishes as follows: T⁻¹ sends e_i^V to e_i^P and T preserves coordinate values. Thus each summand becomes (Ae_i^P)_i. Intermediate steps below identify the actual helper calls and the conditions each one needs.

          Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

          Download module (.lean)
          theorem coordinateDivergence_wrapped_toPi_trace_of_hasFDerivAt
              {ι : Type*} [Fintype ι] [DecidableEq ι]
              {F : (ι → ℝ) → ι → ℝ}
              {F' : (ι → ℝ) →L[ℝ] (ι → ℝ)}
              {x : ι → ℝ}
              (hF : HasFDerivAt F F' x) :
              coordinateDivergence
                  (fun y : EuclideanSpace ℝ ι =>
                    (WithLp.toLp 2 (F (WithLp.ofLp y)) : EuclideanSpace ℝ ι))
                  (WithLp.toLp 2 x : EuclideanSpace ℝ ι) =
                ∑ i, F' (Pi.single i (1 : ℝ)) i := by
            let e : EuclideanSpace ℝ ι ≃L[ℝ] (ι → ℝ) :=
              PiLp.continuousLinearEquiv 2 ℝ (fun _ : ι => ℝ)
            have hofLp : HasFDerivAt (fun y : EuclideanSpace ℝ ι => WithLp.ofLp y)
                e.toContinuousLinearMap (WithLp.toLp 2 x : EuclideanSpace ℝ ι) := by
              simpa [e] using
                (PiLp.hasFDerivAt_ofLp (𝕜 := ℝ) (E := fun _ : ι => ℝ) 2
                  (WithLp.toLp 2 x : EuclideanSpace ℝ ι))
            have hF_ofLp : HasFDerivAt (fun y : EuclideanSpace ℝ ι => F (WithLp.ofLp y))
                (F'.comp e.toContinuousLinearMap) (WithLp.toLp 2 x : EuclideanSpace ℝ ι) := by
              simpa [Function.comp_def] using hF.comp (WithLp.toLp 2 x : EuclideanSpace ℝ ι) hofLp
            have htoLp : HasFDerivAt (fun z : ι → ℝ =>
                  (WithLp.toLp 2 z : EuclideanSpace ℝ ι))
                e.symm.toContinuousLinearMap (F x) := by
              simpa [e] using
                (PiLp.hasFDerivAt_toLp (𝕜 := ℝ) (E := fun _ : ι => ℝ) 2 (F x))
            have hwrapped : HasFDerivAt
                (fun y : EuclideanSpace ℝ ι =>
                  (WithLp.toLp 2 (F (WithLp.ofLp y)) : EuclideanSpace ℝ ι))
                (e.symm.toContinuousLinearMap.comp (F'.comp e.toContinuousLinearMap))
                (WithLp.toLp 2 x : EuclideanSpace ℝ ι) := by
              simpa [Function.comp_def] using htoLp.comp (WithLp.toLp 2 x : EuclideanSpace ℝ ι)
                hF_ofLp
            have htrace := coordinateDivergence_eq_sum_fderiv_apply_of_hasFDerivAt hwrapped
            trans ∑ i, (e.symm.toContinuousLinearMap.comp (F'.comp e.toContinuousLinearMap))
                (EuclideanSpace.single i (1 : ℝ)) i
            · exact htrace
            · refine Finset.sum_congr rfl ?_
              intro i _hi
              have hsingle : e (EuclideanSpace.single i (1 : ℝ)) = Pi.single i (1 : ℝ) := by
                simpa [e] using continuousLinearEquiv_apply_euclideanSpace_single (ι := ι) i
              simp [ContinuousLinearMap.comp_apply, hsingle, e]

          Exact module and namespace context

          Scope and omitted-condition boundaries
          • No Jacobian, change-of-variables factor, or integrability claim is introduced.
          Sources, dependencies, and reuse

          Source and reuse

          Samplinglib parents called

          Mathlib API called (external library)

          • PiLp.hasFDerivAt_ofLp
          • PiLp.hasFDerivAt_toLp
          • HasFDerivAt.comp
          • ContinuousLinearMap.comp_apply

          Mathematical sources

          Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

          Samplinglib mathematical lesson

          Ignore the box boundary and a countable exceptional set

          AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.eventuallyEq_restrict_Icc_of_eqOn_univ_pi_Ioo_diff_countable · theorem · Teaching coverage

          Read this first

          Mathematical statement

          In P=ℝ^(n+1), let a,b be arbitrary endpoints, let β be any type, and let f,g:P→β agree on O outside a countable set s. Then f and g agree almost everywhere for Lebesgue measure restricted to K. No order assumption on a,b and no measurability of f or g is required.

          \[f=g\text{ on }O\setminus s,\quad s\text{ countable}\quad\Longrightarrow\quad f=g\quad\text{a.e. }[\,dx|_K\,].\]
          Lean statement · eventuallyEq_restrict_Icc_of_eqOn_univ_pi_Ioo_diff_countable

          `=ᵐ[volume.restrict K]` is equality almost everywhere, not everywhere on the boundary or exceptional set. The positive dimension is built into Fin(n+1).

          Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

          theorem eventuallyEq_restrict_Icc_of_eqOn_univ_pi_Ioo_diff_countable
              {n : ℕ} {β : Type*}
              {a b : Fin (n + 1) → ℝ}
              {f g : (Fin (n + 1) → ℝ) → β}
              {s : Set (Fin (n + 1) → ℝ)}
              (hs : s.Countable)
              (hfg : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s, f x = g x) :
              f =ᵐ[volume.restrict (Set.Icc a b)] g

          Exact module and namespace context

          Proof roadmap

          1. 1The open and closed boxes agree almost everywhere

            Product Lebesgue measure assigns zero measure to the finite coordinate boundary pieces. Mathlib supplies O=K almost everywhere, including degenerate or empty boxes.

          2. 2Remove the countable set and restrict

            Since d=n+1≥1, volume has no atoms; a countable s is null. For almost every x∈K, x∈O and x∉s, so the assumed equality applies.

          Full assumptions and notation

          All objects and hypotheses

          • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
          • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
          • β is an arbitrary type; f,g:P→β; s⊆P is countable; f(x)=g(x) for every x∈O∖s.
          • No hypothesis a≤b, continuity, or measurability of f and g.

          Mathematical proof

          1. The open and closed boxes agree almost everywhere

          Product Lebesgue measure assigns zero measure to the finite coordinate boundary pieces. Mathlib supplies O=K almost everywhere, including degenerate or empty boxes.

          \[O=K\quad\text{a.e. }[dx].\]
          Corresponding Lean step

          rw [volume_pi]; Measure.univ_pi_Ioo_ae_eq_Icc.

          2. Remove the countable set and restrict

          Since d=n+1≥1, volume has no atoms; a countable s is null. For almost every x∈K, x∈O and x∉s, so the assumed equality applies.

          \[dx(s)=0,\qquad x\in K\Rightarrow x\in O\setminus s\quad\text{a.e.}\]
          Corresponding Lean step

          hs.ae_notMem volume; ae_restrict_iff' measurableSet_Icc; hfg x ⟨hxIoo.mpr hxIcc,hxnot⟩.

          Lean verification

          The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

          Lean proof · eventuallyEq_restrict_Icc_of_eqOn_univ_pi_Ioo_diff_countable

          The source first product Lebesgue measure assigns zero measure to the finite coordinate boundary pieces. Mathlib supplies O=K almost everywhere, including degenerate or empty boxes. It finishes as follows: Since d=n+1≥1, volume has no atoms; a countable s is null. For almost every x∈K, x∈O and x∉s, so the assumed equality applies. Intermediate steps below identify the actual helper calls and the conditions each one needs.

          Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

          Download module (.lean)
          theorem eventuallyEq_restrict_Icc_of_eqOn_univ_pi_Ioo_diff_countable
              {n : ℕ} {β : Type*}
              {a b : Fin (n + 1) → ℝ}
              {f g : (Fin (n + 1) → ℝ) → β}
              {s : Set (Fin (n + 1) → ℝ)}
              (hs : s.Countable)
              (hfg : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s, f x = g x) :
              f =ᵐ[volume.restrict (Set.Icc a b)] g := by
            have hIoo : (Set.univ.pi fun i => Set.Ioo (a i) (b i)) =ᵐ[volume]
                Set.Icc a b := by
              rw [volume_pi]
              exact Measure.univ_pi_Ioo_ae_eq_Icc
            rw [Filter.EventuallyEq, ae_restrict_iff' measurableSet_Icc]
            filter_upwards [hIoo, hs.ae_notMem volume] with x hxIoo hxnot hxIcc
            exact hfg x ⟨hxIoo.mpr hxIcc, hxnot⟩

          Exact module and namespace context

          Scope and omitted-condition boundaries
          • Countable exceptional sets are permitted; the proof does not silently replace them by arbitrary null sets or claim pointwise boundary equality.
          Sources, dependencies, and reuse

          Source and reuse

          Samplinglib parents called

            Mathlib API called (external library)

            • MeasureTheory.volume_pi
            • MeasureTheory.Measure.univ_pi_Ioo_ae_eq_Icc
            • Set.Countable.ae_notMem
            • MeasureTheory.ae_restrict_iff'

            Mathematical sources

            Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

            Samplinglib mathematical lesson

            Pointwise trace transport on an almost-everywhere differentiability set

            AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.coordinateDivergence_wrapped_toPi_trace_ae_of_ae_hasFDerivAt · theorem · Teaching coverage

            Read this first

            Mathematical statement

            For raw P, endpoints a,b, F:P→P and derivative field A, if F has derivative A(x) for almost every x under volume restricted to K, then δF=τ_A almost everywhere on that same restricted measure.

            \[DF(x)=A(x)\text{ a.e. on }K\quad\Longrightarrow\quad\delta F=\tau_A\text{ a.e. on }K.\]
            Lean statement · coordinateDivergence_wrapped_toPi_trace_ae_of_ae_hasFDerivAt

            This wrapper consumes an a.e. derivative hypothesis directly; it does not establish one from boundary or countability arguments.

            Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

            theorem coordinateDivergence_wrapped_toPi_trace_ae_of_ae_hasFDerivAt
                {n : ℕ}
                (a b : Fin (n + 1) → ℝ)
                (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                (F' : (Fin (n + 1) → ℝ) →
                  (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                (hF_ae : ∀ᵐ x ∂volume.restrict (Set.Icc a b), HasFDerivAt F (F' x) x) :
                  (fun x => coordinateDivergence
                    (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                      (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                        EuclideanSpace ℝ (Fin (n + 1))))
                    (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))))
                  =ᵐ[volume.restrict (Set.Icc a b)]
                  fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i

            Exact module and namespace context

            Proof roadmap

            1. 1Apply the pointwise identity where its hypothesis holds

              On the full-measure set of derivative points, the already-proved transport theorem identifies the two real values. Consequently the functions agree a.e. on K.

            Full assumptions and notation

            All objects and hypotheses

            • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
            • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
            • F:P→P and A:P→(P→L[ℝ]P) is a supplied linear-map field. Write δF(x)=Div(T∘F∘T⁻¹)(Tx) and τ_A(x)=Σ_i(A(x)e_i)_i.
            • HasFDerivAt F (A x) x for volume|K-almost every x; no a≤b or integrability assumption.

            Notation and interpretation

            Notation used below

            For a raw field F:P→P, W_F=T∘F∘T⁻¹ and δF(x) is coordinateDivergence W_F at Tx. For a supplied linear-map field A, τ_A is its coordinate trace.

            \[W_F:=T\circ F\circ T^{-1},\qquad\delta F(x):=\operatorname{Div}W_F(Tx),\qquad\tau_A(x):=\sum_i(A(x)e_i)_i.\]

            Mathematical proof

            1. Apply the pointwise identity where its hypothesis holds

            On the full-measure set of derivative points, the already-proved transport theorem identifies the two real values. Consequently the functions agree a.e. on K.

            \[\delta F(x)=\sum_i(A(x)e_i)_i=\tau_A(x)\quad\text{a.e. on }K.\]
            Corresponding Lean step

            filter_upwards [hF_ae]; coordinateDivergence_wrapped_toPi_trace_of_hasFDerivAt hx.

            Lean verification

            The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

            Lean proof · coordinateDivergence_wrapped_toPi_trace_ae_of_ae_hasFDerivAt

            On the full-measure set of derivative points, the already-proved transport theorem identifies the two real values. Consequently the functions agree a.e. on K. The Lean correspondence in that step identifies the exact existing rule or definitional reduction used.

            Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

            Download module (.lean)
            theorem coordinateDivergence_wrapped_toPi_trace_ae_of_ae_hasFDerivAt
                {n : ℕ}
                (a b : Fin (n + 1) → ℝ)
                (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                (F' : (Fin (n + 1) → ℝ) →
                  (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                (hF_ae : ∀ᵐ x ∂volume.restrict (Set.Icc a b), HasFDerivAt F (F' x) x) :
                  (fun x => coordinateDivergence
                    (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                      (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                        EuclideanSpace ℝ (Fin (n + 1))))
                    (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))))
                  =ᵐ[volume.restrict (Set.Icc a b)]
                  fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i := by
              filter_upwards [hF_ae] with x hx
              exact coordinateDivergence_wrapped_toPi_trace_of_hasFDerivAt (ι := Fin (n + 1)) hx

            Exact module and namespace context

            Scope and omitted-condition boundaries
            • A.e. equality alone is not integrability.
            Sources, dependencies, and reuse

            Source and reuse

            Samplinglib parents called

            Mathlib API called (external library)

            No direct Mathlib call recorded; see the Samplinglib parents.

            Mathematical sources

            Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

            Samplinglib mathematical lesson

            Obtain the a.e. trace bridge from derivatives off a countable set

            AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.coordinateDivergence_wrapped_toPi_trace_ae_of_hasFDerivAt_off_countable · theorem · Teaching coverage

            Read this first

            Mathematical statement

            For endpoints a,b, F:P→P and derivative field A, suppose s⊆P is countable and F has derivative A(x) at every x∈O∖s. Then δF=τ_A almost everywhere on K with respect to restricted volume.

            \[DF=A\text{ on }O\setminus s,\ s\text{ countable}\quad\Longrightarrow\quad\delta F=\tau_A\quad\text{a.e. on }K.\]
            Lean statement · coordinateDivergence_wrapped_toPi_trace_ae_of_hasFDerivAt_off_countable

            The name 'off_countable' corresponds to an actual `hs : s.Countable` parameter here. Values of the derivative field on the exceptional set need not be specified by differentiation.

            Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

            theorem coordinateDivergence_wrapped_toPi_trace_ae_of_hasFDerivAt_off_countable
                {n : ℕ}
                (a b : Fin (n + 1) → ℝ)
                (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                (F' : (Fin (n + 1) → ℝ) →
                  (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                  HasFDerivAt F (F' x) x) :
                  (fun x => coordinateDivergence
                    (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                      (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                        EuclideanSpace ℝ (Fin (n + 1))))
                    (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))))
                  =ᵐ[volume.restrict (Set.Icc a b)]
                  fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i

            Exact module and namespace context

            Proof roadmap

            1. 1Identify values in the open good set

              At each x∈O∖s, apply the pointwise transported trace identity to the supplied derivative.

            2. 2Transfer equality to the restricted closed box

              Use the preceding null-boundary/countable-exception transfer theorem to extend this equality in the a.e. sense to K.

            Full assumptions and notation

            All objects and hypotheses

            • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
            • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
            • F:P→P and A:P→(P→L[ℝ]P) is a supplied linear-map field. Write δF(x)=Div(T∘F∘T⁻¹)(Tx) and τ_A(x)=Σ_i(A(x)e_i)_i.
            • s⊆P is countable; HasFDerivAt F (A x) x at every x∈O∖s. No endpoint-order, continuity or integrability assumption.

            Notation and interpretation

            Notation used below

            For a raw field F:P→P, W_F=T∘F∘T⁻¹ and δF(x) is coordinateDivergence W_F at Tx. For a supplied linear-map field A, τ_A is its coordinate trace.

            \[W_F:=T\circ F\circ T^{-1},\qquad\delta F(x):=\operatorname{Div}W_F(Tx),\qquad\tau_A(x):=\sum_i(A(x)e_i)_i.\]

            Mathematical proof

            1. Identify values in the open good set

            At each x∈O∖s, apply the pointwise transported trace identity to the supplied derivative.

            \[\delta F(x)=\tau_A(x)\qquad(x\in O\setminus s).\]
            Corresponding Lean step

            coordinateDivergence_wrapped_toPi_trace_of_hasFDerivAt (Hd x hx).

            2. Transfer equality to the restricted closed box

            Use the preceding null-boundary/countable-exception transfer theorem to extend this equality in the a.e. sense to K.

            \[\delta F=\tau_A\quad\text{a.e. }[dx|_K].\]
            Corresponding Lean step

            eventuallyEq_restrict_Icc_of_eqOn_univ_pi_Ioo_diff_countable hs.

            Lean verification

            The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

            Lean proof · coordinateDivergence_wrapped_toPi_trace_ae_of_hasFDerivAt_off_countable

            The source first at each x∈O∖s, apply the pointwise transported trace identity to the supplied derivative. It finishes as follows: Use the preceding null-boundary/countable-exception transfer theorem to extend this equality in the a.e. sense to K. Intermediate steps below identify the actual helper calls and the conditions each one needs.

            Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

            Download module (.lean)
            theorem coordinateDivergence_wrapped_toPi_trace_ae_of_hasFDerivAt_off_countable
                {n : ℕ}
                (a b : Fin (n + 1) → ℝ)
                (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                (F' : (Fin (n + 1) → ℝ) →
                  (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                  HasFDerivAt F (F' x) x) :
                  (fun x => coordinateDivergence
                    (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                      (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                        EuclideanSpace ℝ (Fin (n + 1))))
                    (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))))
                  =ᵐ[volume.restrict (Set.Icc a b)]
                  fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i :=
              eventuallyEq_restrict_Icc_of_eqOn_univ_pi_Ioo_diff_countable
                (a := a) (b := b) (s := s) hs fun x hx =>
                  coordinateDivergence_wrapped_toPi_trace_of_hasFDerivAt (ι := Fin (n + 1)) (Hd x hx)

            Exact module and namespace context

            Scope and omitted-condition boundaries
            • No differentiability on the box boundary is required.
            Sources, dependencies, and reuse

            Source and reuse

            Samplinglib parents called

            Mathlib API called (external library)

            No direct Mathlib call recorded; see the Samplinglib parents.

            Mathematical sources

            Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

            Samplinglib mathematical lesson

            Transfer trace integrability to coordinate divergence

            AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.integrableOn_coordinateDivergence_wrapped_of_integrableOn_trace_of_hasFDerivAt_off_countable · theorem · Teaching coverage

            Read this first

            Mathematical statement

            Assume F has supplied derivative field A on O outside a countable s and τ_A is integrable on K. Then the wrapped coordinate-divergence function δF is integrable on K.

            \[\tau_A\in L^1(K,dx),\quad DF=A\text{ on }O\setminus s,\quad s\text{ countable}\quad\Longrightarrow\quad\delta F\in L^1(K,dx).\]
            Lean statement · integrableOn_coordinateDivergence_wrapped_of_integrableOn_trace_of_hasFDerivAt_off_countable

            `IntegrableOn` means integrable with respect to the restricted measure. The theorem solves only the representation mismatch; trace integrability is still a premise.

            Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

            theorem integrableOn_coordinateDivergence_wrapped_of_integrableOn_trace_of_hasFDerivAt_off_countable
                {n : ℕ}
                (a b : Fin (n + 1) → ℝ)
                (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                (F' : (Fin (n + 1) → ℝ) →
                  (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                  HasFDerivAt F (F' x) x)
                (Hi_trace : IntegrableOn (fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                  (Set.Icc a b) volume) :
                IntegrableOn
                  (fun x => coordinateDivergence
                    (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                      (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                        EuclideanSpace ℝ (Fin (n + 1))))
                    (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))))
                  (Set.Icc a b) volume

            Exact module and namespace context

            Proof roadmap

            1. 1Obtain the a.e. representation equality

              The off-countable trace bridge gives δF=τ_A a.e. for volume restricted to K.

            2. 2Transfer both measurability and finite integral through a.e. equality

              Integrability is unchanged by replacing a function by an almost-everywhere equal one; apply this to the supplied integrable trace.

            Full assumptions and notation

            All objects and hypotheses

            • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
            • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
            • F:P→P and A:P→(P→L[ℝ]P) is a supplied linear-map field. Write δF(x)=Div(T∘F∘T⁻¹)(Tx) and τ_A(x)=Σ_i(A(x)e_i)_i.
            • s⊆P is countable; derivative A(x) exists at every x∈O∖s.
            • τ_A is integrable on K. Neither a≤b nor continuity of F on K is assumed.

            Notation and interpretation

            Notation used below

            For a raw field F:P→P, W_F=T∘F∘T⁻¹ and δF(x) is coordinateDivergence W_F at Tx. For a supplied linear-map field A, τ_A is its coordinate trace.

            \[W_F:=T\circ F\circ T^{-1},\qquad\delta F(x):=\operatorname{Div}W_F(Tx),\qquad\tau_A(x):=\sum_i(A(x)e_i)_i.\]

            Mathematical proof

            1. Obtain the a.e. representation equality

            The off-countable trace bridge gives δF=τ_A a.e. for volume restricted to K.

            \[\delta F=\tau_A\quad\text{a.e. on }K.\]
            Corresponding Lean step

            coordinateDivergence_wrapped_toPi_trace_ae_of_hasFDerivAt_off_countable a b F F' s hs Hd.

            2. Transfer both measurability and finite integral through a.e. equality

            Integrability is unchanged by replacing a function by an almost-everywhere equal one; apply this to the supplied integrable trace.

            \[\tau_A\in L^1(K),\quad\delta F=\tau_A\text{ a.e.}\Longrightarrow\delta F\in L^1(K).\]
            Corresponding Lean step

            Hi_trace.congr_fun_ae hdiv_ae.symm.

            Lean verification

            The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

            Lean proof · integrableOn_coordinateDivergence_wrapped_of_integrableOn_trace_of_hasFDerivAt_off_countable

            The source first the off-countable trace bridge gives δF=τ_A a.e. for volume restricted to K. It finishes as follows: Integrability is unchanged by replacing a function by an almost-everywhere equal one; apply this to the supplied integrable trace. Intermediate steps below identify the actual helper calls and the conditions each one needs.

            Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

            Download module (.lean)
            theorem integrableOn_coordinateDivergence_wrapped_of_integrableOn_trace_of_hasFDerivAt_off_countable
                {n : ℕ}
                (a b : Fin (n + 1) → ℝ)
                (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                (F' : (Fin (n + 1) → ℝ) →
                  (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                  HasFDerivAt F (F' x) x)
                (Hi_trace : IntegrableOn (fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                  (Set.Icc a b) volume) :
                IntegrableOn
                  (fun x => coordinateDivergence
                    (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                      (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                        EuclideanSpace ℝ (Fin (n + 1))))
                    (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))))
                  (Set.Icc a b) volume := by
              have hdiv_ae := coordinateDivergence_wrapped_toPi_trace_ae_of_hasFDerivAt_off_countable
                a b F F' s hs Hd
              exact Hi_trace.congr_fun_ae hdiv_ae.symm

            Exact module and namespace context

            Scope and omitted-condition boundaries
            • No concrete source-field integrability is established.
            Sources, dependencies, and reuse

            Source and reuse

            Samplinglib parents called

            Mathlib API called (external library)

            • MeasureTheory.IntegrableOn.congr_fun_ae

            Mathematical sources

            Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

            Samplinglib mathematical lesson

            The box divergence formula with an explicit a.e. representation bridge

            AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.integral_coordinateDivergence_toPi_box_of_hasFDerivAt_off_countable · theorem · Teaching coverage

            Read this first

            Mathematical statement

            Let a≤b, let F be continuous on K and have derivative field A on O outside a countable s. Assume explicitly both δF=τ_A a.e. on K and integrability of δF on K. Then its box integral equals the signed sum Φ_a,b(F) of upper minus lower face integrals.

            \[\int_K\delta F(x)\,dx=\Phi_{a,b}(F),\qquad \Phi_{a,b}(F):=\sum_{i=0}^{d-1}\left[\int_{K_{\widehat i}}F_i(I_i^{b_i}z)\,dz-\int_{K_{\widehat i}}F_i(I_i^{a_i}z)\,dz\right]\]
            Lean statement · integral_coordinateDivergence_toPi_box_of_hasFDerivAt_off_countable

            This ASTIS theorem is an interface wrapper around Mathlib's integration theorem, not a fresh proof of the divergence theorem. It deliberately still takes `hdiv_ae` and `Hi` as assumptions.

            Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

            theorem integral_coordinateDivergence_toPi_box_of_hasFDerivAt_off_countable
                {n : ℕ}
                (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                (F' : (Fin (n + 1) → ℝ) →
                  (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                (Hc : ContinuousOn F (Set.Icc a b))
                (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                  HasFDerivAt F (F' x) x)
                (hdiv_ae :
                  (fun x => coordinateDivergence
                    (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                      (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                        EuclideanSpace ℝ (Fin (n + 1))))
                    (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))))
                  =ᵐ[volume.restrict (Set.Icc a b)]
                  fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                (Hi : IntegrableOn
                  (fun x => coordinateDivergence
                    (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                      (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                        EuclideanSpace ℝ (Fin (n + 1))))
                    (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))))
                  (Set.Icc a b) volume) :
                ∫ x in Set.Icc a b, coordinateDivergence
                    (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                      (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                        EuclideanSpace ℝ (Fin (n + 1))))
                    (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) =
                  ∑ i : Fin (n + 1),
                    ((∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                        F (i.insertNth (b i) x) i) -
                      ∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                        F (i.insertNth (a i) x) i)

            Exact module and namespace context

            Proof roadmap

            1. 1Transfer the given integrability to the trace

              The supplied a.e. equality carries integrability of δF to τ_A.

            2. 2Replace the integrand by its trace representative

              A.e. equal functions have equal Bochner integrals for the restricted measure.

            3. 3Invoke the exact existing finite-box divergence theorem

              Mathlib's theorem uses continuity on K, derivatives on O∖s, countability, endpoint order, and integrability of the trace. It returns exactly the upper-minus-lower face formula, including degenerate boxes.

            Full assumptions and notation

            All objects and hypotheses

            • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
            • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
            • F:P→P and A:P→(P→L[ℝ]P) is a supplied linear-map field. Write δF(x)=Div(T∘F∘T⁻¹)(Tx) and τ_A(x)=Σ_i(A(x)e_i)_i.
            • For each i, K_hat_i=∏_{j≠i}[a_j,b_j] is parametrized by Fin n→ℝ; I_i^c inserts c in coordinate i, retaining the other coordinates in their original order. Φ_a,b(F) is the sum of upper-face integrals of F_i minus lower-face integrals of F_i.
            • a≤b coordinatewise; s⊆P countable; F continuous on K and HasFDerivAt F (A x) x on O∖s.
            • δF=τ_A a.e. on K is an explicit premise (hdiv_ae). δF is integrable on K (Hi).

            Notation and interpretation

            Notation used below

            For a raw field F:P→P, W_F=T∘F∘T⁻¹ and δF(x) is coordinateDivergence W_F at Tx. For a supplied linear-map field A, τ_A is its coordinate trace.

            \[W_F:=T\circ F\circ T^{-1},\qquad\delta F(x):=\operatorname{Div}W_F(Tx),\qquad\tau_A(x):=\sum_i(A(x)e_i)_i.\]

            Mathematical proof

            1. Transfer the given integrability to the trace

            The supplied a.e. equality carries integrability of δF to τ_A.

            \[\delta F\in L^1(K),\quad\delta F=\tau_A\text{ a.e.}\Longrightarrow\tau_A\in L^1(K).\]
            Corresponding Lean step

            Hi.congr_fun_ae hdiv_ae.

            2. Replace the integrand by its trace representative

            A.e. equal functions have equal Bochner integrals for the restricted measure.

            \[\int_K\delta F\,dx=\int_K\tau_A\,dx.\]
            Corresponding Lean step

            MeasureTheory.integral_congr_ae hdiv_ae.

            3. Invoke the exact existing finite-box divergence theorem

            Mathlib's theorem uses continuity on K, derivatives on O∖s, countability, endpoint order, and integrability of the trace. It returns exactly the upper-minus-lower face formula, including degenerate boxes.

            \[\int_K\tau_A\,dx=\sum_i\left(\int_{K_{\widehat i}}F_i(I_i^{b_i}z)\,dz-\int_{K_{\widehat i}}F_i(I_i^{a_i}z)\,dz\right).\]
            Corresponding Lean step

            MeasureTheory.integral_divergence_of_hasFDerivAt_off_countable hle F F' s hs Hc Hd Hi_trace.

            Lean verification

            The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

            Lean proof · integral_coordinateDivergence_toPi_box_of_hasFDerivAt_off_countable

            The source first the supplied a.e. equality carries integrability of δF to τ_A. It finishes as follows: Mathlib's theorem uses continuity on K, derivatives on O∖s, countability, endpoint order, and integrability of the trace. It returns exactly the upper-minus-lower face formula, including degenerate boxes. Intermediate steps below identify the actual helper calls and the conditions each one needs.

            Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

            Download module (.lean)
            theorem integral_coordinateDivergence_toPi_box_of_hasFDerivAt_off_countable
                {n : ℕ}
                (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                (F' : (Fin (n + 1) → ℝ) →
                  (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                (Hc : ContinuousOn F (Set.Icc a b))
                (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                  HasFDerivAt F (F' x) x)
                (hdiv_ae :
                  (fun x => coordinateDivergence
                    (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                      (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                        EuclideanSpace ℝ (Fin (n + 1))))
                    (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))))
                  =ᵐ[volume.restrict (Set.Icc a b)]
                  fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                (Hi : IntegrableOn
                  (fun x => coordinateDivergence
                    (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                      (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                        EuclideanSpace ℝ (Fin (n + 1))))
                    (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))))
                  (Set.Icc a b) volume) :
                ∫ x in Set.Icc a b, coordinateDivergence
                    (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                      (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                        EuclideanSpace ℝ (Fin (n + 1))))
                    (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) =
                  ∑ i : Fin (n + 1),
                    ((∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                        F (i.insertNth (b i) x) i) -
                      ∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                        F (i.insertNth (a i) x) i) := by
              have Hi_trace : IntegrableOn (fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                  (Set.Icc a b) volume :=
                Hi.congr_fun_ae hdiv_ae
              calc
                (∫ x in Set.Icc a b, coordinateDivergence
                    (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                      (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                        EuclideanSpace ℝ (Fin (n + 1))))
                    (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1)))) =
                    ∫ x in Set.Icc a b, ∑ i, F' x (Pi.single i (1 : ℝ)) i := by
                      exact MeasureTheory.integral_congr_ae hdiv_ae
                _ = ∑ i : Fin (n + 1),
                    ((∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                        F (i.insertNth (b i) x) i) -
                      ∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                        F (i.insertNth (a i) x) i) := by
                      exact MeasureTheory.integral_divergence_of_hasFDerivAt_off_countable
                        (a := a) (b := b) hle F F' s hs Hc Hd Hi_trace

            Exact module and namespace context

            Scope and omitted-condition boundaries
            • The signed face sum is not assumed zero. This is a finite-box formula, not a whole-space or weighted integration-by-parts theorem.
            Sources, dependencies, and reuse

            Source and reuse

            Samplinglib parents called

            Mathlib API called (external library)

            • MeasureTheory.IntegrableOn.congr_fun_ae
            • MeasureTheory.integral_congr_ae
            • MeasureTheory.integral_divergence_of_hasFDerivAt_off_countable

            Mathematical sources

            Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

            Samplinglib mathematical lesson

            The box divergence formula from trace integrability

            AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.integral_coordinateDivergence_toPi_box_of_integrableOn_trace_of_hasFDerivAt_off_countable · theorem · Teaching coverage

            Read this first

            Mathematical statement

            Let a≤b. If F is continuous on K, has derivative field A on O outside a countable s, and τ_A is integrable on K, then the box integral of δF equals Φ_a,b(F), the upper-minus-lower signed face sum.

            \[\int_K\delta F\,dx=\Phi_{a,b}(F),\qquad \Phi_{a,b}(F):=\sum_{i=0}^{d-1}\left[\int_{K_{\widehat i}}F_i(I_i^{b_i}z)\,dz-\int_{K_{\widehat i}}F_i(I_i^{a_i}z)\,dz\right]\]
            Lean statement · integral_coordinateDivergence_toPi_box_of_integrableOn_trace_of_hasFDerivAt_off_countable

            This version removes two caller obligations by proving them locally, but does not remove the explicit trace-integrability premise.

            Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

            theorem integral_coordinateDivergence_toPi_box_of_integrableOn_trace_of_hasFDerivAt_off_countable
                {n : ℕ}
                (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                (F' : (Fin (n + 1) → ℝ) →
                  (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                (Hc : ContinuousOn F (Set.Icc a b))
                (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                  HasFDerivAt F (F' x) x)
                (Hi_trace : IntegrableOn (fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                  (Set.Icc a b) volume) :
                ∫ x in Set.Icc a b, coordinateDivergence
                    (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                      (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                        EuclideanSpace ℝ (Fin (n + 1))))
                    (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) =
                  ∑ i : Fin (n + 1),
                    ((∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                        F (i.insertNth (b i) x) i) -
                      ∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                        F (i.insertNth (a i) x) i)

            Exact module and namespace context

            Proof roadmap

            1. 1Derive the a.e. representation equality

              The off-countable derivative hypothesis produces δF=τ_A a.e. on K.

            2. 2Derive coordinate-divergence integrability

              Transfer the assumed trace integrability to δF through that equality.

            3. 3Supply the two derived inputs to the box formula

              The earlier wrapper now applies with the original endpoint, continuity, derivative and countability data plus the derived equality and integrability.

            Full assumptions and notation

            All objects and hypotheses

            • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
            • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
            • F:P→P and A:P→(P→L[ℝ]P) is a supplied linear-map field. Write δF(x)=Div(T∘F∘T⁻¹)(Tx) and τ_A(x)=Σ_i(A(x)e_i)_i.
            • a≤b coordinatewise (zero-width coordinates are allowed).
            • s⊆P is countable; F is continuous on K; for every x∈O∖s, HasFDerivAt F (A x) x.
            • τ_A is integrable on K with respect to volume.
            • For each i, K_hat_i=∏_{j≠i}[a_j,b_j] is parametrized by Fin n→ℝ; I_i^c inserts c in coordinate i, retaining the other coordinates in their original order. Φ_a,b(F) is the sum of upper-face integrals of F_i minus lower-face integrals of F_i.

            Notation and interpretation

            Notation used below

            For a raw field F:P→P, W_F=T∘F∘T⁻¹ and δF(x) is coordinateDivergence W_F at Tx. For a supplied linear-map field A, τ_A is its coordinate trace.

            \[W_F:=T\circ F\circ T^{-1},\qquad\delta F(x):=\operatorname{Div}W_F(Tx),\qquad\tau_A(x):=\sum_i(A(x)e_i)_i.\]

            Mathematical proof

            1. Derive the a.e. representation equality

            The off-countable derivative hypothesis produces δF=τ_A a.e. on K.

            \[\delta F=\tau_A\quad\text{a.e. on }K.\]
            Corresponding Lean step

            coordinateDivergence_wrapped_toPi_trace_ae_of_hasFDerivAt_off_countable.

            2. Derive coordinate-divergence integrability

            Transfer the assumed trace integrability to δF through that equality.

            \[\tau_A\in L^1(K)\Longrightarrow\delta F\in L^1(K).\]
            Corresponding Lean step

            integrableOn_coordinateDivergence_wrapped_of_integrableOn_trace_of_hasFDerivAt_off_countable.

            3. Supply the two derived inputs to the box formula

            The earlier wrapper now applies with the original endpoint, continuity, derivative and countability data plus the derived equality and integrability.

            \[\int_K\delta F\,dx=\Phi_{a,b}(F).\]
            Corresponding Lean step

            integral_coordinateDivergence_toPi_box_of_hasFDerivAt_off_countable ... hdiv_ae Hi_coord.

            Lean verification

            The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

            Lean proof · integral_coordinateDivergence_toPi_box_of_integrableOn_trace_of_hasFDerivAt_off_countable

            The source first the off-countable derivative hypothesis produces δF=τ_A a.e. on K. It finishes as follows: The earlier wrapper now applies with the original endpoint, continuity, derivative and countability data plus the derived equality and integrability. Intermediate steps below identify the actual helper calls and the conditions each one needs.

            Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

            Download module (.lean)
            theorem integral_coordinateDivergence_toPi_box_of_integrableOn_trace_of_hasFDerivAt_off_countable
                {n : ℕ}
                (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                (F' : (Fin (n + 1) → ℝ) →
                  (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                (Hc : ContinuousOn F (Set.Icc a b))
                (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                  HasFDerivAt F (F' x) x)
                (Hi_trace : IntegrableOn (fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                  (Set.Icc a b) volume) :
                ∫ x in Set.Icc a b, coordinateDivergence
                    (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                      (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                        EuclideanSpace ℝ (Fin (n + 1))))
                    (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) =
                  ∑ i : Fin (n + 1),
                    ((∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                        F (i.insertNth (b i) x) i) -
                      ∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                        F (i.insertNth (a i) x) i) := by
              have hdiv_ae := coordinateDivergence_wrapped_toPi_trace_ae_of_hasFDerivAt_off_countable
                a b F F' s hs Hd
              have Hi_coord :=
                integrableOn_coordinateDivergence_wrapped_of_integrableOn_trace_of_hasFDerivAt_off_countable
                a b F F' s hs Hd Hi_trace
              exact integral_coordinateDivergence_toPi_box_of_hasFDerivAt_off_countable
                a b hle F F' s hs Hc Hd hdiv_ae Hi_coord

            Exact module and namespace context

            Scope and omitted-condition boundaries
            • No boundary cancellation is asserted.
            Sources, dependencies, and reuse

            Source and reuse

            Samplinglib parents called

            Mathlib API called (external library)

            No direct Mathlib call recorded; see the Samplinglib parents.

            Mathematical sources

            Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

            Samplinglib mathematical lesson

            Zero normal components make the signed face sum zero

            AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.signedFaceTermSum_eq_zero_of_boundary_component_eq_zero · theorem · Teaching coverage

            Read this first

            Mathematical statement

            For arbitrary endpoints a,b and field F:P→P, suppose F_i(I_i^{b_i}z)=0 and F_i(I_i^{a_i}z)=0 for every coordinate i and every z∈ℝ^n, not merely z in its face box. Then the signed face sum Φ_a,b(F) is zero.

            \[\bigl[\forall i,z,\ F_i(I_i^{b_i}z)=F_i(I_i^{a_i}z)=0\bigr]\Longrightarrow\Phi_{a,b}(F)=0,\qquad \Phi_{a,b}(F):=\sum_{i=0}^{d-1}\left[\int_{K_{\widehat i}}F_i(I_i^{b_i}z)\,dz-\int_{K_{\widehat i}}F_i(I_i^{a_i}z)\,dz\right]\]
            Lean statement · signedFaceTermSum_eq_zero_of_boundary_component_eq_zero

            The quantified boundary assumptions are stronger than a.e. or face-box-only vanishing. The theorem only computes the face sum.

            Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

            theorem signedFaceTermSum_eq_zero_of_boundary_component_eq_zero
                {n : ℕ}
                (a b : Fin (n + 1) → ℝ)
                (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                (hupper : ∀ (i : Fin (n + 1)) (x : Fin n → ℝ),
                  F (i.insertNth (b i) x) i = 0)
                (hlower : ∀ (i : Fin (n + 1)) (x : Fin n → ℝ),
                  F (i.insertNth (a i) x) i = 0) :
                ∑ i : Fin (n + 1),
                    ((∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                        F (i.insertNth (b i) x) i) -
                      ∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                        F (i.insertNth (a i) x) i) = 0

            Exact module and namespace context

            Proof roadmap

            1. 1Integrate zero on each face and sum

              The two assumed zero functions have zero integrals over their corresponding face boxes. Every upper-minus-lower difference is 0−0, and the finite sum is zero.

            Full assumptions and notation

            All objects and hypotheses

            • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
            • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
            • F:P→P is arbitrary.
            • For each i, K_hat_i=∏_{j≠i}[a_j,b_j] is parametrized by Fin n→ℝ; I_i^c inserts c in coordinate i, retaining the other coordinates in their original order. Φ_a,b(F) is the sum of upper-face integrals of F_i minus lower-face integrals of F_i.
            • No a≤b, continuity, differentiability or integrability assumption.
            • Both upper and lower normal-component values vanish on their entire coordinate hyperplanes: ∀i, ∀z∈Fin n→ℝ.

            Mathematical proof

            1. Integrate zero on each face and sum

            The two assumed zero functions have zero integrals over their corresponding face boxes. Every upper-minus-lower difference is 0−0, and the finite sum is zero.

            \[\forall i,\quad \int_{K_{\widehat i}}F_i(I_i^{b_i}z)\,dz=\int_{K_{\widehat i}}F_i(I_i^{a_i}z)\,dz=0,\qquad\Phi_{a,b}(F)=\sum_i(0-0)=0.\]
            Corresponding Lean step

            simp [hupper, hlower] rewrites the actual integrands to zero.

            Lean verification

            The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

            Lean proof · signedFaceTermSum_eq_zero_of_boundary_component_eq_zero

            The two assumed zero functions have zero integrals over their corresponding face boxes. Every upper-minus-lower difference is 0−0, and the finite sum is zero. The Lean correspondence in that step identifies the exact existing rule or definitional reduction used.

            Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

            Download module (.lean)
            theorem signedFaceTermSum_eq_zero_of_boundary_component_eq_zero
                {n : ℕ}
                (a b : Fin (n + 1) → ℝ)
                (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                (hupper : ∀ (i : Fin (n + 1)) (x : Fin n → ℝ),
                  F (i.insertNth (b i) x) i = 0)
                (hlower : ∀ (i : Fin (n + 1)) (x : Fin n → ℝ),
                  F (i.insertNth (a i) x) i = 0) :
                ∑ i : Fin (n + 1),
                    ((∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                        F (i.insertNth (b i) x) i) -
                      ∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                        F (i.insertNth (a i) x) i) = 0 := by
              simp [hupper, hlower]

            Exact module and namespace context

            Scope and omitted-condition boundaries
            • No volume-integral identity is concluded.
            Sources, dependencies, and reuse

            Source and reuse

            Samplinglib parents called

              Mathlib API called (external library)

              • MeasureTheory.integral_zero
              • Finset.sum_const_zero

              Mathematical sources

              • Current ASTIS source — Exact statement and actual proof/construction authority; raw code intentionally omitted from this packet.
              • Existing curated module card — Existing declaration-specific attribution entry, read as documentation without a new source-equivalence verdict.
              • Existing focused test — Exact named declaration invocation located in an existing example; no test was run.

              Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

              Samplinglib mathematical lesson

              Update-form boundary zeros cancel the face sum

              AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.signedFaceTermSum_eq_zero_of_update_boundary_component_eq_zero · theorem · Teaching coverage

              Read this first

              Mathematical statement

              For endpoints a,b and arbitrary F:P→P, assume the i-th component of F becomes zero whenever coordinate i of any x∈P is replaced by b_i, and likewise by a_i. Then Φ_a,b(F)=0.

              \[\forall i,x,\ F_i(x[i\leftarrow b_i])=F_i(x[i\leftarrow a_i])=0\quad\Longrightarrow\quad\Phi_{a,b}(F)=0.\]
              Lean statement · signedFaceTermSum_eq_zero_of_update_boundary_component_eq_zero

              `Function.update` replaces one entry of a full vector; `Fin.insertNth` inserts one entry into an (n)-coordinate vector. The proof relates these representations.

              Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

              theorem signedFaceTermSum_eq_zero_of_update_boundary_component_eq_zero
                  {n : ℕ}
                  (a b : Fin (n + 1) → ℝ)
                  (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                  (hupper : ∀ (i : Fin (n + 1)) (x : Fin (n + 1) → ℝ),
                    F (Function.update x i (b i)) i = 0)
                  (hlower : ∀ (i : Fin (n + 1)) (x : Fin (n + 1) → ℝ),
                    F (Function.update x i (a i)) i = 0) :
                  ∑ i : Fin (n + 1),
                      ((∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                          F (i.insertNth (b i) x) i) -
                        ∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                          F (i.insertNth (a i) x) i) = 0

              Exact module and namespace context

              Proof roadmap

              1. 1Convert updates to the inserted-face representation

                An inserted face point already has coordinate b_i or a_i, so updating that coordinate to the same value changes nothing. The hypotheses therefore imply the inserted-face zero assumptions.

              2. 2Reuse the zero-face evaluation

                The converted upper and lower component identities are exactly the inputs of the preceding face-sum theorem.

              Full assumptions and notation

              All objects and hypotheses

              • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
              • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
              • F:P→P is arbitrary.
              • For each i, K_hat_i=∏_{j≠i}[a_j,b_j] is parametrized by Fin n→ℝ; I_i^c inserts c in coordinate i, retaining the other coordinates in their original order. Φ_a,b(F) is the sum of upper-face integrals of F_i minus lower-face integrals of F_i.
              • No a≤b, continuity, differentiability or integrability assumption.
              • The update zero assumptions hold for every i and every full vector x∈P.

              Notation and interpretation

              Notation used below

              For each i, K_hat_i=∏_{j≠i}[a_j,b_j] is parametrized by Fin n→ℝ; I_i^c inserts c in coordinate i, retaining the other coordinates in their original order. Φ_a,b(F) is the sum of upper-face integrals of F_i minus lower-face integrals of F_i.

              \[\Phi_{a,b}(F):=\sum_{i=0}^{d-1}\left[\int_{K_{\widehat i}}F_i(I_i^{b_i}z)\,dz-\int_{K_{\widehat i}}F_i(I_i^{a_i}z)\,dz\right]\]

              Mathematical proof

              1. Convert updates to the inserted-face representation

              An inserted face point already has coordinate b_i or a_i, so updating that coordinate to the same value changes nothing. The hypotheses therefore imply the inserted-face zero assumptions.

              \[I_i^{c}z[i\leftarrow c]=I_i^{c}z,\qquad c\in\{a_i,b_i\}.\]
              Corresponding Lean step

              Function.update_eq_self; apply hupper and hlower to the corresponding i.insertNth vectors.

              2. Reuse the zero-face evaluation

              The converted upper and lower component identities are exactly the inputs of the preceding face-sum theorem.

              \[\Phi_{a,b}(F)=0.\]
              Corresponding Lean step

              signedFaceTermSum_eq_zero_of_boundary_component_eq_zero a b F.

              Lean verification

              The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

              Lean proof · signedFaceTermSum_eq_zero_of_update_boundary_component_eq_zero

              The source first an inserted face point already has coordinate b_i or a_i, so updating that coordinate to the same value changes nothing. The hypotheses therefore imply the inserted-face zero assumptions. It finishes as follows: The converted upper and lower component identities are exactly the inputs of the preceding face-sum theorem. Intermediate steps below identify the actual helper calls and the conditions each one needs.

              Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

              Download module (.lean)
              theorem signedFaceTermSum_eq_zero_of_update_boundary_component_eq_zero
                  {n : ℕ}
                  (a b : Fin (n + 1) → ℝ)
                  (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                  (hupper : ∀ (i : Fin (n + 1)) (x : Fin (n + 1) → ℝ),
                    F (Function.update x i (b i)) i = 0)
                  (hlower : ∀ (i : Fin (n + 1)) (x : Fin (n + 1) → ℝ),
                    F (Function.update x i (a i)) i = 0) :
                  ∑ i : Fin (n + 1),
                      ((∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                          F (i.insertNth (b i) x) i) -
                        ∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                          F (i.insertNth (a i) x) i) = 0 :=
                signedFaceTermSum_eq_zero_of_boundary_component_eq_zero a b F
                  (fun i x => by
                    simpa [Function.update_eq_self] using hupper i (i.insertNth (b i) x))
                  (fun i x => by
                    simpa [Function.update_eq_self] using hlower i (i.insertNth (a i) x))

              Exact module and namespace context

              Scope and omitted-condition boundaries
              • No regularity result is supplied.
              Sources, dependencies, and reuse

              Source and reuse

              Samplinglib parents called

              Mathlib API called (external library)

              • Function.update_eq_self

              Mathematical sources

              Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

              Samplinglib mathematical lesson

              Vanishing outside the open box forces both boundary component zeros

              AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.update_boundary_component_eq_zero_of_eq_zero_off_univ_pi_Ioo · theorem · Teaching coverage

              Read this first

              Mathematical statement

              For arbitrary endpoints a,b and F:P→P, assume F(x)=0 at every x∉O. Then for every i and every x∈P, replacing x_i by either b_i or a_i makes the i-th component of F vanish.

              \[F|_{P\setminus O}=0\Longrightarrow\bigl[\forall i,x,\ F_i(x[i\leftarrow b_i])=0\ \land\ F_i(x[i\leftarrow a_i])=0\bigr].\]
              Lean statement · update_boundary_component_eq_zero_of_eq_zero_off_univ_pi_Ioo

              The output is a conjunction of two universally quantified statements, upper and lower. It does not require differentiability on the boundary.

              Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

              theorem update_boundary_component_eq_zero_of_eq_zero_off_univ_pi_Ioo
                  {n : ℕ}
                  (a b : Fin (n + 1) → ℝ)
                  (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                  (hoff : ∀ x ∉ (Set.univ.pi fun i => Set.Ioo (a i) (b i)), F x = 0) :
                  (∀ (i : Fin (n + 1)) (x : Fin (n + 1) → ℝ),
                      F (Function.update x i (b i)) i = 0) ∧
                    (∀ (i : Fin (n + 1)) (x : Fin (n + 1) → ℝ),
                      F (Function.update x i (a i)) i = 0)

              Exact module and namespace context

              Proof roadmap

              1. 1An endpoint update cannot lie in the open box

                Membership in O after an upper update would require b_i<b_i; after a lower update it would require a_i<a_i. Both are impossible, independently of the other coordinates.

              2. 2Apply whole-vector vanishing and project

                The off-box assumption gives F equal to the zero vector at each update. Projecting to coordinate i gives both claimed scalar zeros.

              Full assumptions and notation

              All objects and hypotheses

              • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
              • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
              • F:P→P; ∀x∉O, F(x)=0. No endpoint-order or regularity hypothesis.

              Mathematical proof

              1. An endpoint update cannot lie in the open box

              Membership in O after an upper update would require b_i<b_i; after a lower update it would require a_i<a_i. Both are impossible, independently of the other coordinates.

              \[x[i\leftarrow b_i]\notin O,\qquad x[i\leftarrow a_i]\notin O.\]
              Corresponding Lean step

              Apply Pi-box membership at coordinate i; lt_irrefl contradicts the resulting strict self-inequality.

              2. Apply whole-vector vanishing and project

              The off-box assumption gives F equal to the zero vector at each update. Projecting to coordinate i gives both claimed scalar zeros.

              \[F(x[i\leftarrow c])=0\Longrightarrow F_i(x[i\leftarrow c])=0,\quad c=a_i,b_i.\]
              Corresponding Lean step

              congrArg (fun y => y i) (hoff ... hxnot) in both branches.

              Lean verification

              The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

              Lean proof · update_boundary_component_eq_zero_of_eq_zero_off_univ_pi_Ioo

              The source first membership in O after an upper update would require b_i<b_i; after a lower update it would require a_i<a_i. Both are impossible, independently of the other coordinates. It finishes as follows: The off-box assumption gives F equal to the zero vector at each update. Projecting to coordinate i gives both claimed scalar zeros. Intermediate steps below identify the actual helper calls and the conditions each one needs.

              Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

              Download module (.lean)
              theorem update_boundary_component_eq_zero_of_eq_zero_off_univ_pi_Ioo
                  {n : ℕ}
                  (a b : Fin (n + 1) → ℝ)
                  (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                  (hoff : ∀ x ∉ (Set.univ.pi fun i => Set.Ioo (a i) (b i)), F x = 0) :
                  (∀ (i : Fin (n + 1)) (x : Fin (n + 1) → ℝ),
                      F (Function.update x i (b i)) i = 0) ∧
                    (∀ (i : Fin (n + 1)) (x : Fin (n + 1) → ℝ),
                      F (Function.update x i (a i)) i = 0) := by
                constructor
                · intro i x
                  have hxnot : Function.update x i (b i) ∉
                      (Set.univ.pi fun j => Set.Ioo (a j) (b j)) := by
                    intro hx
                    have hlt : b i < b i := by
                      simpa using (hx i (Set.mem_univ _)).2
                    exact (lt_irrefl (b i)) hlt
                  exact congrArg (fun y => y i) (hoff (Function.update x i (b i)) hxnot)
                · intro i x
                  have hxnot : Function.update x i (a i) ∉
                      (Set.univ.pi fun j => Set.Ioo (a j) (b j)) := by
                    intro hx
                    have hlt : a i < a i := by
                      simpa using (hx i (Set.mem_univ _)).1
                    exact (lt_irrefl (a i)) hlt
                  exact congrArg (fun y => y i) (hoff (Function.update x i (a i)) hxnot)

              Exact module and namespace context

              Scope and omitted-condition boundaries
              • Off-open-box vanishing is assumed, not derived from decay.
              Sources, dependencies, and reuse

              Source and reuse

              Samplinglib parents called

                Mathlib API called (external library)

                • Function.update

                Mathematical sources

                • Current ASTIS source — Exact statement and actual proof/construction authority; raw code intentionally omitted from this packet.
                • Existing curated module card — Existing declaration-specific attribution entry, read as documentation without a new source-equivalence verdict.
                • Existing focused test — Exact named declaration invocation located in an existing example; no test was run.

                Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                Samplinglib mathematical lesson

                Off-open-box vanishing cancels the signed face sum

                AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.signedFaceTermSum_eq_zero_of_eq_zero_off_univ_pi_Ioo · theorem · Teaching coverage

                Read this first

                Mathematical statement

                For arbitrary endpoints a,b and F:P→P with F=0 outside O, the signed face sum Φ_a,b(F) is zero.

                \[F|_{P\setminus O}=0\quad\Longrightarrow\quad\Phi_{a,b}(F)=0.\]
                Lean statement · signedFaceTermSum_eq_zero_of_eq_zero_off_univ_pi_Ioo

                This assembles two boundary lemmas. It contains no divergence-integrability assumption because it concludes only a face-sum equality.

                Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                theorem signedFaceTermSum_eq_zero_of_eq_zero_off_univ_pi_Ioo
                    {n : ℕ}
                    (a b : Fin (n + 1) → ℝ)
                    (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                    (hoff : ∀ x ∉ (Set.univ.pi fun i => Set.Ioo (a i) (b i)), F x = 0) :
                    ∑ i : Fin (n + 1),
                        ((∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                            F (i.insertNth (b i) x) i) -
                          ∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                            F (i.insertNth (a i) x) i) = 0

                Exact module and namespace context

                Proof roadmap

                1. 1Produce both update-boundary zero statements

                  An endpoint update lies outside O, so the preceding theorem gives its upper and lower component zeros.

                2. 2Cancel the faces

                  Feed those two boundary statements into the update-shaped face-sum theorem.

                Full assumptions and notation

                All objects and hypotheses

                • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                • F:P→P is arbitrary.
                • For each i, K_hat_i=∏_{j≠i}[a_j,b_j] is parametrized by Fin n→ℝ; I_i^c inserts c in coordinate i, retaining the other coordinates in their original order. Φ_a,b(F) is the sum of upper-face integrals of F_i minus lower-face integrals of F_i.
                • No a≤b, continuity, differentiability or integrability assumption.
                • F(x)=0 for every x∉O.

                Notation and interpretation

                Notation used below

                For each i, K_hat_i=∏_{j≠i}[a_j,b_j] is parametrized by Fin n→ℝ; I_i^c inserts c in coordinate i, retaining the other coordinates in their original order. Φ_a,b(F) is the sum of upper-face integrals of F_i minus lower-face integrals of F_i.

                \[\Phi_{a,b}(F):=\sum_{i=0}^{d-1}\left[\int_{K_{\widehat i}}F_i(I_i^{b_i}z)\,dz-\int_{K_{\widehat i}}F_i(I_i^{a_i}z)\,dz\right]\]

                Mathematical proof

                1. Produce both update-boundary zero statements

                An endpoint update lies outside O, so the preceding theorem gives its upper and lower component zeros.

                \[F|_{P\setminus O}=0\Longrightarrow F_i(x[i\leftarrow a_i])=F_i(x[i\leftarrow b_i])=0.\]
                Corresponding Lean step

                update_boundary_component_eq_zero_of_eq_zero_off_univ_pi_Ioo a b F hoff.

                2. Cancel the faces

                Feed those two boundary statements into the update-shaped face-sum theorem.

                \[\Phi_{a,b}(F)=0.\]
                Corresponding Lean step

                signedFaceTermSum_eq_zero_of_update_boundary_component_eq_zero ... hbdry.1 hbdry.2.

                Lean verification

                The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                Lean proof · signedFaceTermSum_eq_zero_of_eq_zero_off_univ_pi_Ioo

                The source first an endpoint update lies outside O, so the preceding theorem gives its upper and lower component zeros. It finishes as follows: Feed those two boundary statements into the update-shaped face-sum theorem. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                Download module (.lean)
                theorem signedFaceTermSum_eq_zero_of_eq_zero_off_univ_pi_Ioo
                    {n : ℕ}
                    (a b : Fin (n + 1) → ℝ)
                    (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                    (hoff : ∀ x ∉ (Set.univ.pi fun i => Set.Ioo (a i) (b i)), F x = 0) :
                    ∑ i : Fin (n + 1),
                        ((∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                            F (i.insertNth (b i) x) i) -
                          ∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                            F (i.insertNth (a i) x) i) = 0 := by
                  have hbdry := update_boundary_component_eq_zero_of_eq_zero_off_univ_pi_Ioo a b F hoff
                  exact signedFaceTermSum_eq_zero_of_update_boundary_component_eq_zero a b F hbdry.1 hbdry.2

                Exact module and namespace context

                Scope and omitted-condition boundaries
                • No whole-space statement.
                Sources, dependencies, and reuse

                Source and reuse

                Samplinglib parents called

                Mathlib API called (external library)

                No direct Mathlib call recorded; see the Samplinglib parents.

                Mathematical sources

                Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                Samplinglib mathematical lesson

                Ordinary support containment means zero outside the open box

                AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.eq_zero_off_univ_pi_Ioo_of_support_subset_univ_pi_Ioo · theorem · Teaching coverage

                Read this first

                Mathematical statement

                For endpoints a,b and any F:P→P whose nonzero set is contained in O, F vanishes at every point outside O.

                \[\operatorname{supp}F:=\{x:F(x)\ne0\}\subseteq O\quad\Longrightarrow\quad\forall x\notin O,\ F(x)=0.\]
                Lean statement · eq_zero_off_univ_pi_Ioo_of_support_subset_univ_pi_Ioo

                `Function.support` is just the nonzero set; membership is definitionally a nonzero-value assertion.

                Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                theorem eq_zero_off_univ_pi_Ioo_of_support_subset_univ_pi_Ioo
                    {n : ℕ}
                    (a b : Fin (n + 1) → ℝ)
                    (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                    (hsupp : Function.support F ⊆ (Set.univ.pi fun i => Set.Ioo (a i) (b i))) :
                    ∀ x ∉ (Set.univ.pi fun i => Set.Ioo (a i) (b i)), F x = 0

                Exact module and namespace context

                Proof roadmap

                1. 1Contradict a nonzero value off the box

                  If x∉O but F(x)≠0, then x belongs to ordinary support and hence to O, contradiction.

                Full assumptions and notation

                All objects and hypotheses

                • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                • F:P→P; ordinary Function.support F⊆O. No endpoint-order or regularity hypothesis.

                Mathematical proof

                1. Contradict a nonzero value off the box

                If x∉O but F(x)≠0, then x belongs to ordinary support and hence to O, contradiction.

                \[x\notin O,\ F(x)\ne0\Longrightarrow x\in\operatorname{supp}F\subseteq O.\]
                Corresponding Lean step

                by_contra hne; hx (hsupp hne).

                Lean verification

                The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                Lean proof · eq_zero_off_univ_pi_Ioo_of_support_subset_univ_pi_Ioo

                If x∉O but F(x)≠0, then x belongs to ordinary support and hence to O, contradiction. The Lean correspondence in that step identifies the exact existing rule or definitional reduction used.

                Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                Download module (.lean)
                theorem eq_zero_off_univ_pi_Ioo_of_support_subset_univ_pi_Ioo
                    {n : ℕ}
                    (a b : Fin (n + 1) → ℝ)
                    (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                    (hsupp : Function.support F ⊆ (Set.univ.pi fun i => Set.Ioo (a i) (b i))) :
                    ∀ x ∉ (Set.univ.pi fun i => Set.Ioo (a i) (b i)), F x = 0 := by
                  intro x hx
                  by_contra hne
                  exact hx (hsupp hne)

                Exact module and namespace context

                Scope and omitted-condition boundaries
                • This is not a compact-support theorem.
                Sources, dependencies, and reuse

                Source and reuse

                Samplinglib parents called

                  Mathlib API called (external library)

                  • Function.support

                  Mathematical sources

                  • Current ASTIS source — Exact statement and actual proof/construction authority; raw code intentionally omitted from this packet.
                  • Existing curated module card — Existing declaration-specific attribution entry, read as documentation without a new source-equivalence verdict.
                  • Existing focused test — Exact named declaration invocation located in an existing example; no test was run.

                  Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                  Samplinglib mathematical lesson

                  A smooth compactly supported cutoff at one point of an open box

                  AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.exists_contDiff_cutoff_tsupport_subset_univ_pi_Ioo · theorem · Teaching coverage

                  Read this first

                  Mathematical statement

                  For endpoints a,b and x∈O, there is χ:P→ℝ smooth on all P, with values in [0,1], compact topological support contained in O, and χ(x)=1.

                  \[\exists\chi:P\to\mathbb R,\quad\operatorname{tsupp}\chi\subseteq O,\quad\operatorname{tsupp}\chi\text{ compact},\quad\chi\in C^\infty,\quad0\le\chi\le1,\quad\chi(x)=1.\]
                  Lean statement · exists_contDiff_cutoff_tsupport_subset_univ_pi_Ioo

                  This is an existence theorem, not a new definition or a canonical cutoff choice. Its proof reuses the finite-dimensional neighborhood-bump theorem.

                  Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                  theorem exists_contDiff_cutoff_tsupport_subset_univ_pi_Ioo
                      {n : ℕ} {a b x : Fin (n + 1) → ℝ}
                      (hx : x ∈ Set.univ.pi fun i => Set.Ioo (a i) (b i)) :
                      ∃ χ : (Fin (n + 1) → ℝ) → ℝ,
                        tsupport χ ⊆ Set.univ.pi (fun i => Set.Ioo (a i) (b i)) ∧
                        HasCompactSupport χ ∧
                        ContDiff ℝ (⊤ : ℕ∞) χ ∧
                        Set.range χ ⊆ Set.Icc 0 1 ∧
                        χ x = 1

                  Exact module and namespace context

                  Proof roadmap

                  1. 1The open Pi-box is a neighborhood of x

                    Each coordinate interval is open; the finite product O is therefore open. Its membership assumption at x makes O a neighborhood of x.

                  2. 2Specialize the existing local smooth-bump existence theorem

                    Mathlib's finite-dimensional bump theorem gives a smooth [0,1]-valued function equal to one at x, with compact topological support in that neighborhood. These are exactly the requested properties.

                  Full assumptions and notation

                  All objects and hypotheses

                  • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                  • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                  • x∈P with x∈O; no separate a≤b hypothesis.
                  • Topological support is the closure of the nonzero set; the conclusion concerns one chosen point, not a whole inner box.

                  Mathematical proof

                  1. The open Pi-box is a neighborhood of x

                  Each coordinate interval is open; the finite product O is therefore open. Its membership assumption at x makes O a neighborhood of x.

                  \[O=\prod_i(a_i,b_i)\text{ open},\qquad O\in\mathcal N(x).\]
                  Corresponding Lean step

                  isOpen_set_pi Set.finite_univ (fun _ _ => isOpen_Ioo); hopen.mem_nhds hx.

                  2. Specialize the existing local smooth-bump existence theorem

                  Mathlib's finite-dimensional bump theorem gives a smooth [0,1]-valued function equal to one at x, with compact topological support in that neighborhood. These are exactly the requested properties.

                  \[\exists\chi:P\to\mathbb R,\quad\operatorname{tsupp}\chi\subseteq O,\quad\operatorname{tsupp}\chi\text{ compact},\quad\chi\in C^\infty,\quad0\le\chi\le1,\quad\chi(x)=1.\]
                  Corresponding Lean step

                  exists_contDiff_tsupport_subset (n := (⊤ : ℕ∞)) (hopen.mem_nhds hx).

                  Lean verification

                  The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                  Lean proof · exists_contDiff_cutoff_tsupport_subset_univ_pi_Ioo

                  The source first each coordinate interval is open; the finite product O is therefore open. Its membership assumption at x makes O a neighborhood of x. It finishes as follows: Mathlib's finite-dimensional bump theorem gives a smooth [0,1]-valued function equal to one at x, with compact topological support in that neighborhood. These are exactly the requested properties. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                  Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                  Download module (.lean)
                  theorem exists_contDiff_cutoff_tsupport_subset_univ_pi_Ioo
                      {n : ℕ} {a b x : Fin (n + 1) → ℝ}
                      (hx : x ∈ Set.univ.pi fun i => Set.Ioo (a i) (b i)) :
                      ∃ χ : (Fin (n + 1) → ℝ) → ℝ,
                        tsupport χ ⊆ Set.univ.pi (fun i => Set.Ioo (a i) (b i)) ∧
                        HasCompactSupport χ ∧
                        ContDiff ℝ (⊤ : ℕ∞) χ ∧
                        Set.range χ ⊆ Set.Icc 0 1 ∧
                        χ x = 1 := by
                    have hopen : IsOpen (Set.univ.pi fun i => Set.Ioo (a i) (b i)) := by
                      exact isOpen_set_pi Set.finite_univ fun _ _ => isOpen_Ioo
                    exact exists_contDiff_tsupport_subset (n := (⊤ : ℕ∞)) (hopen.mem_nhds hx)

                  Exact module and namespace context

                  Scope and omitted-condition boundaries
                  • No exhausting family or derivative bound is constructed.
                  Sources, dependencies, and reuse

                  Source and reuse

                  Samplinglib parents called

                    Mathlib API called (external library)

                    • isOpen_set_pi
                    • exists_contDiff_tsupport_subset

                    Mathematical sources

                    Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                    Samplinglib mathematical lesson

                    Pass from closed support to ordinary support

                    AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.support_subset_univ_pi_Ioo_of_tsupport_subset_univ_pi_Ioo · theorem · Teaching coverage

                    Read this first

                    Mathematical statement

                    For endpoints a,b and χ:P→ℝ, if tsupp χ⊆O then supp χ⊆O.

                    \[\operatorname{tsupp}\chi\subseteq O\quad\Longrightarrow\quad\operatorname{supp}\chi\subseteq O.\]
                    Lean statement · support_subset_univ_pi_Ioo_of_tsupport_subset_univ_pi_Ioo

                    This converts the support representation only; it does not construct χ.

                    Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                    theorem support_subset_univ_pi_Ioo_of_tsupport_subset_univ_pi_Ioo
                        {n : ℕ} {a b : Fin (n + 1) → ℝ}
                        {χ : (Fin (n + 1) → ℝ) → ℝ}
                        (hχ : tsupport χ ⊆ Set.univ.pi (fun i => Set.Ioo (a i) (b i))) :
                        Function.support χ ⊆ Set.univ.pi (fun i => Set.Ioo (a i) (b i))

                    Exact module and namespace context

                    Proof roadmap

                    1. 1Use containment in the closure

                      Every set lies in its closure. Therefore ordinary support lies in topological support, and the given inclusion finishes the result.

                    Full assumptions and notation

                    All objects and hypotheses

                    • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                    • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                    • χ:P→ℝ; tsupp χ⊆O. No continuity, compactness, or endpoint-order assumption.

                    Mathematical proof

                    1. Use containment in the closure

                    Every set lies in its closure. Therefore ordinary support lies in topological support, and the given inclusion finishes the result.

                    \[\operatorname{supp}\chi\subseteq\operatorname{tsupp}\chi\subseteq O.\]
                    Corresponding Lean step

                    (subset_tsupport χ).trans hχ.

                    Lean verification

                    The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                    Lean proof · support_subset_univ_pi_Ioo_of_tsupport_subset_univ_pi_Ioo

                    Every set lies in its closure. Therefore ordinary support lies in topological support, and the given inclusion finishes the result. The Lean correspondence in that step identifies the exact existing rule or definitional reduction used.

                    Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                    Download module (.lean)
                    theorem support_subset_univ_pi_Ioo_of_tsupport_subset_univ_pi_Ioo
                        {n : ℕ} {a b : Fin (n + 1) → ℝ}
                        {χ : (Fin (n + 1) → ℝ) → ℝ}
                        (hχ : tsupport χ ⊆ Set.univ.pi (fun i => Set.Ioo (a i) (b i))) :
                        Function.support χ ⊆ Set.univ.pi (fun i => Set.Ioo (a i) (b i)) := by
                      exact (subset_tsupport χ).trans hχ

                    Exact module and namespace context

                    Scope and omitted-condition boundaries
                    • Do not reverse this implication without an additional closure argument.
                    Sources, dependencies, and reuse

                    Source and reuse

                    Samplinglib parents called

                      Mathlib API called (external library)

                      • subset_tsupport

                      Mathematical sources

                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                      Samplinglib mathematical lesson

                      A pointwise cutoff with both support interfaces

                      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.exists_contDiff_cutoff_support_subset_univ_pi_Ioo · theorem · Teaching coverage

                      Read this first

                      Mathematical statement

                      For endpoints a,b and x∈O, there exists a smooth χ:P→ℝ taking values in [0,1], equal to one at x, with compact topological support, and with both supp χ⊆O and tsupp χ⊆O.

                      \[\exists\chi:P\to\mathbb R,\quad\operatorname{supp}\chi\subseteq O,\quad\operatorname{tsupp}\chi\subseteq O,\quad\operatorname{tsupp}\chi\text{ compact},\quad\chi\in C^\infty,\quad0\le\chi\le1,\quad\chi(x)=1.\]
                      Lean statement · exists_contDiff_cutoff_support_subset_univ_pi_Ioo

                      This is a packaging wrapper. It proves no second existence construction independent of the local cutoff theorem.

                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                      theorem exists_contDiff_cutoff_support_subset_univ_pi_Ioo
                          {n : ℕ} {a b x : Fin (n + 1) → ℝ}
                          (hx : x ∈ Set.univ.pi fun i => Set.Ioo (a i) (b i)) :
                          ∃ χ : (Fin (n + 1) → ℝ) → ℝ,
                            Function.support χ ⊆ Set.univ.pi (fun i => Set.Ioo (a i) (b i)) ∧
                            tsupport χ ⊆ Set.univ.pi (fun i => Set.Ioo (a i) (b i)) ∧
                            HasCompactSupport χ ∧
                            ContDiff ℝ (⊤ : ℕ∞) χ ∧
                            Set.range χ ⊆ Set.Icc 0 1 ∧
                            χ x = 1

                      Exact module and namespace context

                      Proof roadmap

                      1. 1Choose the previously constructed local cutoff

                        Use the preceding existence theorem to obtain χ with closed-support containment, compact support, smoothness, range and point value.

                      2. 2Add ordinary-support containment without changing χ

                        Apply the support-closure inclusion to the same witness, retaining all its other properties.

                      Full assumptions and notation

                      All objects and hypotheses

                      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                      • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                      • x∈O; no additional regularity or endpoint-order premise.

                      Mathematical proof

                      1. Choose the previously constructed local cutoff

                      Use the preceding existence theorem to obtain χ with closed-support containment, compact support, smoothness, range and point value.

                      \[\exists\chi:P\to\mathbb R,\quad\operatorname{tsupp}\chi\subseteq O,\quad\operatorname{tsupp}\chi\text{ compact},\quad\chi\in C^\infty,\quad0\le\chi\le1,\quad\chi(x)=1.\]
                      Corresponding Lean step

                      exists_contDiff_cutoff_tsupport_subset_univ_pi_Ioo hx.

                      2. Add ordinary-support containment without changing χ

                      Apply the support-closure inclusion to the same witness, retaining all its other properties.

                      \[\operatorname{supp}\chi\subseteq\operatorname{tsupp}\chi\subseteq O.\]
                      Corresponding Lean step

                      support_subset_univ_pi_Ioo_of_tsupport_subset_univ_pi_Ioo hχtsupp; final tuple keeps the same χ.

                      Lean verification

                      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                      Lean proof · exists_contDiff_cutoff_support_subset_univ_pi_Ioo

                      The source first use the preceding existence theorem to obtain χ with closed-support containment, compact support, smoothness, range and point value. It finishes as follows: Apply the support-closure inclusion to the same witness, retaining all its other properties. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                      Download module (.lean)
                      theorem exists_contDiff_cutoff_support_subset_univ_pi_Ioo
                          {n : ℕ} {a b x : Fin (n + 1) → ℝ}
                          (hx : x ∈ Set.univ.pi fun i => Set.Ioo (a i) (b i)) :
                          ∃ χ : (Fin (n + 1) → ℝ) → ℝ,
                            Function.support χ ⊆ Set.univ.pi (fun i => Set.Ioo (a i) (b i)) ∧
                            tsupport χ ⊆ Set.univ.pi (fun i => Set.Ioo (a i) (b i)) ∧
                            HasCompactSupport χ ∧
                            ContDiff ℝ (⊤ : ℕ∞) χ ∧
                            Set.range χ ⊆ Set.Icc 0 1 ∧
                            χ x = 1 := by
                        rcases exists_contDiff_cutoff_tsupport_subset_univ_pi_Ioo hx with
                          ⟨χ, hχtsupp, hχcompact, hχsmooth, hχrange, hχone⟩
                        exact ⟨χ,
                          support_subset_univ_pi_Ioo_of_tsupport_subset_univ_pi_Ioo hχtsupp,
                          hχtsupp, hχcompact, hχsmooth, hχrange, hχone⟩

                      Exact module and namespace context

                      Scope and omitted-condition boundaries
                      • Only χ(x)=1 is asserted, not a plateau on all of an inner box.
                      Sources, dependencies, and reuse

                      Source and reuse

                      Samplinglib parents called

                      Mathlib API called (external library)

                      No direct Mathlib call recorded; see the Samplinglib parents.

                      Mathematical sources

                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                      Samplinglib mathematical lesson

                      A smooth nonnegative function with exactly the open box as nonzero set

                      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.exists_contDiff_support_eq_univ_pi_Ioo · theorem · Teaching coverage

                      Read this first

                      Mathematical statement

                      For arbitrary endpoints a,b, there exists χ:P→ℝ which is smooth, has all values in [0,1], and whose ordinary support is exactly O. This includes empty open boxes.

                      \[\exists\chi:P\to\mathbb R,\quad\operatorname{supp}\chi=O,\quad\chi\in C^\infty,\quad0\le\chi\le1.\]
                      Lean statement · exists_contDiff_support_eq_univ_pi_Ioo

                      Exact `Function.support` means χ is nonzero at every point of O and zero outside it. The exported conclusion does not include `HasCompactSupport` or tsupport⊆O.

                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                      theorem exists_contDiff_support_eq_univ_pi_Ioo
                          {n : ℕ} (a b : Fin (n + 1) → ℝ) :
                          ∃ χ : (Fin (n + 1) → ℝ) → ℝ,
                            Function.support χ = Set.univ.pi (fun i => Set.Ioo (a i) (b i)) ∧
                            ContDiff ℝ (⊤ : ℕ∞) χ ∧
                            Set.range χ ⊆ Set.Icc 0 1

                      Exact module and namespace context

                      Proof roadmap

                      1. 1Verify openness of the prescribed support

                        O is a finite product of open real intervals, so it is open even when it is empty.

                      2. 2Apply the smooth exact-support theorem

                        Mathlib supplies a smooth [0,1]-valued function whose ordinary support equals any prescribed open set in a finite-dimensional real normed space.

                      Full assumptions and notation

                      All objects and hypotheses

                      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                      • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                      • a,b arbitrary; no point in O or endpoint-order assumption is required.

                      Mathematical proof

                      1. Verify openness of the prescribed support

                      O is a finite product of open real intervals, so it is open even when it is empty.

                      \[O=\prod_i(a_i,b_i)\text{ is open}.\]
                      Corresponding Lean step

                      isOpen_set_pi Set.finite_univ ... isOpen_Ioo.

                      2. Apply the smooth exact-support theorem

                      Mathlib supplies a smooth [0,1]-valued function whose ordinary support equals any prescribed open set in a finite-dimensional real normed space.

                      \[\operatorname{supp}\chi=O,\qquad\chi\in C^\infty,\quad\chi(P)\subseteq[0,1].\]
                      Corresponding Lean step

                      hopen.exists_contDiff_support_eq (n := (⊤ : ℕ∞)).

                      Lean verification

                      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                      Lean proof · exists_contDiff_support_eq_univ_pi_Ioo

                      The source first o is a finite product of open real intervals, so it is open even when it is empty. It finishes as follows: Mathlib supplies a smooth [0,1]-valued function whose ordinary support equals any prescribed open set in a finite-dimensional real normed space. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                      Download module (.lean)
                      theorem exists_contDiff_support_eq_univ_pi_Ioo
                          {n : ℕ} (a b : Fin (n + 1) → ℝ) :
                          ∃ χ : (Fin (n + 1) → ℝ) → ℝ,
                            Function.support χ = Set.univ.pi (fun i => Set.Ioo (a i) (b i)) ∧
                            ContDiff ℝ (⊤ : ℕ∞) χ ∧
                            Set.range χ ⊆ Set.Icc 0 1 := by
                        have hopen : IsOpen (Set.univ.pi fun i => Set.Ioo (a i) (b i)) := by
                          exact isOpen_set_pi Set.finite_univ fun _ _ => isOpen_Ioo
                        exact hopen.exists_contDiff_support_eq (n := (⊤ : ℕ∞))

                      Exact module and namespace context

                      Scope and omitted-condition boundaries
                      • Do not strengthen ordinary-support equality to topological-support containment inside the same open box.
                      • No value-one plateau is asserted.
                      Sources, dependencies, and reuse

                      Source and reuse

                      Samplinglib parents called

                        Mathlib API called (external library)

                        • isOpen_set_pi
                        • IsOpen.exists_contDiff_support_eq

                        Mathematical sources

                        Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                        Samplinglib mathematical lesson

                        Exact ordinary support and nonnegativity give positivity inside the box

                        AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.positive_on_univ_pi_Ioo_of_support_eq_univ_pi_Ioo · theorem · Teaching coverage

                        Read this first

                        Mathematical statement

                        If χ:P→ℝ has ordinary support exactly O and range contained in [0,1], then χ(x)>0 for every specified x∈O.

                        \[\operatorname{supp}\chi=O,\quad\chi(P)\subseteq[0,1],\quad x\in O\quad\Longrightarrow\quad\chi(x)>0.\]
                        Lean statement · positive_on_univ_pi_Ioo_of_support_eq_univ_pi_Ioo

                        The prime-free χ is an arbitrary function satisfying support and range conditions; continuity is not used.

                        Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                        theorem positive_on_univ_pi_Ioo_of_support_eq_univ_pi_Ioo
                            {n : ℕ} {a b : Fin (n + 1) → ℝ}
                            {χ : (Fin (n + 1) → ℝ) → ℝ}
                            (hχsupp : Function.support χ = Set.univ.pi (fun i => Set.Ioo (a i) (b i)))
                            (hχrange : Set.range χ ⊆ Set.Icc 0 1)
                            {x : Fin (n + 1) → ℝ}
                            (hx : x ∈ Set.univ.pi (fun i => Set.Ioo (a i) (b i))) :
                            0 < χ x

                        Exact module and namespace context

                        Proof roadmap

                        1. 1Use support membership to rule out zero

                          Since x∈O=supp χ, χ(x)≠0.

                        2. 2Combine with the lower range bound

                          The range premise gives 0≤χ(x). A nonnegative nonzero real number is strictly positive.

                        Full assumptions and notation

                        All objects and hypotheses

                        • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                        • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                        • χ:P→ℝ; supp χ=O; χ(P)⊆[0,1]; x∈O.
                        • No smoothness or endpoint-order hypothesis.

                        Mathematical proof

                        1. Use support membership to rule out zero

                        Since x∈O=supp χ, χ(x)≠0.

                        \[x\in O=\operatorname{supp}\chi\Longrightarrow\chi(x)\ne0.\]
                        Corresponding Lean step

                        simpa [hχsupp] using hx; support membership becomes hxne.

                        2. Combine with the lower range bound

                        The range premise gives 0≤χ(x). A nonnegative nonzero real number is strictly positive.

                        \[0\le\chi(x),\quad\chi(x)\ne0\Longrightarrow0<\chi(x).\]
                        Corresponding Lean step

                        (hχrange ⟨x,rfl⟩).1; lt_of_le_of_ne hnonneg (Ne.symm hxne).

                        Lean verification

                        The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                        Lean proof · positive_on_univ_pi_Ioo_of_support_eq_univ_pi_Ioo

                        The source first since x∈O=supp χ, χ(x)≠0. It finishes as follows: The range premise gives 0≤χ(x). A nonnegative nonzero real number is strictly positive. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                        Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                        Download module (.lean)
                        theorem positive_on_univ_pi_Ioo_of_support_eq_univ_pi_Ioo
                            {n : ℕ} {a b : Fin (n + 1) → ℝ}
                            {χ : (Fin (n + 1) → ℝ) → ℝ}
                            (hχsupp : Function.support χ = Set.univ.pi (fun i => Set.Ioo (a i) (b i)))
                            (hχrange : Set.range χ ⊆ Set.Icc 0 1)
                            {x : Fin (n + 1) → ℝ}
                            (hx : x ∈ Set.univ.pi (fun i => Set.Ioo (a i) (b i))) :
                            0 < χ x := by
                          have hxmem : x ∈ Function.support χ := by
                            simpa [hχsupp] using hx
                          have hxne : χ x ≠ 0 := hxmem
                          have hnonneg : 0 ≤ χ x := (hχrange ⟨x, rfl⟩).1
                          exact lt_of_le_of_ne hnonneg (Ne.symm hxne)

                        Exact module and namespace context

                        Scope and omitted-condition boundaries
                        • This is pointwise positivity, not a uniform positive lower bound over O.
                        Sources, dependencies, and reuse

                        Source and reuse

                        Samplinglib parents called

                          Mathlib API called (external library)

                          • Function.support
                          • lt_of_le_of_ne

                          Mathematical sources

                          • Current ASTIS source — Exact statement and actual proof/construction authority; raw code intentionally omitted from this packet.
                          • Existing curated module card — Existing declaration-specific attribution entry, read as documentation without a new source-equivalence verdict.
                          • Existing focused test — Exact named declaration invocation located in an existing example; no test was run.

                          Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                          Samplinglib mathematical lesson

                          Strict outer endpoints enclose a closed inner box

                          AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.Icc_subset_univ_pi_Ioo_of_strict_bounds · theorem · Teaching coverage

                          Read this first

                          Mathematical statement

                          For a,b,A,B∈P with A_i<a_i and b_i<B_i for every i, the closed inner box [a,b] is contained in the open outer box ∏_i(A_i,B_i). No assumption a≤b is required.

                          \[\bigl[\forall i,\ A_i<a_i,\ b_i<B_i\bigr]\Longrightarrow [a,b]\subseteq\prod_i(A_i,B_i).\]
                          Lean statement · Icc_subset_univ_pi_Ioo_of_strict_bounds

                          The Pi order is coordinatewise. The result is a set inclusion and remains valid when the inner box is empty.

                          Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                          theorem Icc_subset_univ_pi_Ioo_of_strict_bounds
                              {n : ℕ} {a b A B : Fin (n + 1) → ℝ}
                              (hA : ∀ i, A i < a i)
                              (hB : ∀ i, b i < B i) :
                              Set.Icc a b ⊆ Set.univ.pi (fun i => Set.Ioo (A i) (B i))

                          Exact module and namespace context

                          Proof roadmap

                          1. 1Chain the endpoint inequalities coordinatewise

                            For x∈[a,b], each coordinate satisfies A_i<a_i≤x_i≤b_i<B_i. These are exactly the strict inequalities for membership in the outer open box.

                          Full assumptions and notation

                          All objects and hypotheses

                          • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                          • a,b,A,B∈P; ∀i,A_i<a_i and ∀i,b_i<B_i. The inner box may be empty.

                          Mathematical proof

                          1. Chain the endpoint inequalities coordinatewise

                          For x∈[a,b], each coordinate satisfies A_i<a_i≤x_i≤b_i<B_i. These are exactly the strict inequalities for membership in the outer open box.

                          \[A_i<a_i\le x_i\le b_i<B_i\quad\Longrightarrow\quad A_i<x_i<B_i.\]
                          Corresponding Lean step

                          lt_of_lt_of_le (hA i) (hx.1 i) and lt_of_le_of_lt (hx.2 i) (hB i).

                          Lean verification

                          The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                          Lean proof · Icc_subset_univ_pi_Ioo_of_strict_bounds

                          For x∈[a,b], each coordinate satisfies A_i<a_i≤x_i≤b_i<B_i. These are exactly the strict inequalities for membership in the outer open box. The Lean correspondence in that step identifies the exact existing rule or definitional reduction used.

                          Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                          Download module (.lean)
                          theorem Icc_subset_univ_pi_Ioo_of_strict_bounds
                              {n : ℕ} {a b A B : Fin (n + 1) → ℝ}
                              (hA : ∀ i, A i < a i)
                              (hB : ∀ i, b i < B i) :
                              Set.Icc a b ⊆ Set.univ.pi (fun i => Set.Ioo (A i) (B i)) := by
                            intro x hx i _hi
                            exact ⟨lt_of_lt_of_le (hA i) (hx.1 i), lt_of_le_of_lt (hx.2 i) (hB i)⟩

                          Exact module and namespace context

                          Scope and omitted-condition boundaries
                          • No cutoff function or exhaustion sequence is chosen.
                          Sources, dependencies, and reuse

                          Source and reuse

                          Samplinglib parents called

                            Mathlib API called (external library)

                            • lt_of_lt_of_le
                            • lt_of_le_of_lt

                            Mathematical sources

                            • Current ASTIS source — Exact statement and actual proof/construction authority; raw code intentionally omitted from this packet.
                            • Existing curated module card — Existing declaration-specific attribution entry, read as documentation without a new source-equivalence verdict.
                            • Existing focused test — Exact named declaration invocation located in an existing example; no test was run.

                            Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                            Samplinglib mathematical lesson

                            A single smooth plateau on an entire inner closed box

                            AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.exists_contDiff_cutoff_eq_one_on_Icc_tsupport_subset_outer_univ_pi_Ioo · theorem · Teaching coverage

                            Read this first

                            Mathematical statement

                            Suppose a≤b, A_i<a_i, and b_i<B_i for every i. Then one smooth χ:P→ℝ equals one at every point of [a,b], takes values in [0,1], and has compact topological support contained in the outer open box O_out=∏_i(A_i,B_i). Ordinary support is also contained there.

                            \[\exists\chi\in C^\infty(P,\mathbb R),\quad\chi|_{[a,b]}=1,\quad0\le\chi\le1,\quad\operatorname{supp}\chi\subseteq O_{\rm out},\quad\operatorname{tsupp}\chi\subseteq O_{\rm out},\quad\operatorname{tsupp}\chi\text{ compact}.\]
                            Lean statement · exists_contDiff_cutoff_eq_one_on_Icc_tsupport_subset_outer_univ_pi_Ioo

                            Unlike the single-point cutoff theorem, `Set.EqOn χ 1 (Set.Icc a b)` is a value-one plateau on the whole inner box. `hab` is an actual retained parameter and must not be omitted.

                            Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                            theorem exists_contDiff_cutoff_eq_one_on_Icc_tsupport_subset_outer_univ_pi_Ioo
                                {n : ℕ} {a b A B : Fin (n + 1) → ℝ}
                                (hab : a ≤ b)
                                (hA : ∀ i, A i < a i)
                                (hB : ∀ i, b i < B i) :
                                ∃ χ : (Fin (n + 1) → ℝ) → ℝ,
                                  Function.support χ ⊆ Set.univ.pi (fun i => Set.Ioo (A i) (B i)) ∧
                                  tsupport χ ⊆ Set.univ.pi (fun i => Set.Ioo (A i) (B i)) ∧
                                  HasCompactSupport χ ∧
                                  ContDiff ℝ (⊤ : ℕ∞) χ ∧
                                  Set.range χ ⊆ Set.Icc 0 1 ∧
                                  Set.EqOn χ 1 (Set.Icc a b)

                            Exact module and namespace context

                            Proof roadmap

                            1. 1Place the compact inner box inside the open outer box

                              The closed box [a,b] is compact in finite dimensions. Strict endpoint bounds give its containment in O_out, which is open. The source also records nonemptiness using a∈[a,b].

                            2. 2Use the generic compact-in-open plateau construction

                              Apply the Cutoff module's plateau theorem to K=[a,b] and U=O_out. It returns one function with all six properties simultaneously.

                            Full assumptions and notation

                            All objects and hypotheses

                            • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                            • a,b,A,B∈P; a≤b coordinatewise, ∀i,A_i<a_i, ∀i,b_i<B_i.
                            • O_out=∏_i(A_i,B_i); the explicit a≤b hypothesis is retained even though the generic compact-in-open theorem permits empty compact sets.

                            Mathematical proof

                            1. Place the compact inner box inside the open outer box

                            The closed box [a,b] is compact in finite dimensions. Strict endpoint bounds give its containment in O_out, which is open. The source also records nonemptiness using a∈[a,b].

                            \[[a,b]\text{ compact},\quad[a,b]\subseteq O_{\rm out},\quad O_{\rm out}\text{ open},\quad a\in[a,b].\]
                            Corresponding Lean step

                            isCompact_Icc; Icc_subset_univ_pi_Ioo_of_strict_bounds hA hB; isOpen_set_pi; _hinner := ⟨a,le_rfl,hab⟩.

                            2. Use the generic compact-in-open plateau construction

                            Apply the Cutoff module's plateau theorem to K=[a,b] and U=O_out. It returns one function with all six properties simultaneously.

                            \[\chi|_{[a,b]}=1,\qquad\operatorname{tsupp}\chi\subseteq O_{\rm out}.\]
                            Corresponding Lean step

                            Cutoff.exists_contDiff_eq_one_tsupport_subset isCompact_Icc hopen (...).

                            Lean verification

                            The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                            Lean proof · exists_contDiff_cutoff_eq_one_on_Icc_tsupport_subset_outer_univ_pi_Ioo

                            The source first the closed box [a,b] is compact in finite dimensions. Strict endpoint bounds give its containment in O_out, which is open. The source also records nonemptiness using a∈[a,b]. It finishes as follows: Apply the Cutoff module's plateau theorem to K=[a,b] and U=O_out. It returns one function with all six properties simultaneously. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                            Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                            Download module (.lean)
                            theorem exists_contDiff_cutoff_eq_one_on_Icc_tsupport_subset_outer_univ_pi_Ioo
                                {n : ℕ} {a b A B : Fin (n + 1) → ℝ}
                                (hab : a ≤ b)
                                (hA : ∀ i, A i < a i)
                                (hB : ∀ i, b i < B i) :
                                ∃ χ : (Fin (n + 1) → ℝ) → ℝ,
                                  Function.support χ ⊆ Set.univ.pi (fun i => Set.Ioo (A i) (B i)) ∧
                                  tsupport χ ⊆ Set.univ.pi (fun i => Set.Ioo (A i) (B i)) ∧
                                  HasCompactSupport χ ∧
                                  ContDiff ℝ (⊤ : ℕ∞) χ ∧
                                  Set.range χ ⊆ Set.Icc 0 1 ∧
                                  Set.EqOn χ 1 (Set.Icc a b) := by
                              have _hinner : (Set.Icc a b).Nonempty := ⟨a, le_rfl, hab⟩
                              have hopen : IsOpen (Set.univ.pi fun i => Set.Ioo (A i) (B i)) := by
                                exact isOpen_set_pi Set.finite_univ fun _ _ => isOpen_Ioo
                              exact Cutoff.exists_contDiff_eq_one_tsupport_subset
                                isCompact_Icc hopen (Icc_subset_univ_pi_Ioo_of_strict_bounds hA hB)

                            Exact module and namespace context

                            Scope and omitted-condition boundaries
                            • No radius-indexed family or uniform derivative estimate is part of this existence result.
                            Sources, dependencies, and reuse

                            Source and reuse

                            Samplinglib parents called

                            Mathlib API called (external library)

                            • isCompact_Icc
                            • isOpen_set_pi

                            Mathematical sources

                            Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                            Samplinglib mathematical lesson

                            A cutoff at one inner-box point with support in the outer box

                            AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.exists_contDiff_cutoff_support_subset_outer_univ_pi_Ioo_of_mem_Icc · theorem · Teaching coverage

                            Read this first

                            Mathematical statement

                            For strict outer bounds A_i<a_i and b_i<B_i, and a specified x∈[a,b], there exists a smooth [0,1]-valued χ with χ(x)=1 and compact closed support in O_out=∏_i(A_i,B_i); its ordinary support is also in O_out.

                            \[\exists\chi\in C^\infty,\quad\chi(x)=1,\quad0\le\chi\le1,\quad\operatorname{supp}\chi\subseteq O_{\rm out},\quad\operatorname{tsupp}\chi\subseteq O_{\rm out},\quad\operatorname{tsupp}\chi\text{ compact}.\]
                            Lean statement · exists_contDiff_cutoff_support_subset_outer_univ_pi_Ioo_of_mem_Icc

                            This wrapper does not call the whole-inner-box plateau theorem; its conclusion concerns one point only.

                            Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                            theorem exists_contDiff_cutoff_support_subset_outer_univ_pi_Ioo_of_mem_Icc
                                {n : ℕ} {a b A B x : Fin (n + 1) → ℝ}
                                (hA : ∀ i, A i < a i)
                                (hB : ∀ i, b i < B i)
                                (hx : x ∈ Set.Icc a b) :
                                ∃ χ : (Fin (n + 1) → ℝ) → ℝ,
                                  Function.support χ ⊆ Set.univ.pi (fun i => Set.Ioo (A i) (B i)) ∧
                                  tsupport χ ⊆ Set.univ.pi (fun i => Set.Ioo (A i) (B i)) ∧
                                  HasCompactSupport χ ∧
                                  ContDiff ℝ (⊤ : ℕ∞) χ ∧
                                  Set.range χ ⊆ Set.Icc 0 1 ∧
                                  χ x = 1

                            Exact module and namespace context

                            Proof roadmap

                            1. 1Move the chosen point into the outer open box

                              Apply the strict-box inclusion to the supplied inner-box membership.

                            2. 2Apply the single-point cutoff theorem

                              Use the existing local existence theorem with outer endpoints A,B and the newly established membership. It supplies a cutoff equal to one only at the chosen x as stated.

                            Full assumptions and notation

                            All objects and hypotheses

                            • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                            • a,b,A,B,x∈P; ∀i,A_i<a_i; ∀i,b_i<B_i; x∈[a,b]. No separate a≤b parameter.

                            Mathematical proof

                            1. Move the chosen point into the outer open box

                            Apply the strict-box inclusion to the supplied inner-box membership.

                            \[x\in[a,b]\subseteq O_{\rm out}.\]
                            Corresponding Lean step

                            Icc_subset_univ_pi_Ioo_of_strict_bounds hA hB hx.

                            2. Apply the single-point cutoff theorem

                            Use the existing local existence theorem with outer endpoints A,B and the newly established membership. It supplies a cutoff equal to one only at the chosen x as stated.

                            \[\chi(x)=1,\qquad\operatorname{tsupp}\chi\subseteq O_{\rm out}.\]
                            Corresponding Lean step

                            exists_contDiff_cutoff_support_subset_univ_pi_Ioo (...).

                            Lean verification

                            The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                            Lean proof · exists_contDiff_cutoff_support_subset_outer_univ_pi_Ioo_of_mem_Icc

                            The source first apply the strict-box inclusion to the supplied inner-box membership. It finishes as follows: Use the existing local existence theorem with outer endpoints A,B and the newly established membership. It supplies a cutoff equal to one only at the chosen x as stated. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                            Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                            Download module (.lean)
                            theorem exists_contDiff_cutoff_support_subset_outer_univ_pi_Ioo_of_mem_Icc
                                {n : ℕ} {a b A B x : Fin (n + 1) → ℝ}
                                (hA : ∀ i, A i < a i)
                                (hB : ∀ i, b i < B i)
                                (hx : x ∈ Set.Icc a b) :
                                ∃ χ : (Fin (n + 1) → ℝ) → ℝ,
                                  Function.support χ ⊆ Set.univ.pi (fun i => Set.Ioo (A i) (B i)) ∧
                                  tsupport χ ⊆ Set.univ.pi (fun i => Set.Ioo (A i) (B i)) ∧
                                  HasCompactSupport χ ∧
                                  ContDiff ℝ (⊤ : ℕ∞) χ ∧
                                  Set.range χ ⊆ Set.Icc 0 1 ∧
                                  χ x = 1 :=
                              exists_contDiff_cutoff_support_subset_univ_pi_Ioo
                                (Icc_subset_univ_pi_Ioo_of_strict_bounds hA hB hx)

                            Exact module and namespace context

                            Scope and omitted-condition boundaries
                            • Do not upgrade χ(x)=1 to χ=1 throughout [a,b].
                            Sources, dependencies, and reuse

                            Source and reuse

                            Samplinglib parents called

                            Mathlib API called (external library)

                            No direct Mathlib call recorded; see the Samplinglib parents.

                            Mathematical sources

                            Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                            Samplinglib mathematical lesson

                            Ordinary support inside the open box cancels all face terms

                            AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.signedFaceTermSum_eq_zero_of_support_subset_univ_pi_Ioo · theorem · Teaching coverage

                            Read this first

                            Mathematical statement

                            For arbitrary endpoints a,b and F:P→P with supp F⊆O, the signed face sum Φ_a,b(F) is zero.

                            \[\operatorname{supp}F\subseteq O\Longrightarrow\Phi_{a,b}(F)=0.\]
                            Lean statement · signedFaceTermSum_eq_zero_of_support_subset_univ_pi_Ioo

                            Only the finite-box boundary quantity is concluded. The assumption does not itself identify F as a smooth field.

                            Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                            theorem signedFaceTermSum_eq_zero_of_support_subset_univ_pi_Ioo
                                {n : ℕ}
                                (a b : Fin (n + 1) → ℝ)
                                (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                (hsupp : Function.support F ⊆ (Set.univ.pi fun i => Set.Ioo (a i) (b i))) :
                                ∑ i : Fin (n + 1),
                                    ((∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                                        F (i.insertNth (b i) x) i) -
                                      ∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                                        F (i.insertNth (a i) x) i) = 0

                            Exact module and namespace context

                            Proof roadmap

                            1. 1Turn support containment into off-box vanishing

                              A nonzero value outside O would violate the support inclusion, so F=0 on P∖O.

                            2. 2Invoke the off-box face cancellation theorem

                              The established zero values imply all endpoint normal components vanish and therefore the signed face sum is zero.

                            Full assumptions and notation

                            All objects and hypotheses

                            • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                            • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                            • F:P→P is arbitrary.
                            • For each i, K_hat_i=∏_{j≠i}[a_j,b_j] is parametrized by Fin n→ℝ; I_i^c inserts c in coordinate i, retaining the other coordinates in their original order. Φ_a,b(F) is the sum of upper-face integrals of F_i minus lower-face integrals of F_i.
                            • No a≤b, continuity, differentiability or integrability assumption.
                            • Function.support F⊆O; the hypothesis concerns the nonzero set.

                            Notation and interpretation

                            Notation used below

                            For each i, K_hat_i=∏_{j≠i}[a_j,b_j] is parametrized by Fin n→ℝ; I_i^c inserts c in coordinate i, retaining the other coordinates in their original order. Φ_a,b(F) is the sum of upper-face integrals of F_i minus lower-face integrals of F_i.

                            \[\Phi_{a,b}(F):=\sum_{i=0}^{d-1}\left[\int_{K_{\widehat i}}F_i(I_i^{b_i}z)\,dz-\int_{K_{\widehat i}}F_i(I_i^{a_i}z)\,dz\right]\]

                            Mathematical proof

                            1. Turn support containment into off-box vanishing

                            A nonzero value outside O would violate the support inclusion, so F=0 on P∖O.

                            \[F|_{P\setminus O}=0.\]
                            Corresponding Lean step

                            eq_zero_off_univ_pi_Ioo_of_support_subset_univ_pi_Ioo a b F hsupp.

                            2. Invoke the off-box face cancellation theorem

                            The established zero values imply all endpoint normal components vanish and therefore the signed face sum is zero.

                            \[\Phi_{a,b}(F)=0.\]
                            Corresponding Lean step

                            signedFaceTermSum_eq_zero_of_eq_zero_off_univ_pi_Ioo a b F (...).

                            Lean verification

                            The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                            Lean proof · signedFaceTermSum_eq_zero_of_support_subset_univ_pi_Ioo

                            The source first a nonzero value outside O would violate the support inclusion, so F=0 on P∖O. It finishes as follows: The established zero values imply all endpoint normal components vanish and therefore the signed face sum is zero. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                            Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                            Download module (.lean)
                            theorem signedFaceTermSum_eq_zero_of_support_subset_univ_pi_Ioo
                                {n : ℕ}
                                (a b : Fin (n + 1) → ℝ)
                                (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                (hsupp : Function.support F ⊆ (Set.univ.pi fun i => Set.Ioo (a i) (b i))) :
                                ∑ i : Fin (n + 1),
                                    ((∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                                        F (i.insertNth (b i) x) i) -
                                      ∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                                        F (i.insertNth (a i) x) i) = 0 :=
                              signedFaceTermSum_eq_zero_of_eq_zero_off_univ_pi_Ioo a b F
                                (eq_zero_off_univ_pi_Ioo_of_support_subset_univ_pi_Ioo a b F hsupp)

                            Exact module and namespace context

                            Scope and omitted-condition boundaries
                            • No volume-integral or whole-space theorem.
                            Sources, dependencies, and reuse

                            Source and reuse

                            Samplinglib parents called

                            Mathlib API called (external library)

                            No direct Mathlib call recorded; see the Samplinglib parents.

                            Mathematical sources

                            Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                            Samplinglib mathematical lesson

                            A scalar cutoff zero off the box localizes any vector field

                            AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.support_smul_subset_univ_pi_Ioo_of_eq_zero_off_univ_pi_Ioo · theorem · Teaching coverage

                            Read this first

                            Mathematical statement

                            For endpoints a,b and arbitrary χ:P→ℝ and G:P→P, assume χ(x)=0 for every x∉O. Then the ordinary support of the product H(x)=χ(x)G(x) lies in O.

                            \[\chi|_{P\setminus O}=0\quad\Longrightarrow\quad\operatorname{supp}(\chi G)\subseteq O.\]
                            Lean statement · support_smul_subset_univ_pi_Ioo_of_eq_zero_off_univ_pi_Ioo

                            The conclusion is `Function.support (fun x => χ x • G x) ⊆ O`. No derivative or compactness property of the product is implicit.

                            Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                            theorem support_smul_subset_univ_pi_Ioo_of_eq_zero_off_univ_pi_Ioo
                                {n : ℕ}
                                (a b : Fin (n + 1) → ℝ)
                                (χ : (Fin (n + 1) → ℝ) → ℝ)
                                (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                (hχ : ∀ x ∉ (Set.univ.pi fun i => Set.Ioo (a i) (b i)), χ x = 0) :
                                Function.support (fun x => χ x • G x) ⊆
                                  (Set.univ.pi fun i => Set.Ioo (a i) (b i))

                            Exact module and namespace context

                            Proof roadmap

                            1. 1A product cannot be nonzero off the cutoff's allowed region

                              For x∉O, χ(x)=0, hence H(x)=0·G(x)=0. Therefore any point in supp H must lie in O.

                            Full assumptions and notation

                            All objects and hypotheses

                            • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                            • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                            • χ:P→ℝ and G:P→P are arbitrary; H(x)=χ(x)G(x). No continuity, differentiability, or endpoint-order hypothesis.
                            • χ(x)=0 for every x∉O.

                            Mathematical proof

                            1. A product cannot be nonzero off the cutoff's allowed region

                            For x∉O, χ(x)=0, hence H(x)=0·G(x)=0. Therefore any point in supp H must lie in O.

                            \[x\notin O\Longrightarrow H(x)=0,\qquad\operatorname{supp}H\subseteq O.\]
                            Corresponding Lean step

                            support_smul_subset_univ_pi_Ioo_of_eq_zero_off_univ_pi_Ioo: hχ0 := hχ x hxbox; simp [hχ0]; contradiction with nonzero support membership.

                            Lean verification

                            The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                            Lean proof · support_smul_subset_univ_pi_Ioo_of_eq_zero_off_univ_pi_Ioo

                            For x∉O, χ(x)=0, hence H(x)=0·G(x)=0. Therefore any point in supp H must lie in O. The Lean correspondence in that step identifies the exact existing rule or definitional reduction used.

                            Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                            Download module (.lean)
                            theorem support_smul_subset_univ_pi_Ioo_of_eq_zero_off_univ_pi_Ioo
                                {n : ℕ}
                                (a b : Fin (n + 1) → ℝ)
                                (χ : (Fin (n + 1) → ℝ) → ℝ)
                                (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                (hχ : ∀ x ∉ (Set.univ.pi fun i => Set.Ioo (a i) (b i)), χ x = 0) :
                                Function.support (fun x => χ x • G x) ⊆
                                  (Set.univ.pi fun i => Set.Ioo (a i) (b i)) := by
                              intro x hx
                              by_contra hxbox
                              have hχ0 : χ x = 0 := hχ x hxbox
                              have hzero : χ x • G x = 0 := by simp [hχ0]
                              exact hx hzero

                            Exact module and namespace context

                            Scope and omitted-condition boundaries
                            • This produces ordinary support containment, not a compact-support or regularity theorem.
                            Sources, dependencies, and reuse

                            Source and reuse

                            Samplinglib parents called

                              Mathlib API called (external library)

                              • zero_smul

                              Mathematical sources

                              • Current ASTIS source — Exact statement and actual proof/construction authority; raw code intentionally omitted from this packet.
                              • Existing curated module card — Existing declaration-specific attribution entry, read as documentation without a new source-equivalence verdict.
                              • Existing focused test — Exact named declaration invocation located in an existing example; no test was run.

                              Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                              Samplinglib mathematical lesson

                              Scalar ordinary support localizes the product field

                              AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.support_smul_subset_univ_pi_Ioo_of_scalar_support_subset_univ_pi_Ioo · theorem · Teaching coverage

                              Read this first

                              Mathematical statement

                              For endpoints a,b and arbitrary χ:P→ℝ and G:P→P, assume Function.support χ⊆O. Then the ordinary support of the product H(x)=χ(x)G(x) lies in O.

                              \[\operatorname{supp}\chi\subseteq O\quad\Longrightarrow\quad\operatorname{supp}(\chi G)\subseteq O.\]
                              Lean statement · support_smul_subset_univ_pi_Ioo_of_scalar_support_subset_univ_pi_Ioo

                              The conclusion is `Function.support (fun x => χ x • G x) ⊆ O`. No derivative or compactness property of the product is implicit.

                              Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                              theorem support_smul_subset_univ_pi_Ioo_of_scalar_support_subset_univ_pi_Ioo
                                  {n : ℕ}
                                  (a b : Fin (n + 1) → ℝ)
                                  (χ : (Fin (n + 1) → ℝ) → ℝ)
                                  (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                  (hχsupp : Function.support χ ⊆
                                    (Set.univ.pi fun i => Set.Ioo (a i) (b i))) :
                                  Function.support (fun x => χ x • G x) ⊆
                                    (Set.univ.pi fun i => Set.Ioo (a i) (b i))

                              Exact module and namespace context

                              Proof roadmap

                              1. 1Derive scalar zero values outside O

                                If χ(x)≠0 then support containment puts x in O. Thus χ(x)=0 for x∉O.

                              2. 2Apply the off-box scalar localization lemma

                                Using these scalar zero values, the previously proved support theorem places supp H in O.

                              Full assumptions and notation

                              All objects and hypotheses

                              • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                              • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                              • χ:P→ℝ and G:P→P are arbitrary; H(x)=χ(x)G(x). No continuity, differentiability, or endpoint-order hypothesis.
                              • Function.support χ⊆O.

                              Mathematical proof

                              1. Derive scalar zero values outside O

                              If χ(x)≠0 then support containment puts x in O. Thus χ(x)=0 for x∉O.

                              \[\operatorname{supp}\chi\subseteq O\Longrightarrow\chi|_{P\setminus O}=0.\]
                              Corresponding Lean step

                              The local contradiction proof uses hχsupp hχne.

                              2. Apply the off-box scalar localization lemma

                              Using these scalar zero values, the previously proved support theorem places supp H in O.

                              \[\operatorname{supp}(\chi G)\subseteq O.\]
                              Corresponding Lean step

                              support_smul_subset_univ_pi_Ioo_of_eq_zero_off_univ_pi_Ioo a b χ G.

                              Lean verification

                              The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                              Lean proof · support_smul_subset_univ_pi_Ioo_of_scalar_support_subset_univ_pi_Ioo

                              The source first if χ(x)≠0 then support containment puts x in O. Thus χ(x)=0 for x∉O. It finishes as follows: Using these scalar zero values, the previously proved support theorem places supp H in O. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                              Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                              Download module (.lean)
                              theorem support_smul_subset_univ_pi_Ioo_of_scalar_support_subset_univ_pi_Ioo
                                  {n : ℕ}
                                  (a b : Fin (n + 1) → ℝ)
                                  (χ : (Fin (n + 1) → ℝ) → ℝ)
                                  (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                  (hχsupp : Function.support χ ⊆
                                    (Set.univ.pi fun i => Set.Ioo (a i) (b i))) :
                                  Function.support (fun x => χ x • G x) ⊆
                                    (Set.univ.pi fun i => Set.Ioo (a i) (b i)) := by
                                exact support_smul_subset_univ_pi_Ioo_of_eq_zero_off_univ_pi_Ioo a b χ G
                                  (by
                                    intro x hxbox
                                    by_contra hχne
                                    exact hxbox (hχsupp hχne))

                              Exact module and namespace context

                              Scope and omitted-condition boundaries
                              • This produces ordinary support containment, not a compact-support or regularity theorem.
                              Sources, dependencies, and reuse

                              Source and reuse

                              Samplinglib parents called

                              Mathlib API called (external library)

                              No direct Mathlib call recorded; see the Samplinglib parents.

                              Mathematical sources

                              Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                              Samplinglib mathematical lesson

                              Scalar closed support localizes the product's ordinary support

                              AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.support_smul_subset_univ_pi_Ioo_of_scalar_tsupport_subset_univ_pi_Ioo · theorem · Teaching coverage

                              Read this first

                              Mathematical statement

                              For endpoints a,b and arbitrary χ:P→ℝ and G:P→P, assume tsupport χ⊆O. Then the ordinary support of the product H(x)=χ(x)G(x) lies in O.

                              \[\operatorname{tsupp}\chi\subseteq O\quad\Longrightarrow\quad\operatorname{supp}(\chi G)\subseteq O.\]
                              Lean statement · support_smul_subset_univ_pi_Ioo_of_scalar_tsupport_subset_univ_pi_Ioo

                              The conclusion is `Function.support (fun x => χ x • G x) ⊆ O`. No derivative or compactness property of the product is implicit.

                              Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                              theorem support_smul_subset_univ_pi_Ioo_of_scalar_tsupport_subset_univ_pi_Ioo
                                  {n : ℕ}
                                  (a b : Fin (n + 1) → ℝ)
                                  (χ : (Fin (n + 1) → ℝ) → ℝ)
                                  (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                  (hχtsupp : tsupport χ ⊆
                                    Set.univ.pi (fun i => Set.Ioo (a i) (b i))) :
                                  Function.support (fun x => χ x • G x) ⊆
                                    (Set.univ.pi fun i => Set.Ioo (a i) (b i))

                              Exact module and namespace context

                              Proof roadmap

                              1. 1Forget the closure and apply scalar support localization

                                Ordinary support lies in topological support, so supp χ⊆O. Apply the scalar ordinary-support product lemma to get supp H⊆O.

                              Full assumptions and notation

                              All objects and hypotheses

                              • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                              • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                              • χ:P→ℝ and G:P→P are arbitrary; H(x)=χ(x)G(x). No continuity, differentiability, or endpoint-order hypothesis.
                              • tsupport χ⊆O.

                              Mathematical proof

                              1. Forget the closure and apply scalar support localization

                              Ordinary support lies in topological support, so supp χ⊆O. Apply the scalar ordinary-support product lemma to get supp H⊆O.

                              \[\operatorname{supp}\chi\subseteq\operatorname{tsupp}\chi\subseteq O\Longrightarrow\operatorname{supp}(\chi G)\subseteq O.\]
                              Corresponding Lean step

                              support_subset_univ_pi_Ioo_of_tsupport_subset_univ_pi_Ioo hχtsupp; support_smul_subset_univ_pi_Ioo_of_scalar_support_subset_univ_pi_Ioo.

                              Lean verification

                              The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                              Lean proof · support_smul_subset_univ_pi_Ioo_of_scalar_tsupport_subset_univ_pi_Ioo

                              Ordinary support lies in topological support, so supp χ⊆O. Apply the scalar ordinary-support product lemma to get supp H⊆O. The Lean correspondence in that step identifies the exact existing rule or definitional reduction used.

                              Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                              Download module (.lean)
                              theorem support_smul_subset_univ_pi_Ioo_of_scalar_tsupport_subset_univ_pi_Ioo
                                  {n : ℕ}
                                  (a b : Fin (n + 1) → ℝ)
                                  (χ : (Fin (n + 1) → ℝ) → ℝ)
                                  (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                  (hχtsupp : tsupport χ ⊆
                                    Set.univ.pi (fun i => Set.Ioo (a i) (b i))) :
                                  Function.support (fun x => χ x • G x) ⊆
                                    (Set.univ.pi fun i => Set.Ioo (a i) (b i)) :=
                                support_smul_subset_univ_pi_Ioo_of_scalar_support_subset_univ_pi_Ioo a b χ G
                                  (support_subset_univ_pi_Ioo_of_tsupport_subset_univ_pi_Ioo hχtsupp)

                              Exact module and namespace context

                              Scope and omitted-condition boundaries
                              • This produces ordinary support containment, not a compact-support or regularity theorem.
                              Sources, dependencies, and reuse

                              Source and reuse

                              Samplinglib parents called

                              Mathlib API called (external library)

                              No direct Mathlib call recorded; see the Samplinglib parents.

                              Mathematical sources

                              Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                              Samplinglib mathematical lesson

                              Continuity of a scalar times a vector field on the closed box

                              AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.continuousOn_smul_vectorField_of_continuousOn · theorem · Teaching coverage

                              Read this first

                              Mathematical statement

                              For endpoints a,b and functions χ:P→ℝ and G:P→P continuous on K, the product H(x)=χ(x)G(x) is continuous on K.

                              \[\chi,G\in C^0(K)\quad\Longrightarrow\quad H=\chi G\in C^0(K).\]
                              Lean statement · continuousOn_smul_vectorField_of_continuousOn

                              This is a direct finite-box specialization of continuity under scalar multiplication; no derivative or face term is involved.

                              Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                              theorem continuousOn_smul_vectorField_of_continuousOn
                                  {n : ℕ}
                                  (a b : Fin (n + 1) → ℝ)
                                  (χ : (Fin (n + 1) → ℝ) → ℝ)
                                  (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                  (hχ : ContinuousOn χ (Set.Icc a b))
                                  (hG : ContinuousOn G (Set.Icc a b)) :
                                  ContinuousOn (fun x => χ x • G x) (Set.Icc a b)

                              Exact module and namespace context

                              Proof roadmap

                              1. 1Apply continuity of scalar multiplication

                                The map x↦(χ(x),G(x)) is continuous on K, and scalar multiplication ℝ×P→P is continuous. Their composition is H.

                              Full assumptions and notation

                              All objects and hypotheses

                              • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                              • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                              • χ:P→ℝ and G:P→P are continuous on K; no a≤b hypothesis.

                              Mathematical proof

                              1. Apply continuity of scalar multiplication

                              The map x↦(χ(x),G(x)) is continuous on K, and scalar multiplication ℝ×P→P is continuous. Their composition is H.

                              \[H=\operatorname{smul}\circ(\chi,G).\]
                              Corresponding Lean step

                              hχ.smul hG, the ContinuousOn.smul rule.

                              Lean verification

                              The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                              Lean proof · continuousOn_smul_vectorField_of_continuousOn

                              The map x↦(χ(x),G(x)) is continuous on K, and scalar multiplication ℝ×P→P is continuous. Their composition is H. The Lean correspondence in that step identifies the exact existing rule or definitional reduction used.

                              Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                              Download module (.lean)
                              theorem continuousOn_smul_vectorField_of_continuousOn
                                  {n : ℕ}
                                  (a b : Fin (n + 1) → ℝ)
                                  (χ : (Fin (n + 1) → ℝ) → ℝ)
                                  (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                  (hχ : ContinuousOn χ (Set.Icc a b))
                                  (hG : ContinuousOn G (Set.Icc a b)) :
                                  ContinuousOn (fun x => χ x • G x) (Set.Icc a b) :=
                                hχ.smul hG

                              Exact module and namespace context

                              Scope and omitted-condition boundaries
                              • Continuity is on the closed box only; no smoothness or support premise.
                              Sources, dependencies, and reuse

                              Source and reuse

                              Samplinglib parents called

                                Mathlib API called (external library)

                                • ContinuousOn.smul

                                Mathematical sources

                                • Current ASTIS source — Exact statement and actual proof/construction authority; raw code intentionally omitted from this packet.
                                • Existing curated module card — Existing declaration-specific attribution entry, read as documentation without a new source-equivalence verdict.
                                • Existing focused test — Exact named declaration invocation located in an existing example; no test was run.

                                Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                Samplinglib mathematical lesson

                                The pointwise scalar-vector product derivative

                                AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.hasFDerivAt_smul_vectorField_of_hasFDerivAt · theorem · Teaching coverage

                                Read this first

                                Mathematical statement

                                At x∈P, suppose χ:P→ℝ has derivative ℓ:P→L[ℝ]ℝ and G:P→P has derivative B:P→L[ℝ]P. Then H=χG has derivative M=χ(x)B+ℓ.smulRight(G(x)) at x.

                                \[D(\chi G)(x)[v]=\chi(x)B[v]+\ell[v]G(x).\]
                                Lean statement · hasFDerivAt_smul_vectorField_of_hasFDerivAt

                                `smulRight (G x)` sends v to ℓ(v)G(x). The theorem certifies a supplied derivative, not merely a formal product expression.

                                Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                theorem hasFDerivAt_smul_vectorField_of_hasFDerivAt
                                    {n : ℕ}
                                    (χ : (Fin (n + 1) → ℝ) → ℝ)
                                    (χ' : (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                    (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                    (G' : (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                    (x : Fin (n + 1) → ℝ)
                                    (hχ : HasFDerivAt χ χ' x)
                                    (hG : HasFDerivAt G G' x) :
                                    HasFDerivAt (fun y => χ y • G y)
                                      (χ x • G' + χ'.smulRight (G x)) x

                                Exact module and namespace context

                                Proof roadmap

                                1. 1Differentiate the scalar-vector bilinear operation

                                  In the increment v, the first-order change is the old scalar times the vector increment plus the scalar increment times the old vector. The product of two increments is higher order, yielding the displayed derivative.

                                Full assumptions and notation

                                All objects and hypotheses

                                • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                • χ:P→ℝ, G:P→P, x∈P, ℓ:P→L[ℝ]ℝ and B:P→L[ℝ]P.
                                • HasFDerivAt χ ℓ x and HasFDerivAt G B x. No endpoints, exceptional set, or continuity-on-box parameters.

                                Mathematical proof

                                1. Differentiate the scalar-vector bilinear operation

                                In the increment v, the first-order change is the old scalar times the vector increment plus the scalar increment times the old vector. The product of two increments is higher order, yielding the displayed derivative.

                                \[(\chi G)(x+v)-(\chi G)(x)=\chi(x)B[v]+\ell[v]G(x)+o(\|v\|).\]
                                Corresponding Lean step

                                hχ.smul hG, followed by simpa, is Mathlib's HasFDerivAt.smul product rule.

                                Lean verification

                                The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                Lean proof · hasFDerivAt_smul_vectorField_of_hasFDerivAt

                                In the increment v, the first-order change is the old scalar times the vector increment plus the scalar increment times the old vector. The product of two increments is higher order, yielding the displayed derivative. The Lean correspondence in that step identifies the exact existing rule or definitional reduction used.

                                Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                Download module (.lean)
                                theorem hasFDerivAt_smul_vectorField_of_hasFDerivAt
                                    {n : ℕ}
                                    (χ : (Fin (n + 1) → ℝ) → ℝ)
                                    (χ' : (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                    (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                    (G' : (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                    (x : Fin (n + 1) → ℝ)
                                    (hχ : HasFDerivAt χ χ' x)
                                    (hG : HasFDerivAt G G' x) :
                                    HasFDerivAt (fun y => χ y • G y)
                                      (χ x • G' + χ'.smulRight (G x)) x := by
                                  simpa using hχ.smul hG

                                Exact module and namespace context

                                Scope and omitted-condition boundaries
                                • No box, integration, or a.e. conclusion.
                                Sources, dependencies, and reuse

                                Source and reuse

                                Samplinglib parents called

                                  Mathlib API called (external library)

                                  • HasFDerivAt.smul
                                  • ContinuousLinearMap.smulRight_apply

                                  Mathematical sources

                                  Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                  Samplinglib mathematical lesson

                                  Apply the product derivative on a common exceptional-set complement

                                  AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.hasFDerivAt_smul_vectorField_off_countable · theorem · Teaching coverage

                                  Read this first

                                  Mathematical statement

                                  For endpoints a,b, arbitrary s⊆P, and fields χ,G,ℓ,B, suppose χ has derivative ℓ(x) and G has derivative B(x) at every x∈O∖s. Then χG has derivative M(x)=χ(x)B(x)+ℓ(x).smulRight(G(x)) at every such x.

                                  \[D\chi=\ell,\ DG=B\text{ on }O\setminus s\quad\Longrightarrow\quad D(\chi G)=M\text{ on }O\setminus s.\]
                                  Lean statement · hasFDerivAt_smul_vectorField_off_countable

                                  This is a pointwise quantification wrapper. Countability is not used until a later theorem wants to ignore s in a Lebesgue-a.e. argument.

                                  Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                  theorem hasFDerivAt_smul_vectorField_off_countable
                                      {n : ℕ}
                                      (a b : Fin (n + 1) → ℝ)
                                      (χ : (Fin (n + 1) → ℝ) → ℝ)
                                      (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                      (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                      (G' : (Fin (n + 1) → ℝ) →
                                        (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                      (s : Set (Fin (n + 1) → ℝ))
                                      (hχ : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                        HasFDerivAt χ (χ' x) x)
                                      (hG : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                        HasFDerivAt G (G' x) x) :
                                      ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                        HasFDerivAt (fun y => χ y • G y)
                                          (χ x • G' x + (χ' x).smulRight (G x)) x

                                  Exact module and namespace context

                                  Proof roadmap

                                  1. 1Fix an allowed point and use both derivative witnesses

                                    For x∈O∖s, the two hypotheses give actual derivatives at that same x. Apply the pointwise scalar-vector product rule there; x was arbitrary in the good set.

                                  Full assumptions and notation

                                  All objects and hypotheses

                                  • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                  • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                  • χ:P→ℝ, G:P→P, ℓ:P→(P→L[ℝ]ℝ), and B:P→(P→L[ℝ]P). Set M(x)=χ(x)B(x)+ℓ(x).smulRight(G(x)); thus M(x)v=χ(x)B(x)v+ℓ(x)[v]G(x). Set σ(x)=Σ_i(M(x)e_i)_i.
                                  • s⊆P is arbitrary: despite the declaration name, no s.Countable hypothesis is present.
                                  • For each x∈O∖s, HasFDerivAt χ (ℓ x) x and HasFDerivAt G (B x) x. No a≤b or closed-box continuity premise.

                                  Mathematical proof

                                  1. Fix an allowed point and use both derivative witnesses

                                  For x∈O∖s, the two hypotheses give actual derivatives at that same x. Apply the pointwise scalar-vector product rule there; x was arbitrary in the good set.

                                  \[x\in O\setminus s\Longrightarrow D(\chi G)(x)[v]=\chi(x)B(x)[v]+\ell(x)[v]G(x).\]
                                  Corresponding Lean step

                                  hasFDerivAt_smul_vectorField_of_hasFDerivAt χ (χ' x) G (G' x) x (hχ x hx) (hG x hx).

                                  Lean verification

                                  The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                  Lean proof · hasFDerivAt_smul_vectorField_off_countable

                                  For x∈O∖s, the two hypotheses give actual derivatives at that same x. Apply the pointwise scalar-vector product rule there; x was arbitrary in the good set. The Lean correspondence in that step identifies the exact existing rule or definitional reduction used.

                                  Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                  Download module (.lean)
                                  theorem hasFDerivAt_smul_vectorField_off_countable
                                      {n : ℕ}
                                      (a b : Fin (n + 1) → ℝ)
                                      (χ : (Fin (n + 1) → ℝ) → ℝ)
                                      (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                      (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                      (G' : (Fin (n + 1) → ℝ) →
                                        (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                      (s : Set (Fin (n + 1) → ℝ))
                                      (hχ : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                        HasFDerivAt χ (χ' x) x)
                                      (hG : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                        HasFDerivAt G (G' x) x) :
                                      ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                        HasFDerivAt (fun y => χ y • G y)
                                          (χ x • G' x + (χ' x).smulRight (G x)) x := by
                                    intro x hx
                                    exact hasFDerivAt_smul_vectorField_of_hasFDerivAt χ (χ' x) G (G' x) x
                                      (hχ x hx) (hG x hx)

                                  Exact module and namespace context

                                  Scope and omitted-condition boundaries
                                  • Do not silently add s.Countable to this statement, or infer an a.e. result for arbitrary s.
                                  Sources, dependencies, and reuse

                                  Source and reuse

                                  Samplinglib parents called

                                  Mathlib API called (external library)

                                  No direct Mathlib call recorded; see the Samplinglib parents.

                                  Mathematical sources

                                  Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                  Samplinglib mathematical lesson

                                  Continuity of the product-rule trace from exactly its scalar components

                                  AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.continuousOn_smul_vectorField_trace_of_component_continuousOn · theorem · Teaching coverage

                                  Read this first

                                  Mathematical statement

                                  For endpoints a,b and fields χ,G,ℓ,B, assume χ is continuous on K and, for every i, the scalar functions G_i, x↦ℓ(x)[e_i], and x↦(B(x)e_i)_i are continuous on K. Then σ(x)=Σ_i(M(x)e_i)_i is continuous on K.

                                  \[M(x)v=\chi(x)B(x)v+\ell(x)[v]G(x),\qquad \sigma(x)=\sum_i\left[\chi(x)(B(x)e_i)_i+\ell(x)[e_i]G_i(x)\right],\qquad \sigma\in C^0(K).\]
                                  Lean statement · continuousOn_smul_vectorField_trace_of_component_continuousOn

                                  The primes in χ′ and G′ name supplied linear-map fields. This theorem does not certify that they are derivatives; it only proves continuity of their algebraic trace expression.

                                  Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                  theorem continuousOn_smul_vectorField_trace_of_component_continuousOn
                                      {n : ℕ}
                                      (a b : Fin (n + 1) → ℝ)
                                      (χ : (Fin (n + 1) → ℝ) → ℝ)
                                      (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                      (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                      (G' : (Fin (n + 1) → ℝ) →
                                        (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                      (hχ : ContinuousOn χ (Set.Icc a b))
                                      (hG : ∀ i, ContinuousOn (fun x => G x i) (Set.Icc a b))
                                      (hχ' : ∀ i, ContinuousOn
                                        (fun x => χ' x (Pi.single i (1 : ℝ))) (Set.Icc a b))
                                      (hG' : ∀ i, ContinuousOn
                                        (fun x => (G' x (Pi.single i (1 : ℝ))) i) (Set.Icc a b)) :
                                      ContinuousOn
                                        (fun x => ∑ i, ((χ x • G' x + (χ' x).smulRight (G x))
                                          (Pi.single i (1 : ℝ))) i)
                                        (Set.Icc a b)

                                  Exact module and namespace context

                                  Proof roadmap

                                  1. 1Expand one trace summand

                                    By the definitions of scalar multiplication and smulRight, the i-th summand is χ(x)(B(x)e_i)_i+ℓ(x)[e_i]G_i(x).

                                  2. 2Use continuity of products and the finite sum

                                    Both products are continuous by precisely the component hypotheses. Their sum is continuous, and summing over finitely many i preserves continuity on K.

                                  Full assumptions and notation

                                  All objects and hypotheses

                                  • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                  • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                  • χ:P→ℝ, G:P→P, ℓ:P→(P→L[ℝ]ℝ), and B:P→(P→L[ℝ]P). Set M(x)=χ(x)B(x)+ℓ(x).smulRight(G(x)); thus M(x)v=χ(x)B(x)v+ℓ(x)[v]G(x). Set σ(x)=Σ_i(M(x)e_i)_i.
                                  • χ is continuous on K; for every i, G_i, ℓ(·)[e_i], and (B(·)e_i)_i are continuous on K.
                                  • No derivative-existence claim about ℓ or B; no a≤b premise; full operator-valued continuity is not required.

                                  Mathematical proof

                                  1. Expand one trace summand

                                  By the definitions of scalar multiplication and smulRight, the i-th summand is χ(x)(B(x)e_i)_i+ℓ(x)[e_i]G_i(x).

                                  \[(M(x)e_i)_i=\chi(x)(B(x)e_i)_i+\ell(x)[e_i]G_i(x).\]
                                  Corresponding Lean step

                                  add_apply; ContinuousLinearMap.smulRight_apply; Pi.smul_apply; smul_eq_mul.

                                  2. Use continuity of products and the finite sum

                                  Both products are continuous by precisely the component hypotheses. Their sum is continuous, and summing over finitely many i preserves continuity on K.

                                  \[\sigma=\sum_i\bigl[\chi\,(B e_i)_i+\ell[e_i]\,G_i\bigr]\in C^0(K).\]
                                  Corresponding Lean step

                                  (hχ.mul (hG' i)).add ((hχ' i).mul (hG i)); continuousOn_finsetSum Finset.univ.

                                  Lean verification

                                  The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                  Lean proof · continuousOn_smul_vectorField_trace_of_component_continuousOn

                                  The source first by the definitions of scalar multiplication and smulRight, the i-th summand is χ(x)(B(x)e_i)_i+ℓ(x)[e_i]G_i(x). It finishes as follows: Both products are continuous by precisely the component hypotheses. Their sum is continuous, and summing over finitely many i preserves continuity on K. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                                  Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                  Download module (.lean)
                                  theorem continuousOn_smul_vectorField_trace_of_component_continuousOn
                                      {n : ℕ}
                                      (a b : Fin (n + 1) → ℝ)
                                      (χ : (Fin (n + 1) → ℝ) → ℝ)
                                      (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                      (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                      (G' : (Fin (n + 1) → ℝ) →
                                        (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                      (hχ : ContinuousOn χ (Set.Icc a b))
                                      (hG : ∀ i, ContinuousOn (fun x => G x i) (Set.Icc a b))
                                      (hχ' : ∀ i, ContinuousOn
                                        (fun x => χ' x (Pi.single i (1 : ℝ))) (Set.Icc a b))
                                      (hG' : ∀ i, ContinuousOn
                                        (fun x => (G' x (Pi.single i (1 : ℝ))) i) (Set.Icc a b)) :
                                      ContinuousOn
                                        (fun x => ∑ i, ((χ x • G' x + (χ' x).smulRight (G x))
                                          (Pi.single i (1 : ℝ))) i)
                                        (Set.Icc a b) := by
                                    refine continuousOn_finsetSum Finset.univ ?_
                                    intro i _hi
                                    have hscalar : ContinuousOn
                                        (fun x => χ x * ((G' x (Pi.single i (1 : ℝ))) i) +
                                          (χ' x (Pi.single i (1 : ℝ))) * G x i)
                                        (Set.Icc a b) :=
                                      (hχ.mul (hG' i)).add ((hχ' i).mul (hG i))
                                    simpa [add_apply, ContinuousLinearMap.smulRight_apply, Pi.smul_apply,
                                      smul_eq_mul] using hscalar

                                  Exact module and namespace context

                                  Scope and omitted-condition boundaries
                                  • No differentiability, integrability or boundary cancellation is concluded.
                                  Sources, dependencies, and reuse

                                  Source and reuse

                                  Samplinglib parents called

                                    Mathlib API called (external library)

                                    • ContinuousOn.mul
                                    • ContinuousOn.add
                                    • continuousOn_finsetSum
                                    • ContinuousLinearMap.smulRight_apply

                                    Mathematical sources

                                    • Current ASTIS source — Exact statement and actual proof/construction authority; raw code intentionally omitted from this packet.
                                    • Existing curated module card — Existing declaration-specific attribution entry, read as documentation without a new source-equivalence verdict.
                                    • Existing focused test — Exact named declaration invocation located in an existing example; no test was run.

                                    Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                    Samplinglib mathematical lesson

                                    Full field continuity implies continuity of the product-rule trace

                                    AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.continuousOn_smul_vectorField_trace_of_components · theorem · Teaching coverage

                                    Read this first

                                    Mathematical statement

                                    For endpoints a,b and fields χ,G,ℓ,B, if all four maps are continuous on K (ℓ and B in their operator norm topologies), then σ, the product-rule trace expression, is continuous on K.

                                    \[M(x)v=\chi(x)B(x)v+\ell(x)[v]G(x),\qquad \sigma(x)=\sum_i\left[\chi(x)(B(x)e_i)_i+\ell(x)[e_i]G_i(x)\right],\qquad \chi,\ell,G,B\in C^0(K)\Longrightarrow\sigma\in C^0(K).\]
                                    Lean statement · continuousOn_smul_vectorField_trace_of_components

                                    This wrapper strengthens the inputs to full field continuity for convenience; it does not change the output trace expression.

                                    Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                    theorem continuousOn_smul_vectorField_trace_of_components
                                        {n : ℕ}
                                        (a b : Fin (n + 1) → ℝ)
                                        (χ : (Fin (n + 1) → ℝ) → ℝ)
                                        (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                        (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                        (G' : (Fin (n + 1) → ℝ) →
                                          (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                        (hχc : ContinuousOn χ (Set.Icc a b))
                                        (hχ'c : ContinuousOn χ' (Set.Icc a b))
                                        (hGc : ContinuousOn G (Set.Icc a b))
                                        (hG'c : ContinuousOn G' (Set.Icc a b)) :
                                        ContinuousOn
                                          (fun x => ∑ i, ((χ x • G' x + (χ' x).smulRight (G x))
                                            (Pi.single i (1 : ℝ))) i)
                                          (Set.Icc a b)

                                    Exact module and namespace context

                                    Proof roadmap

                                    1. 1Extract the needed scalar component continuities

                                      Coordinate projections preserve continuity of G. Evaluation at fixed e_i preserves continuity of ℓ and B; composing the latter with coordinate i gives continuity of (B e_i)_i.

                                    2. 2Apply the scalar-component trace theorem

                                      The preceding lemma now assembles the continuous products and finite sum into σ.

                                    Full assumptions and notation

                                    All objects and hypotheses

                                    • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                    • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                    • χ:P→ℝ, G:P→P, ℓ:P→(P→L[ℝ]ℝ), and B:P→(P→L[ℝ]P). Set M(x)=χ(x)B(x)+ℓ(x).smulRight(G(x)); thus M(x)v=χ(x)B(x)v+ℓ(x)[v]G(x). Set σ(x)=Σ_i(M(x)e_i)_i.
                                    • χ, ℓ, G and B are each ContinuousOn K as maps into their stated scalar, vector, or continuous-linear-map spaces.
                                    • No derivative correctness or a≤b hypothesis.

                                    Mathematical proof

                                    1. Extract the needed scalar component continuities

                                    Coordinate projections preserve continuity of G. Evaluation at fixed e_i preserves continuity of ℓ and B; composing the latter with coordinate i gives continuity of (B e_i)_i.

                                    \[G,\ell,B\in C^0(K)\Longrightarrow G_i,\ \ell[e_i],\ (B e_i)_i\in C^0(K).\]
                                    Corresponding Lean step

                                    (continuous_apply i).comp_continuousOn hGc; hχ'c.clm_apply continuousOn_const; (continuous_apply i).comp_continuousOn (hG'c.clm_apply continuousOn_const).

                                    2. Apply the scalar-component trace theorem

                                    The preceding lemma now assembles the continuous products and finite sum into σ.

                                    \[\sigma\in C^0(K).\]
                                    Corresponding Lean step

                                    continuousOn_smul_vectorField_trace_of_component_continuousOn a b χ χ' G G' hχc ....

                                    Lean verification

                                    The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                    Lean proof · continuousOn_smul_vectorField_trace_of_components

                                    The source first coordinate projections preserve continuity of G. Evaluation at fixed e_i preserves continuity of ℓ and B; composing the latter with coordinate i gives continuity of (B e_i)_i. It finishes as follows: The preceding lemma now assembles the continuous products and finite sum into σ. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                                    Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                    Download module (.lean)
                                    theorem continuousOn_smul_vectorField_trace_of_components
                                        {n : ℕ}
                                        (a b : Fin (n + 1) → ℝ)
                                        (χ : (Fin (n + 1) → ℝ) → ℝ)
                                        (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                        (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                        (G' : (Fin (n + 1) → ℝ) →
                                          (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                        (hχc : ContinuousOn χ (Set.Icc a b))
                                        (hχ'c : ContinuousOn χ' (Set.Icc a b))
                                        (hGc : ContinuousOn G (Set.Icc a b))
                                        (hG'c : ContinuousOn G' (Set.Icc a b)) :
                                        ContinuousOn
                                          (fun x => ∑ i, ((χ x • G' x + (χ' x).smulRight (G x))
                                            (Pi.single i (1 : ℝ))) i)
                                          (Set.Icc a b) := by
                                      exact continuousOn_smul_vectorField_trace_of_component_continuousOn a b χ χ' G G' hχc
                                        (fun i => (continuous_apply i).comp_continuousOn hGc)
                                        (fun i => hχ'c.clm_apply continuousOn_const)
                                        (fun i =>
                                          (continuous_apply i).comp_continuousOn
                                            (hG'c.clm_apply continuousOn_const))

                                    Exact module and namespace context

                                    Scope and omitted-condition boundaries
                                    • Continuity of a named derivative field is not proof that it is an actual derivative.
                                    Sources, dependencies, and reuse

                                    Source and reuse

                                    Samplinglib parents called

                                    Mathlib API called (external library)

                                    • continuous_apply
                                    • Continuous.comp_continuousOn
                                    • ContinuousOn.clm_apply

                                    Mathematical sources

                                    Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                    Samplinglib mathematical lesson

                                    A continuous product-rule trace is integrable on a closed box

                                    AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.integrableOn_smul_vectorField_trace_of_continuousOn · theorem · Teaching coverage

                                    Read this first

                                    Mathematical statement

                                    For endpoints a,b and fields χ,G,ℓ,B, if σ(x)=Σ_i(M(x)e_i)_i is continuous on K, then σ is Lebesgue-integrable on K.

                                    \[M(x)v=\chi(x)B(x)v+\ell(x)[v]G(x),\qquad \sigma(x)=\sum_i\left[\chi(x)(B(x)e_i)_i+\ell(x)[e_i]G_i(x)\right],\qquad\sigma\in C^0(K)\Longrightarrow\sigma\in L^1(K,dx).\]
                                    Lean statement · integrableOn_smul_vectorField_trace_of_continuousOn

                                    This solves the trace-integrability obligation only after trace continuity has been supplied. The supplied fields are not asserted to be derivatives.

                                    Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                    theorem integrableOn_smul_vectorField_trace_of_continuousOn
                                        {n : ℕ}
                                        (a b : Fin (n + 1) → ℝ)
                                        (χ : (Fin (n + 1) → ℝ) → ℝ)
                                        (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                        (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                        (G' : (Fin (n + 1) → ℝ) →
                                          (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                        (htrace : ContinuousOn
                                          (fun x => ∑ i, ((χ x • G' x + (χ' x).smulRight (G x))
                                            (Pi.single i (1 : ℝ))) i)
                                          (Set.Icc a b)) :
                                        IntegrableOn
                                          (fun x => ∑ i, ((χ x • G' x + (χ' x).smulRight (G x))
                                            (Pi.single i (1 : ℝ))) i)
                                          (Set.Icc a b) volume

                                    Exact module and namespace context

                                    Proof roadmap

                                    1. 1Integrate a continuous function over a compact box

                                      K is a compact finite-dimensional closed box. A continuous real function on such a set is integrable for restricted Lebesgue measure.

                                    Full assumptions and notation

                                    All objects and hypotheses

                                    • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                    • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                    • χ:P→ℝ, G:P→P, ℓ:P→(P→L[ℝ]ℝ), and B:P→(P→L[ℝ]P). Set M(x)=χ(x)B(x)+ℓ(x).smulRight(G(x)); thus M(x)v=χ(x)B(x)v+ℓ(x)[v]G(x). Set σ(x)=Σ_i(M(x)e_i)_i.
                                    • Only σ is assumed continuous on K. No separate continuity of χ,ℓ,G,B, no derivative correctness, and no endpoint-order premise.

                                    Mathematical proof

                                    1. Integrate a continuous function over a compact box

                                    K is a compact finite-dimensional closed box. A continuous real function on such a set is integrable for restricted Lebesgue measure.

                                    \[K\text{ compact},\quad \sigma\in C^0(K)\Longrightarrow \sigma\in L^1(K,dx).\]
                                    Corresponding Lean step

                                    htrace.integrableOn_compact isCompact_Icc.

                                    Lean verification

                                    The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                    Lean proof · integrableOn_smul_vectorField_trace_of_continuousOn

                                    K is a compact finite-dimensional closed box. A continuous real function on such a set is integrable for restricted Lebesgue measure. The Lean correspondence in that step identifies the exact existing rule or definitional reduction used.

                                    Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                    Download module (.lean)
                                    theorem integrableOn_smul_vectorField_trace_of_continuousOn
                                        {n : ℕ}
                                        (a b : Fin (n + 1) → ℝ)
                                        (χ : (Fin (n + 1) → ℝ) → ℝ)
                                        (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                        (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                        (G' : (Fin (n + 1) → ℝ) →
                                          (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                        (htrace : ContinuousOn
                                          (fun x => ∑ i, ((χ x • G' x + (χ' x).smulRight (G x))
                                            (Pi.single i (1 : ℝ))) i)
                                          (Set.Icc a b)) :
                                        IntegrableOn
                                          (fun x => ∑ i, ((χ x • G' x + (χ' x).smulRight (G x))
                                            (Pi.single i (1 : ℝ))) i)
                                          (Set.Icc a b) volume :=
                                      htrace.integrableOn_compact isCompact_Icc

                                    Exact module and namespace context

                                    Scope and omitted-condition boundaries
                                    • Compact-box integrability does not imply whole-space integrability.
                                    Sources, dependencies, and reuse

                                    Source and reuse

                                    Samplinglib parents called

                                      Mathlib API called (external library)

                                      • ContinuousOn.integrableOn_compact
                                      • isCompact_Icc

                                      Mathematical sources

                                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                      Samplinglib mathematical lesson

                                      A scalar cutoff zero off the box cancels product-field faces

                                      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.signedFaceTermSum_smul_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo · theorem · Teaching coverage

                                      Read this first

                                      Mathematical statement

                                      For arbitrary endpoints a,b and functions χ:P→ℝ and G:P→P, assume χ(x)=0 for every x∉O. Then the signed face sum of H(x)=χ(x)G(x) is zero.

                                      \[\chi|_{P\setminus O}=0\Longrightarrow\Phi_{a,b}(\chi G)=0.\]
                                      Lean statement · signedFaceTermSum_smul_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo

                                      The conclusion concerns only the face-integral expression for the product. Scalar support does not automatically supply the product's continuity or derivative trace integrability.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      theorem signedFaceTermSum_smul_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (hχ : ∀ x ∉ (Set.univ.pi fun i => Set.Ioo (a i) (b i)), χ x = 0) :
                                          ∑ i : Fin (n + 1),
                                              ((∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                                                  (χ (i.insertNth (b i) x) • G (i.insertNth (b i) x)) i) -
                                                ∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                                                  (χ (i.insertNth (a i) x) • G (i.insertNth (a i) x)) i) = 0

                                      Exact module and namespace context

                                      Proof roadmap

                                      1. 1Localize the product's nonzero set

                                        The scalar condition makes χG zero outside O, so its ordinary support lies in O.

                                      2. 2Cancel the supported product's faces

                                        Apply the vector-support-to-face theorem to H=χG. It makes each normal component zero on the endpoint hyperplanes and gives the zero signed sum.

                                      Full assumptions and notation

                                      All objects and hypotheses

                                      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                      • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                      • χ:P→ℝ and G:P→P; H=χG.
                                      • For each i, K_hat_i=∏_{j≠i}[a_j,b_j] is parametrized by Fin n→ℝ; I_i^c inserts c in coordinate i, retaining the other coordinates in their original order. Φ_a,b(F) is the sum of upper-face integrals of F_i minus lower-face integrals of F_i.
                                      • χ(x)=0 for every x∉O.
                                      • No a≤b, regularity, or integrability assumption.

                                      Notation and interpretation

                                      Notation used below

                                      For each i, K_hat_i=∏_{j≠i}[a_j,b_j] is parametrized by Fin n→ℝ; I_i^c inserts c in coordinate i, retaining the other coordinates in their original order. Φ_a,b(F) is the sum of upper-face integrals of F_i minus lower-face integrals of F_i.

                                      \[\Phi_{a,b}(F):=\sum_{i=0}^{d-1}\left[\int_{K_{\widehat i}}F_i(I_i^{b_i}z)\,dz-\int_{K_{\widehat i}}F_i(I_i^{a_i}z)\,dz\right]\]

                                      Mathematical proof

                                      1. Localize the product's nonzero set

                                      The scalar condition makes χG zero outside O, so its ordinary support lies in O.

                                      \[\operatorname{supp}(\chi G)\subseteq O.\]
                                      Corresponding Lean step

                                      support_smul_subset_univ_pi_Ioo_of_eq_zero_off_univ_pi_Ioo a b χ G.

                                      2. Cancel the supported product's faces

                                      Apply the vector-support-to-face theorem to H=χG. It makes each normal component zero on the endpoint hyperplanes and gives the zero signed sum.

                                      \[\Phi_{a,b}(\chi G)=0.\]
                                      Corresponding Lean step

                                      signedFaceTermSum_eq_zero_of_support_subset_univ_pi_Ioo a b (fun x => χ x • G x).

                                      Lean verification

                                      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                      Lean proof · signedFaceTermSum_smul_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo

                                      The source first the scalar condition makes χG zero outside O, so its ordinary support lies in O. It finishes as follows: Apply the vector-support-to-face theorem to H=χG. It makes each normal component zero on the endpoint hyperplanes and gives the zero signed sum. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      Download module (.lean)
                                      theorem signedFaceTermSum_smul_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (hχ : ∀ x ∉ (Set.univ.pi fun i => Set.Ioo (a i) (b i)), χ x = 0) :
                                          ∑ i : Fin (n + 1),
                                              ((∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                                                  (χ (i.insertNth (b i) x) • G (i.insertNth (b i) x)) i) -
                                                ∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                                                  (χ (i.insertNth (a i) x) • G (i.insertNth (a i) x)) i) = 0 :=
                                        signedFaceTermSum_eq_zero_of_support_subset_univ_pi_Ioo a b (fun x => χ x • G x)
                                          (support_smul_subset_univ_pi_Ioo_of_eq_zero_off_univ_pi_Ioo a b χ G hχ)

                                      Exact module and namespace context

                                      Scope and omitted-condition boundaries
                                      • No integral of divergence is claimed by this boundary-only lemma.
                                      Sources, dependencies, and reuse

                                      Source and reuse

                                      Samplinglib parents called

                                      Mathlib API called (external library)

                                      No direct Mathlib call recorded; see the Samplinglib parents.

                                      Mathematical sources

                                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                      Samplinglib mathematical lesson

                                      Scalar ordinary support cancels product-field faces

                                      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.signedFaceTermSum_smul_eq_zero_of_scalar_support_subset_univ_pi_Ioo · theorem · Teaching coverage

                                      Read this first

                                      Mathematical statement

                                      For arbitrary endpoints a,b and functions χ:P→ℝ and G:P→P, assume supp χ⊆O. Then the signed face sum of H(x)=χ(x)G(x) is zero.

                                      \[\operatorname{supp}\chi\subseteq O\Longrightarrow\Phi_{a,b}(\chi G)=0.\]
                                      Lean statement · signedFaceTermSum_smul_eq_zero_of_scalar_support_subset_univ_pi_Ioo

                                      The conclusion concerns only the face-integral expression for the product. Scalar support does not automatically supply the product's continuity or derivative trace integrability.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      theorem signedFaceTermSum_smul_eq_zero_of_scalar_support_subset_univ_pi_Ioo
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (hχsupp : Function.support χ ⊆
                                            (Set.univ.pi fun i => Set.Ioo (a i) (b i))) :
                                          ∑ i : Fin (n + 1),
                                              ((∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                                                  (χ (i.insertNth (b i) x) • G (i.insertNth (b i) x)) i) -
                                                ∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                                                  (χ (i.insertNth (a i) x) • G (i.insertNth (a i) x)) i) = 0

                                      Exact module and namespace context

                                      Proof roadmap

                                      1. 1Localize the product's nonzero set

                                        The scalar condition makes χG zero outside O, so its ordinary support lies in O.

                                      2. 2Cancel the supported product's faces

                                        Apply the vector-support-to-face theorem to H=χG. It makes each normal component zero on the endpoint hyperplanes and gives the zero signed sum.

                                      Full assumptions and notation

                                      All objects and hypotheses

                                      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                      • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                      • χ:P→ℝ and G:P→P; H=χG.
                                      • For each i, K_hat_i=∏_{j≠i}[a_j,b_j] is parametrized by Fin n→ℝ; I_i^c inserts c in coordinate i, retaining the other coordinates in their original order. Φ_a,b(F) is the sum of upper-face integrals of F_i minus lower-face integrals of F_i.
                                      • supp χ⊆O.
                                      • No a≤b, regularity, or integrability assumption.

                                      Notation and interpretation

                                      Notation used below

                                      For each i, K_hat_i=∏_{j≠i}[a_j,b_j] is parametrized by Fin n→ℝ; I_i^c inserts c in coordinate i, retaining the other coordinates in their original order. Φ_a,b(F) is the sum of upper-face integrals of F_i minus lower-face integrals of F_i.

                                      \[\Phi_{a,b}(F):=\sum_{i=0}^{d-1}\left[\int_{K_{\widehat i}}F_i(I_i^{b_i}z)\,dz-\int_{K_{\widehat i}}F_i(I_i^{a_i}z)\,dz\right]\]

                                      Mathematical proof

                                      1. Localize the product's nonzero set

                                      The scalar condition makes χG zero outside O, so its ordinary support lies in O.

                                      \[\operatorname{supp}(\chi G)\subseteq O.\]
                                      Corresponding Lean step

                                      support_smul_subset_univ_pi_Ioo_of_scalar_support_subset_univ_pi_Ioo a b χ G.

                                      2. Cancel the supported product's faces

                                      Apply the vector-support-to-face theorem to H=χG. It makes each normal component zero on the endpoint hyperplanes and gives the zero signed sum.

                                      \[\Phi_{a,b}(\chi G)=0.\]
                                      Corresponding Lean step

                                      signedFaceTermSum_eq_zero_of_support_subset_univ_pi_Ioo a b (fun x => χ x • G x).

                                      Lean verification

                                      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                      Lean proof · signedFaceTermSum_smul_eq_zero_of_scalar_support_subset_univ_pi_Ioo

                                      The source first the scalar condition makes χG zero outside O, so its ordinary support lies in O. It finishes as follows: Apply the vector-support-to-face theorem to H=χG. It makes each normal component zero on the endpoint hyperplanes and gives the zero signed sum. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      Download module (.lean)
                                      theorem signedFaceTermSum_smul_eq_zero_of_scalar_support_subset_univ_pi_Ioo
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (hχsupp : Function.support χ ⊆
                                            (Set.univ.pi fun i => Set.Ioo (a i) (b i))) :
                                          ∑ i : Fin (n + 1),
                                              ((∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                                                  (χ (i.insertNth (b i) x) • G (i.insertNth (b i) x)) i) -
                                                ∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                                                  (χ (i.insertNth (a i) x) • G (i.insertNth (a i) x)) i) = 0 :=
                                        signedFaceTermSum_eq_zero_of_support_subset_univ_pi_Ioo a b (fun x => χ x • G x)
                                          (support_smul_subset_univ_pi_Ioo_of_scalar_support_subset_univ_pi_Ioo a b χ G hχsupp)

                                      Exact module and namespace context

                                      Scope and omitted-condition boundaries
                                      • No integral of divergence is claimed by this boundary-only lemma.
                                      Sources, dependencies, and reuse

                                      Source and reuse

                                      Samplinglib parents called

                                      Mathlib API called (external library)

                                      No direct Mathlib call recorded; see the Samplinglib parents.

                                      Mathematical sources

                                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                      Samplinglib mathematical lesson

                                      Scalar topological support cancels product-field faces

                                      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.signedFaceTermSum_smul_eq_zero_of_scalar_tsupport_subset_univ_pi_Ioo · theorem · Teaching coverage

                                      Read this first

                                      Mathematical statement

                                      For arbitrary endpoints a,b and functions χ:P→ℝ and G:P→P, assume tsupp χ⊆O. Then the signed face sum of H(x)=χ(x)G(x) is zero.

                                      \[\operatorname{tsupp}\chi\subseteq O\Longrightarrow\Phi_{a,b}(\chi G)=0.\]
                                      Lean statement · signedFaceTermSum_smul_eq_zero_of_scalar_tsupport_subset_univ_pi_Ioo

                                      The conclusion concerns only the face-integral expression for the product. Scalar support does not automatically supply the product's continuity or derivative trace integrability.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      theorem signedFaceTermSum_smul_eq_zero_of_scalar_tsupport_subset_univ_pi_Ioo
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (hχtsupp : tsupport χ ⊆
                                            Set.univ.pi (fun i => Set.Ioo (a i) (b i))) :
                                          ∑ i : Fin (n + 1),
                                              ((∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                                                  (χ (i.insertNth (b i) x) • G (i.insertNth (b i) x)) i) -
                                                ∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                                                  (χ (i.insertNth (a i) x) • G (i.insertNth (a i) x)) i) = 0

                                      Exact module and namespace context

                                      Proof roadmap

                                      1. 1Pass from closed support to ordinary support

                                        Ordinary support lies in tsupport, giving supp χ⊆O. The already-proved scalar-support face theorem applies to the same product.

                                      Full assumptions and notation

                                      All objects and hypotheses

                                      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                      • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                      • χ:P→ℝ and G:P→P; H=χG.
                                      • For each i, K_hat_i=∏_{j≠i}[a_j,b_j] is parametrized by Fin n→ℝ; I_i^c inserts c in coordinate i, retaining the other coordinates in their original order. Φ_a,b(F) is the sum of upper-face integrals of F_i minus lower-face integrals of F_i.
                                      • tsupp χ⊆O.
                                      • No a≤b, regularity, or integrability assumption.

                                      Notation and interpretation

                                      Notation used below

                                      For each i, K_hat_i=∏_{j≠i}[a_j,b_j] is parametrized by Fin n→ℝ; I_i^c inserts c in coordinate i, retaining the other coordinates in their original order. Φ_a,b(F) is the sum of upper-face integrals of F_i minus lower-face integrals of F_i.

                                      \[\Phi_{a,b}(F):=\sum_{i=0}^{d-1}\left[\int_{K_{\widehat i}}F_i(I_i^{b_i}z)\,dz-\int_{K_{\widehat i}}F_i(I_i^{a_i}z)\,dz\right]\]

                                      Mathematical proof

                                      1. Pass from closed support to ordinary support

                                      Ordinary support lies in tsupport, giving supp χ⊆O. The already-proved scalar-support face theorem applies to the same product.

                                      \[\operatorname{supp}\chi\subseteq\operatorname{tsupp}\chi\subseteq O\Longrightarrow\Phi_{a,b}(\chi G)=0.\]
                                      Corresponding Lean step

                                      support_subset_univ_pi_Ioo_of_tsupport_subset_univ_pi_Ioo; signedFaceTermSum_smul_eq_zero_of_scalar_support_subset_univ_pi_Ioo.

                                      Lean verification

                                      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                      Lean proof · signedFaceTermSum_smul_eq_zero_of_scalar_tsupport_subset_univ_pi_Ioo

                                      Ordinary support lies in tsupport, giving supp χ⊆O. The already-proved scalar-support face theorem applies to the same product. The Lean correspondence in that step identifies the exact existing rule or definitional reduction used.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      Download module (.lean)
                                      theorem signedFaceTermSum_smul_eq_zero_of_scalar_tsupport_subset_univ_pi_Ioo
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (hχtsupp : tsupport χ ⊆
                                            Set.univ.pi (fun i => Set.Ioo (a i) (b i))) :
                                          ∑ i : Fin (n + 1),
                                              ((∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                                                  (χ (i.insertNth (b i) x) • G (i.insertNth (b i) x)) i) -
                                                ∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                                                  (χ (i.insertNth (a i) x) • G (i.insertNth (a i) x)) i) = 0 :=
                                        signedFaceTermSum_smul_eq_zero_of_scalar_support_subset_univ_pi_Ioo a b χ G
                                          (support_subset_univ_pi_Ioo_of_tsupport_subset_univ_pi_Ioo hχtsupp)

                                      Exact module and namespace context

                                      Scope and omitted-condition boundaries
                                      • No integral of divergence is claimed by this boundary-only lemma.
                                      Sources, dependencies, and reuse

                                      Source and reuse

                                      Samplinglib parents called

                                      Mathlib API called (external library)

                                      No direct Mathlib call recorded; see the Samplinglib parents.

                                      Mathematical sources

                                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                      Samplinglib mathematical lesson

                                      A vanishing signed face sum gives zero box divergence integral

                                      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.integral_coordinateDivergence_toPi_box_eq_zero_of_integrableOn_trace_of_hasFDerivAt_off_countable · theorem · Teaching coverage

                                      Read this first

                                      Mathematical statement

                                      Let a≤b, F:P→P be continuous on K, have supplied derivative field A on O outside a countable s, and have integrable trace τ_A on K. If the signed face sum Φ_a,b(F) is explicitly zero, then the box integral of the wrapped coordinate divergence δF is zero.

                                      \[\int_K\delta F\,dx=\Phi_{a,b}(F)=0.\]
                                      Lean statement · integral_coordinateDivergence_toPi_box_eq_zero_of_integrableOn_trace_of_hasFDerivAt_off_countable

                                      `hfaces` is an equality of the entire finite sum of face integrals. This theorem is the conditional zero-face corollary of the preceding formula.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_integrableOn_trace_of_hasFDerivAt_off_countable
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (F' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (Hc : ContinuousOn F (Set.Icc a b))
                                          (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt F (F' x) x)
                                          (Hi_trace : IntegrableOn (fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                                            (Set.Icc a b) volume)
                                          (hfaces :
                                            ∑ i : Fin (n + 1),
                                              ((∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                                                  F (i.insertNth (b i) x) i) -
                                                ∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                                                  F (i.insertNth (a i) x) i) = 0) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0

                                      Exact module and namespace context

                                      Proof roadmap

                                      1. 1Apply the finite-box divergence formula

                                        The continuity, off-countable differentiability, and trace-integrability premises identify the box divergence integral with the signed boundary sum.

                                      2. 2Use the supplied cancellation

                                        Replace the signed sum by zero using the explicit hfaces assumption. No new boundary argument is performed.

                                      Full assumptions and notation

                                      All objects and hypotheses

                                      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                      • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                      • F:P→P and A:P→(P→L[ℝ]P) is a supplied linear-map field. Write δF(x)=Div(T∘F∘T⁻¹)(Tx) and τ_A(x)=Σ_i(A(x)e_i)_i.
                                      • a≤b coordinatewise (zero-width coordinates are allowed).
                                      • s⊆P is countable; F is continuous on K; for every x∈O∖s, HasFDerivAt F (A x) x.
                                      • τ_A is integrable on K with respect to volume.
                                      • For each i, K_hat_i=∏_{j≠i}[a_j,b_j] is parametrized by Fin n→ℝ; I_i^c inserts c in coordinate i, retaining the other coordinates in their original order. Φ_a,b(F) is the sum of upper-face integrals of F_i minus lower-face integrals of F_i.
                                      • The aggregate equality Φ_a,b(F)=0 is an explicit premise; individual face terms need not vanish.

                                      Notation and interpretation

                                      Notation used below

                                      For each i, K_hat_i=∏_{j≠i}[a_j,b_j] is parametrized by Fin n→ℝ; I_i^c inserts c in coordinate i, retaining the other coordinates in their original order. Φ_a,b(F) is the sum of upper-face integrals of F_i minus lower-face integrals of F_i.

                                      \[\Phi_{a,b}(F):=\sum_{i=0}^{d-1}\left[\int_{K_{\widehat i}}F_i(I_i^{b_i}z)\,dz-\int_{K_{\widehat i}}F_i(I_i^{a_i}z)\,dz\right]\]
                                      Notation used below

                                      For a raw field F:P→P, W_F=T∘F∘T⁻¹ and δF(x) is coordinateDivergence W_F at Tx. For a supplied linear-map field A, τ_A is its coordinate trace.

                                      \[W_F:=T\circ F\circ T^{-1},\qquad\delta F(x):=\operatorname{Div}W_F(Tx),\qquad\tau_A(x):=\sum_i(A(x)e_i)_i.\]

                                      Mathematical proof

                                      1. Apply the finite-box divergence formula

                                      The continuity, off-countable differentiability, and trace-integrability premises identify the box divergence integral with the signed boundary sum.

                                      \[\int_K\delta F\,dx=\Phi_{a,b}(F).\]
                                      Corresponding Lean step

                                      integral_coordinateDivergence_toPi_box_of_integrableOn_trace_of_hasFDerivAt_off_countable a b hle F F' s hs Hc Hd Hi_trace.

                                      2. Use the supplied cancellation

                                      Replace the signed sum by zero using the explicit hfaces assumption. No new boundary argument is performed.

                                      \[\Phi_{a,b}(F)=0\Longrightarrow\int_K\delta F\,dx=0.\]
                                      Corresponding Lean step

                                      rw [..., hfaces].

                                      Lean verification

                                      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                      Lean proof · integral_coordinateDivergence_toPi_box_eq_zero_of_integrableOn_trace_of_hasFDerivAt_off_countable

                                      The source first the continuity, off-countable differentiability, and trace-integrability premises identify the box divergence integral with the signed boundary sum. It finishes as follows: Replace the signed sum by zero using the explicit hfaces assumption. No new boundary argument is performed. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      Download module (.lean)
                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_integrableOn_trace_of_hasFDerivAt_off_countable
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (F' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (Hc : ContinuousOn F (Set.Icc a b))
                                          (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt F (F' x) x)
                                          (Hi_trace : IntegrableOn (fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                                            (Set.Icc a b) volume)
                                          (hfaces :
                                            ∑ i : Fin (n + 1),
                                              ((∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                                                  F (i.insertNth (b i) x) i) -
                                                ∫ x in Set.Icc (a ∘ i.succAbove) (b ∘ i.succAbove),
                                                  F (i.insertNth (a i) x) i) = 0) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0 := by
                                        rw [integral_coordinateDivergence_toPi_box_of_integrableOn_trace_of_hasFDerivAt_off_countable
                                          a b hle F F' s hs Hc Hd Hi_trace, hfaces]

                                      Exact module and namespace context

                                      Scope and omitted-condition boundaries
                                      • Only the finite box K is integrated. No passage to whole space, weighted integration by parts, generator domain, stationary law, or invariance follows from this wrapper alone.
                                      • Derivative values at the boundary and on the countable exceptional set are not prescribed; equality of integrands is used a.e.
                                      Sources, dependencies, and reuse

                                      Source and reuse

                                      Samplinglib parents called

                                      Mathlib API called (external library)

                                      No direct Mathlib call recorded; see the Samplinglib parents.

                                      Mathematical sources

                                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                      Samplinglib mathematical lesson

                                      Zero inserted-face components give zero box divergence integral

                                      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.integral_coordinateDivergence_toPi_box_eq_zero_of_boundary_component_eq_zero · theorem · Teaching coverage

                                      Read this first

                                      Mathematical statement

                                      Let a≤b and let F:P→P be continuous on K, have derivative A(x) at each x∈O∖s for a countable s, and have integrable trace τ_A on K. Assume additionally: For every coordinate i and every z∈Fin n→ℝ, F_i(I_i^{b_i}z)=0 and F_i(I_i^{a_i}z)=0. These quantify over whole hyperplanes, not only the face boxes. Then the integral of δF over K is zero.

                                      \[\int_K\delta F(x)\,dx=0.\]
                                      Lean statement · integral_coordinateDivergence_toPi_box_eq_zero_of_boundary_component_eq_zero

                                      The derivative field F′ is supplied and is required to be correct only on O∖s. The chosen boundary/support premise replaces hfaces, but does not replace any regularity or integrability premise.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_boundary_component_eq_zero
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (F' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (Hc : ContinuousOn F (Set.Icc a b))
                                          (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt F (F' x) x)
                                          (Hi_trace : IntegrableOn (fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                                            (Set.Icc a b) volume)
                                          (hupper : ∀ (i : Fin (n + 1)) (x : Fin n → ℝ),
                                            F (i.insertNth (b i) x) i = 0)
                                          (hlower : ∀ (i : Fin (n + 1)) (x : Fin n → ℝ),
                                            F (i.insertNth (a i) x) i = 0) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0

                                      Exact module and namespace context

                                      Proof roadmap

                                      1. 1Produce the zero signed face sum

                                        Each boundary component function is zero everywhere on its parametrizing hyperplane, so its integral over the corresponding face box is zero. Summing upper-minus-lower zeros gives Φ=0.

                                      2. 2Combine with the conditional zero-face theorem

                                        The original regularity and trace-integrability data satisfy the finite-box divergence theorem. Its zero-face corollary uses the just-proved Φ=0 to give the zero box integral.

                                      Full assumptions and notation

                                      All objects and hypotheses

                                      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                      • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                      • F:P→P and A:P→(P→L[ℝ]P) is a supplied linear-map field. Write δF(x)=Div(T∘F∘T⁻¹)(Tx) and τ_A(x)=Σ_i(A(x)e_i)_i.
                                      • a≤b coordinatewise (zero-width coordinates are allowed).
                                      • s⊆P is countable; F is continuous on K; for every x∈O∖s, HasFDerivAt F (A x) x.
                                      • τ_A is integrable on K with respect to volume.
                                      • For each i, K_hat_i=∏_{j≠i}[a_j,b_j] is parametrized by Fin n→ℝ; I_i^c inserts c in coordinate i, retaining the other coordinates in their original order. Φ_a,b(F) is the sum of upper-face integrals of F_i minus lower-face integrals of F_i.
                                      • For every coordinate i and every z∈Fin n→ℝ, F_i(I_i^{b_i}z)=0 and F_i(I_i^{a_i}z)=0. These quantify over whole hyperplanes, not only the face boxes.

                                      Notation and interpretation

                                      Notation used below

                                      For a raw field F:P→P, W_F=T∘F∘T⁻¹ and δF(x) is coordinateDivergence W_F at Tx. For a supplied linear-map field A, τ_A is its coordinate trace.

                                      \[W_F:=T\circ F\circ T^{-1},\qquad\delta F(x):=\operatorname{Div}W_F(Tx),\qquad\tau_A(x):=\sum_i(A(x)e_i)_i.\]

                                      Mathematical proof

                                      1. Produce the zero signed face sum

                                      Each boundary component function is zero everywhere on its parametrizing hyperplane, so its integral over the corresponding face box is zero. Summing upper-minus-lower zeros gives Φ=0.

                                      \[\forall i,z,\ F_i(I_i^{b_i}z)=F_i(I_i^{a_i}z)=0\Longrightarrow\Phi_{a,b}(F)=0.\]
                                      Corresponding Lean step

                                      signedFaceTermSum_eq_zero_of_boundary_component_eq_zero a b F with the stated boundary/support premises.

                                      2. Combine with the conditional zero-face theorem

                                      The original regularity and trace-integrability data satisfy the finite-box divergence theorem. Its zero-face corollary uses the just-proved Φ=0 to give the zero box integral.

                                      \[\int_K\delta F\,dx=\Phi_{a,b}(F)=0.\]
                                      Corresponding Lean step

                                      integral_coordinateDivergence_toPi_box_eq_zero_of_integrableOn_trace_of_hasFDerivAt_off_countable a b hle F F' s hs Hc Hd Hi_trace (...).

                                      Lean verification

                                      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                      Lean proof · integral_coordinateDivergence_toPi_box_eq_zero_of_boundary_component_eq_zero

                                      The source first each boundary component function is zero everywhere on its parametrizing hyperplane, so its integral over the corresponding face box is zero. Summing upper-minus-lower zeros gives Φ=0. It finishes as follows: The original regularity and trace-integrability data satisfy the finite-box divergence theorem. Its zero-face corollary uses the just-proved Φ=0 to give the zero box integral. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      Download module (.lean)
                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_boundary_component_eq_zero
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (F' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (Hc : ContinuousOn F (Set.Icc a b))
                                          (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt F (F' x) x)
                                          (Hi_trace : IntegrableOn (fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                                            (Set.Icc a b) volume)
                                          (hupper : ∀ (i : Fin (n + 1)) (x : Fin n → ℝ),
                                            F (i.insertNth (b i) x) i = 0)
                                          (hlower : ∀ (i : Fin (n + 1)) (x : Fin n → ℝ),
                                            F (i.insertNth (a i) x) i = 0) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0 := by
                                        exact integral_coordinateDivergence_toPi_box_eq_zero_of_integrableOn_trace_of_hasFDerivAt_off_countable
                                          a b hle F F' s hs Hc Hd Hi_trace
                                          (signedFaceTermSum_eq_zero_of_boundary_component_eq_zero a b F hupper hlower)

                                      Exact module and namespace context

                                      Scope and omitted-condition boundaries
                                      • Only the finite box K is integrated. No passage to whole space, weighted integration by parts, generator domain, stationary law, or invariance follows from this wrapper alone.
                                      • Derivative values at the boundary and on the countable exceptional set are not prescribed; equality of integrands is used a.e.
                                      Sources, dependencies, and reuse

                                      Source and reuse

                                      Samplinglib parents called

                                      Mathlib API called (external library)

                                      No direct Mathlib call recorded; see the Samplinglib parents.

                                      Mathematical sources

                                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                      Samplinglib mathematical lesson

                                      Zero updated-endpoint components give zero box divergence integral

                                      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.integral_coordinateDivergence_toPi_box_eq_zero_of_update_boundary_component_eq_zero · theorem · Teaching coverage

                                      Read this first

                                      Mathematical statement

                                      Let a≤b and let F:P→P be continuous on K, have derivative A(x) at each x∈O∖s for a countable s, and have integrable trace τ_A on K. Assume additionally: For every i and every x∈P, F_i(x[i←b_i])=0 and F_i(x[i←a_i])=0. Then the integral of δF over K is zero.

                                      \[\int_K\delta F(x)\,dx=0.\]
                                      Lean statement · integral_coordinateDivergence_toPi_box_eq_zero_of_update_boundary_component_eq_zero

                                      The derivative field F′ is supplied and is required to be correct only on O∖s. The chosen boundary/support premise replaces hfaces, but does not replace any regularity or integrability premise.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_update_boundary_component_eq_zero
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (F' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (Hc : ContinuousOn F (Set.Icc a b))
                                          (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt F (F' x) x)
                                          (Hi_trace : IntegrableOn (fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                                            (Set.Icc a b) volume)
                                          (hupper : ∀ (i : Fin (n + 1)) (x : Fin (n + 1) → ℝ),
                                            F (Function.update x i (b i)) i = 0)
                                          (hlower : ∀ (i : Fin (n + 1)) (x : Fin (n + 1) → ℝ),
                                            F (Function.update x i (a i)) i = 0) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0

                                      Exact module and namespace context

                                      Proof roadmap

                                      1. 1Produce the zero signed face sum

                                        Inserted endpoint vectors already have the updated coordinate, so the update hypotheses imply all inserted-face normal components vanish. Their face integrals, and hence Φ, vanish.

                                      2. 2Combine with the conditional zero-face theorem

                                        The original regularity and trace-integrability data satisfy the finite-box divergence theorem. Its zero-face corollary uses the just-proved Φ=0 to give the zero box integral.

                                      Full assumptions and notation

                                      All objects and hypotheses

                                      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                      • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                      • F:P→P and A:P→(P→L[ℝ]P) is a supplied linear-map field. Write δF(x)=Div(T∘F∘T⁻¹)(Tx) and τ_A(x)=Σ_i(A(x)e_i)_i.
                                      • a≤b coordinatewise (zero-width coordinates are allowed).
                                      • s⊆P is countable; F is continuous on K; for every x∈O∖s, HasFDerivAt F (A x) x.
                                      • τ_A is integrable on K with respect to volume.
                                      • For each i, K_hat_i=∏_{j≠i}[a_j,b_j] is parametrized by Fin n→ℝ; I_i^c inserts c in coordinate i, retaining the other coordinates in their original order. Φ_a,b(F) is the sum of upper-face integrals of F_i minus lower-face integrals of F_i.
                                      • For every i and every x∈P, F_i(x[i←b_i])=0 and F_i(x[i←a_i])=0.

                                      Notation and interpretation

                                      Notation used below

                                      For a raw field F:P→P, W_F=T∘F∘T⁻¹ and δF(x) is coordinateDivergence W_F at Tx. For a supplied linear-map field A, τ_A is its coordinate trace.

                                      \[W_F:=T\circ F\circ T^{-1},\qquad\delta F(x):=\operatorname{Div}W_F(Tx),\qquad\tau_A(x):=\sum_i(A(x)e_i)_i.\]

                                      Mathematical proof

                                      1. Produce the zero signed face sum

                                      Inserted endpoint vectors already have the updated coordinate, so the update hypotheses imply all inserted-face normal components vanish. Their face integrals, and hence Φ, vanish.

                                      \[\forall i,x,\ F_i(x[i\leftarrow b_i])=F_i(x[i\leftarrow a_i])=0\Longrightarrow\Phi_{a,b}(F)=0.\]
                                      Corresponding Lean step

                                      signedFaceTermSum_eq_zero_of_update_boundary_component_eq_zero a b F with the stated boundary/support premises.

                                      2. Combine with the conditional zero-face theorem

                                      The original regularity and trace-integrability data satisfy the finite-box divergence theorem. Its zero-face corollary uses the just-proved Φ=0 to give the zero box integral.

                                      \[\int_K\delta F\,dx=\Phi_{a,b}(F)=0.\]
                                      Corresponding Lean step

                                      integral_coordinateDivergence_toPi_box_eq_zero_of_integrableOn_trace_of_hasFDerivAt_off_countable a b hle F F' s hs Hc Hd Hi_trace (...).

                                      Lean verification

                                      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                      Lean proof · integral_coordinateDivergence_toPi_box_eq_zero_of_update_boundary_component_eq_zero

                                      The source first inserted endpoint vectors already have the updated coordinate, so the update hypotheses imply all inserted-face normal components vanish. Their face integrals, and hence Φ, vanish. It finishes as follows: The original regularity and trace-integrability data satisfy the finite-box divergence theorem. Its zero-face corollary uses the just-proved Φ=0 to give the zero box integral. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      Download module (.lean)
                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_update_boundary_component_eq_zero
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (F' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (Hc : ContinuousOn F (Set.Icc a b))
                                          (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt F (F' x) x)
                                          (Hi_trace : IntegrableOn (fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                                            (Set.Icc a b) volume)
                                          (hupper : ∀ (i : Fin (n + 1)) (x : Fin (n + 1) → ℝ),
                                            F (Function.update x i (b i)) i = 0)
                                          (hlower : ∀ (i : Fin (n + 1)) (x : Fin (n + 1) → ℝ),
                                            F (Function.update x i (a i)) i = 0) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0 := by
                                        exact integral_coordinateDivergence_toPi_box_eq_zero_of_integrableOn_trace_of_hasFDerivAt_off_countable
                                          a b hle F F' s hs Hc Hd Hi_trace
                                          (signedFaceTermSum_eq_zero_of_update_boundary_component_eq_zero a b F hupper hlower)

                                      Exact module and namespace context

                                      Scope and omitted-condition boundaries
                                      • Only the finite box K is integrated. No passage to whole space, weighted integration by parts, generator domain, stationary law, or invariance follows from this wrapper alone.
                                      • Derivative values at the boundary and on the countable exceptional set are not prescribed; equality of integrands is used a.e.
                                      Sources, dependencies, and reuse

                                      Source and reuse

                                      Samplinglib parents called

                                      Mathlib API called (external library)

                                      No direct Mathlib call recorded; see the Samplinglib parents.

                                      Mathematical sources

                                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                      Samplinglib mathematical lesson

                                      Off-open-box vanishing gives zero box divergence integral

                                      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.integral_coordinateDivergence_toPi_box_eq_zero_of_eq_zero_off_univ_pi_Ioo · theorem · Teaching coverage

                                      Read this first

                                      Mathematical statement

                                      Let a≤b and let F:P→P be continuous on K, have derivative A(x) at each x∈O∖s for a countable s, and have integrable trace τ_A on K. Assume additionally: F(x)=0 for every x∉O. Then the integral of δF over K is zero.

                                      \[\int_K\delta F(x)\,dx=0.\]
                                      Lean statement · integral_coordinateDivergence_toPi_box_eq_zero_of_eq_zero_off_univ_pi_Ioo

                                      The derivative field F′ is supplied and is required to be correct only on O∖s. The chosen boundary/support premise replaces hfaces, but does not replace any regularity or integrability premise.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_eq_zero_off_univ_pi_Ioo
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (F' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (Hc : ContinuousOn F (Set.Icc a b))
                                          (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt F (F' x) x)
                                          (Hi_trace : IntegrableOn (fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                                            (Set.Icc a b) volume)
                                          (hoff : ∀ x ∉ (Set.univ.pi fun i => Set.Ioo (a i) (b i)), F x = 0) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0

                                      Exact module and namespace context

                                      Proof roadmap

                                      1. 1Produce the zero signed face sum

                                        Every vector with one coordinate equal to an endpoint is outside O. Thus the off-box zero premise kills all endpoint normal components and their face integrals.

                                      2. 2Combine with the conditional zero-face theorem

                                        The original regularity and trace-integrability data satisfy the finite-box divergence theorem. Its zero-face corollary uses the just-proved Φ=0 to give the zero box integral.

                                      Full assumptions and notation

                                      All objects and hypotheses

                                      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                      • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                      • F:P→P and A:P→(P→L[ℝ]P) is a supplied linear-map field. Write δF(x)=Div(T∘F∘T⁻¹)(Tx) and τ_A(x)=Σ_i(A(x)e_i)_i.
                                      • a≤b coordinatewise (zero-width coordinates are allowed).
                                      • s⊆P is countable; F is continuous on K; for every x∈O∖s, HasFDerivAt F (A x) x.
                                      • τ_A is integrable on K with respect to volume.
                                      • For each i, K_hat_i=∏_{j≠i}[a_j,b_j] is parametrized by Fin n→ℝ; I_i^c inserts c in coordinate i, retaining the other coordinates in their original order. Φ_a,b(F) is the sum of upper-face integrals of F_i minus lower-face integrals of F_i.
                                      • F(x)=0 for every x∉O.

                                      Notation and interpretation

                                      Notation used below

                                      For a raw field F:P→P, W_F=T∘F∘T⁻¹ and δF(x) is coordinateDivergence W_F at Tx. For a supplied linear-map field A, τ_A is its coordinate trace.

                                      \[W_F:=T\circ F\circ T^{-1},\qquad\delta F(x):=\operatorname{Div}W_F(Tx),\qquad\tau_A(x):=\sum_i(A(x)e_i)_i.\]

                                      Mathematical proof

                                      1. Produce the zero signed face sum

                                      Every vector with one coordinate equal to an endpoint is outside O. Thus the off-box zero premise kills all endpoint normal components and their face integrals.

                                      \[F|_{P\setminus O}=0\Longrightarrow\Phi_{a,b}(F)=0.\]
                                      Corresponding Lean step

                                      signedFaceTermSum_eq_zero_of_eq_zero_off_univ_pi_Ioo a b F with the stated boundary/support premises.

                                      2. Combine with the conditional zero-face theorem

                                      The original regularity and trace-integrability data satisfy the finite-box divergence theorem. Its zero-face corollary uses the just-proved Φ=0 to give the zero box integral.

                                      \[\int_K\delta F\,dx=\Phi_{a,b}(F)=0.\]
                                      Corresponding Lean step

                                      integral_coordinateDivergence_toPi_box_eq_zero_of_integrableOn_trace_of_hasFDerivAt_off_countable a b hle F F' s hs Hc Hd Hi_trace (...).

                                      Lean verification

                                      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                      Lean proof · integral_coordinateDivergence_toPi_box_eq_zero_of_eq_zero_off_univ_pi_Ioo

                                      The source first every vector with one coordinate equal to an endpoint is outside O. Thus the off-box zero premise kills all endpoint normal components and their face integrals. It finishes as follows: The original regularity and trace-integrability data satisfy the finite-box divergence theorem. Its zero-face corollary uses the just-proved Φ=0 to give the zero box integral. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      Download module (.lean)
                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_eq_zero_off_univ_pi_Ioo
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (F' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (Hc : ContinuousOn F (Set.Icc a b))
                                          (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt F (F' x) x)
                                          (Hi_trace : IntegrableOn (fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                                            (Set.Icc a b) volume)
                                          (hoff : ∀ x ∉ (Set.univ.pi fun i => Set.Ioo (a i) (b i)), F x = 0) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0 := by
                                        exact integral_coordinateDivergence_toPi_box_eq_zero_of_integrableOn_trace_of_hasFDerivAt_off_countable
                                          a b hle F F' s hs Hc Hd Hi_trace
                                          (signedFaceTermSum_eq_zero_of_eq_zero_off_univ_pi_Ioo a b F hoff)

                                      Exact module and namespace context

                                      Scope and omitted-condition boundaries
                                      • Only the finite box K is integrated. No passage to whole space, weighted integration by parts, generator domain, stationary law, or invariance follows from this wrapper alone.
                                      • Derivative values at the boundary and on the countable exceptional set are not prescribed; equality of integrands is used a.e.
                                      Sources, dependencies, and reuse

                                      Source and reuse

                                      Samplinglib parents called

                                      Mathlib API called (external library)

                                      No direct Mathlib call recorded; see the Samplinglib parents.

                                      Mathematical sources

                                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                      Samplinglib mathematical lesson

                                      Open-box ordinary support gives zero box divergence integral

                                      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.integral_coordinateDivergence_toPi_box_eq_zero_of_support_subset_univ_pi_Ioo · theorem · Teaching coverage

                                      Read this first

                                      Mathematical statement

                                      Let a≤b and let F:P→P be continuous on K, have derivative A(x) at each x∈O∖s for a countable s, and have integrable trace τ_A on K. Assume additionally: Function.support F⊆O. Then the integral of δF over K is zero.

                                      \[\int_K\delta F(x)\,dx=0.\]
                                      Lean statement · integral_coordinateDivergence_toPi_box_eq_zero_of_support_subset_univ_pi_Ioo

                                      The derivative field F′ is supplied and is required to be correct only on O∖s. The chosen boundary/support premise replaces hfaces, but does not replace any regularity or integrability premise.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_support_subset_univ_pi_Ioo
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (F' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (Hc : ContinuousOn F (Set.Icc a b))
                                          (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt F (F' x) x)
                                          (Hi_trace : IntegrableOn (fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                                            (Set.Icc a b) volume)
                                          (hsupp : Function.support F ⊆ (Set.univ.pi fun i => Set.Ioo (a i) (b i))) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0

                                      Exact module and namespace context

                                      Proof roadmap

                                      1. 1Produce the zero signed face sum

                                        Support containment gives F=0 outside O. Endpoint hyperplanes lie outside O, so every upper and lower normal component and its face integral is zero.

                                      2. 2Combine with the conditional zero-face theorem

                                        The original regularity and trace-integrability data satisfy the finite-box divergence theorem. Its zero-face corollary uses the just-proved Φ=0 to give the zero box integral.

                                      Full assumptions and notation

                                      All objects and hypotheses

                                      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                      • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                      • F:P→P and A:P→(P→L[ℝ]P) is a supplied linear-map field. Write δF(x)=Div(T∘F∘T⁻¹)(Tx) and τ_A(x)=Σ_i(A(x)e_i)_i.
                                      • a≤b coordinatewise (zero-width coordinates are allowed).
                                      • s⊆P is countable; F is continuous on K; for every x∈O∖s, HasFDerivAt F (A x) x.
                                      • τ_A is integrable on K with respect to volume.
                                      • For each i, K_hat_i=∏_{j≠i}[a_j,b_j] is parametrized by Fin n→ℝ; I_i^c inserts c in coordinate i, retaining the other coordinates in their original order. Φ_a,b(F) is the sum of upper-face integrals of F_i minus lower-face integrals of F_i.
                                      • Function.support F⊆O.

                                      Notation and interpretation

                                      Notation used below

                                      For a raw field F:P→P, W_F=T∘F∘T⁻¹ and δF(x) is coordinateDivergence W_F at Tx. For a supplied linear-map field A, τ_A is its coordinate trace.

                                      \[W_F:=T\circ F\circ T^{-1},\qquad\delta F(x):=\operatorname{Div}W_F(Tx),\qquad\tau_A(x):=\sum_i(A(x)e_i)_i.\]

                                      Mathematical proof

                                      1. Produce the zero signed face sum

                                      Support containment gives F=0 outside O. Endpoint hyperplanes lie outside O, so every upper and lower normal component and its face integral is zero.

                                      \[\operatorname{supp}F\subseteq O\Longrightarrow\Phi_{a,b}(F)=0.\]
                                      Corresponding Lean step

                                      signedFaceTermSum_eq_zero_of_support_subset_univ_pi_Ioo a b F with the stated boundary/support premises.

                                      2. Combine with the conditional zero-face theorem

                                      The original regularity and trace-integrability data satisfy the finite-box divergence theorem. Its zero-face corollary uses the just-proved Φ=0 to give the zero box integral.

                                      \[\int_K\delta F\,dx=\Phi_{a,b}(F)=0.\]
                                      Corresponding Lean step

                                      integral_coordinateDivergence_toPi_box_eq_zero_of_integrableOn_trace_of_hasFDerivAt_off_countable a b hle F F' s hs Hc Hd Hi_trace (...).

                                      Lean verification

                                      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                      Lean proof · integral_coordinateDivergence_toPi_box_eq_zero_of_support_subset_univ_pi_Ioo

                                      The source first support containment gives F=0 outside O. Endpoint hyperplanes lie outside O, so every upper and lower normal component and its face integral is zero. It finishes as follows: The original regularity and trace-integrability data satisfy the finite-box divergence theorem. Its zero-face corollary uses the just-proved Φ=0 to give the zero box integral. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      Download module (.lean)
                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_support_subset_univ_pi_Ioo
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (F' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (Hc : ContinuousOn F (Set.Icc a b))
                                          (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt F (F' x) x)
                                          (Hi_trace : IntegrableOn (fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                                            (Set.Icc a b) volume)
                                          (hsupp : Function.support F ⊆ (Set.univ.pi fun i => Set.Ioo (a i) (b i))) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0 := by
                                        exact integral_coordinateDivergence_toPi_box_eq_zero_of_integrableOn_trace_of_hasFDerivAt_off_countable
                                          a b hle F F' s hs Hc Hd Hi_trace
                                          (signedFaceTermSum_eq_zero_of_support_subset_univ_pi_Ioo a b F hsupp)

                                      Exact module and namespace context

                                      Scope and omitted-condition boundaries
                                      • Only the finite box K is integrated. No passage to whole space, weighted integration by parts, generator domain, stationary law, or invariance follows from this wrapper alone.
                                      • Derivative values at the boundary and on the countable exceptional set are not prescribed; equality of integrands is used a.e.
                                      Sources, dependencies, and reuse

                                      Source and reuse

                                      Samplinglib parents called

                                      Mathlib API called (external library)

                                      No direct Mathlib call recorded; see the Samplinglib parents.

                                      Mathematical sources

                                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                      Samplinglib mathematical lesson

                                      Scalar off-box vanishing gives zero product divergence integral

                                      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo · theorem · Teaching coverage

                                      Read this first

                                      Mathematical statement

                                      Let a≤b, χ:P→ℝ, G:P→P and H=χG. Suppose H is continuous on K, has supplied derivative A(x) at each x∈O∖s for a countable s, and τ_A is integrable on K. Assume additionally χ(x)=0 for every x∉O. Then ∫_K δH dx=0.

                                      \[\int_K\delta(\chi G)(x)\,dx=0.\]
                                      Lean statement · integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo

                                      The hypotheses are imposed on the product χG directly. No separate continuity or differentiability of χ and G is assumed or derived; A need not be presented in product-rule form.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (F' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (Hc : ContinuousOn (fun x => χ x • G x) (Set.Icc a b))
                                          (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt (fun x => χ x • G x) (F' x) x)
                                          (Hi_trace : IntegrableOn (fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                                            (Set.Icc a b) volume)
                                          (hχ : ∀ x ∉ (Set.univ.pi fun i => Set.Ioo (a i) (b i)), χ x = 0) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 ((χ (WithLp.ofLp y)) • G (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0

                                      Exact module and namespace context

                                      Proof roadmap

                                      1. 1Localize the product field

                                        The scalar premise ensures χ=0 outside O, hence H=χG is zero there. The corresponding support lemma gives supp H⊆O.

                                      2. 2Apply the supported-field zero integral theorem

                                        The already-assumed continuity, supplied derivative, countability and trace integrability for H combine with this support inclusion to give the zero box integral.

                                      Full assumptions and notation

                                      All objects and hypotheses

                                      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                      • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                      • a≤b coordinatewise. χ:P→ℝ and G:P→P are arbitrary factors; H(x)=χ(x)G(x). A:P→(P→L[ℝ]P) is a supplied derivative field for H.
                                      • s⊆P is countable; H is continuous on K, and HasFDerivAt H (A x) x for every x∈O∖s.
                                      • τ_A(x)=Σ_i(A(x)e_i)_i is integrable on K with respect to volume.
                                      • χ(x)=0 for every x∉O.

                                      Notation and interpretation

                                      Notation used below

                                      For a raw field F:P→P, W_F=T∘F∘T⁻¹ and δF(x) is coordinateDivergence W_F at Tx. For a supplied linear-map field A, τ_A is its coordinate trace.

                                      \[W_F:=T\circ F\circ T^{-1},\qquad\delta F(x):=\operatorname{Div}W_F(Tx),\qquad\tau_A(x):=\sum_i(A(x)e_i)_i.\]

                                      Mathematical proof

                                      1. Localize the product field

                                      The scalar premise ensures χ=0 outside O, hence H=χG is zero there. The corresponding support lemma gives supp H⊆O.

                                      \[\operatorname{supp}H=\operatorname{supp}(\chi G)\subseteq O.\]
                                      Corresponding Lean step

                                      support_smul_subset_univ_pi_Ioo_of_eq_zero_off_univ_pi_Ioo a b χ G.

                                      2. Apply the supported-field zero integral theorem

                                      The already-assumed continuity, supplied derivative, countability and trace integrability for H combine with this support inclusion to give the zero box integral.

                                      \[\int_K\delta H\,dx=0.\]
                                      Corresponding Lean step

                                      integral_coordinateDivergence_toPi_box_eq_zero_of_support_subset_univ_pi_Ioo a b hle (fun x => χ x • G x) F' s hs Hc Hd Hi_trace.

                                      Lean verification

                                      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                      Lean proof · integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo

                                      The source first the scalar premise ensures χ=0 outside O, hence H=χG is zero there. The corresponding support lemma gives supp H⊆O. It finishes as follows: The already-assumed continuity, supplied derivative, countability and trace integrability for H combine with this support inclusion to give the zero box integral. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      Download module (.lean)
                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (F' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (Hc : ContinuousOn (fun x => χ x • G x) (Set.Icc a b))
                                          (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt (fun x => χ x • G x) (F' x) x)
                                          (Hi_trace : IntegrableOn (fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                                            (Set.Icc a b) volume)
                                          (hχ : ∀ x ∉ (Set.univ.pi fun i => Set.Ioo (a i) (b i)), χ x = 0) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 ((χ (WithLp.ofLp y)) • G (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0 := by
                                        exact integral_coordinateDivergence_toPi_box_eq_zero_of_support_subset_univ_pi_Ioo
                                          a b hle (fun x => χ x • G x) F' s hs Hc Hd Hi_trace
                                          (support_smul_subset_univ_pi_Ioo_of_eq_zero_off_univ_pi_Ioo a b χ G hχ)

                                      Exact module and namespace context

                                      Scope and omitted-condition boundaries
                                      • Only the finite box K is integrated. No passage to whole space, weighted integration by parts, generator domain, stationary law, or invariance follows from this wrapper alone.
                                      • Derivative values at the boundary and on the countable exceptional set are not prescribed; equality of integrands is used a.e.
                                      Sources, dependencies, and reuse

                                      Source and reuse

                                      Samplinglib parents called

                                      Mathlib API called (external library)

                                      No direct Mathlib call recorded; see the Samplinglib parents.

                                      Mathematical sources

                                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                      Samplinglib mathematical lesson

                                      Scalar ordinary support gives zero product divergence integral

                                      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo · theorem · Teaching coverage

                                      Read this first

                                      Mathematical statement

                                      Let a≤b, χ:P→ℝ, G:P→P and H=χG. Suppose H is continuous on K, has supplied derivative A(x) at each x∈O∖s for a countable s, and τ_A is integrable on K. Assume additionally Function.support χ⊆O. Then ∫_K δH dx=0.

                                      \[\int_K\delta(\chi G)(x)\,dx=0.\]
                                      Lean statement · integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo

                                      The hypotheses are imposed on the product χG directly. No separate continuity or differentiability of χ and G is assumed or derived; A need not be presented in product-rule form.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (F' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (Hc : ContinuousOn (fun x => χ x • G x) (Set.Icc a b))
                                          (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt (fun x => χ x • G x) (F' x) x)
                                          (Hi_trace : IntegrableOn (fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                                            (Set.Icc a b) volume)
                                          (hχsupp : Function.support χ ⊆
                                            (Set.univ.pi fun i => Set.Ioo (a i) (b i))) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 ((χ (WithLp.ofLp y)) • G (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0

                                      Exact module and namespace context

                                      Proof roadmap

                                      1. 1Localize the product field

                                        The scalar premise ensures χ=0 outside O, hence H=χG is zero there. The corresponding support lemma gives supp H⊆O.

                                      2. 2Apply the supported-field zero integral theorem

                                        The already-assumed continuity, supplied derivative, countability and trace integrability for H combine with this support inclusion to give the zero box integral.

                                      Full assumptions and notation

                                      All objects and hypotheses

                                      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                      • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                      • a≤b coordinatewise. χ:P→ℝ and G:P→P are arbitrary factors; H(x)=χ(x)G(x). A:P→(P→L[ℝ]P) is a supplied derivative field for H.
                                      • s⊆P is countable; H is continuous on K, and HasFDerivAt H (A x) x for every x∈O∖s.
                                      • τ_A(x)=Σ_i(A(x)e_i)_i is integrable on K with respect to volume.
                                      • Function.support χ⊆O.

                                      Notation and interpretation

                                      Notation used below

                                      For a raw field F:P→P, W_F=T∘F∘T⁻¹ and δF(x) is coordinateDivergence W_F at Tx. For a supplied linear-map field A, τ_A is its coordinate trace.

                                      \[W_F:=T\circ F\circ T^{-1},\qquad\delta F(x):=\operatorname{Div}W_F(Tx),\qquad\tau_A(x):=\sum_i(A(x)e_i)_i.\]

                                      Mathematical proof

                                      1. Localize the product field

                                      The scalar premise ensures χ=0 outside O, hence H=χG is zero there. The corresponding support lemma gives supp H⊆O.

                                      \[\operatorname{supp}H=\operatorname{supp}(\chi G)\subseteq O.\]
                                      Corresponding Lean step

                                      support_smul_subset_univ_pi_Ioo_of_scalar_support_subset_univ_pi_Ioo a b χ G.

                                      2. Apply the supported-field zero integral theorem

                                      The already-assumed continuity, supplied derivative, countability and trace integrability for H combine with this support inclusion to give the zero box integral.

                                      \[\int_K\delta H\,dx=0.\]
                                      Corresponding Lean step

                                      integral_coordinateDivergence_toPi_box_eq_zero_of_support_subset_univ_pi_Ioo a b hle (fun x => χ x • G x) F' s hs Hc Hd Hi_trace.

                                      Lean verification

                                      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                      Lean proof · integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo

                                      The source first the scalar premise ensures χ=0 outside O, hence H=χG is zero there. The corresponding support lemma gives supp H⊆O. It finishes as follows: The already-assumed continuity, supplied derivative, countability and trace integrability for H combine with this support inclusion to give the zero box integral. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      Download module (.lean)
                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (F' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (Hc : ContinuousOn (fun x => χ x • G x) (Set.Icc a b))
                                          (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt (fun x => χ x • G x) (F' x) x)
                                          (Hi_trace : IntegrableOn (fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                                            (Set.Icc a b) volume)
                                          (hχsupp : Function.support χ ⊆
                                            (Set.univ.pi fun i => Set.Ioo (a i) (b i))) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 ((χ (WithLp.ofLp y)) • G (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0 := by
                                        exact integral_coordinateDivergence_toPi_box_eq_zero_of_support_subset_univ_pi_Ioo
                                          a b hle (fun x => χ x • G x) F' s hs Hc Hd Hi_trace
                                          (support_smul_subset_univ_pi_Ioo_of_scalar_support_subset_univ_pi_Ioo a b χ G hχsupp)

                                      Exact module and namespace context

                                      Scope and omitted-condition boundaries
                                      • Only the finite box K is integrated. No passage to whole space, weighted integration by parts, generator domain, stationary law, or invariance follows from this wrapper alone.
                                      • Derivative values at the boundary and on the countable exceptional set are not prescribed; equality of integrands is used a.e.
                                      Sources, dependencies, and reuse

                                      Source and reuse

                                      Samplinglib parents called

                                      Mathlib API called (external library)

                                      No direct Mathlib call recorded; see the Samplinglib parents.

                                      Mathematical sources

                                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                      Samplinglib mathematical lesson

                                      Scalar closed support gives zero product divergence integral

                                      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_tsupport_subset_univ_pi_Ioo · theorem · Teaching coverage

                                      Read this first

                                      Mathematical statement

                                      Let a≤b, χ:P→ℝ, G:P→P and H=χG. Suppose H is continuous on K, has supplied derivative A(x) at each x∈O∖s for a countable s, and τ_A is integrable on K. Assume additionally tsupport χ⊆O. Then ∫_K δH dx=0.

                                      \[\int_K\delta(\chi G)(x)\,dx=0.\]
                                      Lean statement · integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_tsupport_subset_univ_pi_Ioo

                                      The hypotheses are imposed on the product χG directly. No separate continuity or differentiability of χ and G is assumed or derived; A need not be presented in product-rule form.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_tsupport_subset_univ_pi_Ioo
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (F' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (Hc : ContinuousOn (fun x => χ x • G x) (Set.Icc a b))
                                          (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt (fun x => χ x • G x) (F' x) x)
                                          (Hi_trace : IntegrableOn (fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                                            (Set.Icc a b) volume)
                                          (hχtsupp : tsupport χ ⊆ Set.univ.pi (fun i => Set.Ioo (a i) (b i))) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 ((χ (WithLp.ofLp y)) • G (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0

                                      Exact module and namespace context

                                      Proof roadmap

                                      1. 1Convert scalar closed support to ordinary support

                                        Ordinary support is contained in its closure, so supp χ⊆O follows from tsupp χ⊆O.

                                      2. 2Apply the existing scalar-support product theorem

                                        Keep all product-level regularity and integrability assumptions unchanged and apply the scalar ordinary-support result.

                                      Full assumptions and notation

                                      All objects and hypotheses

                                      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                      • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                      • a≤b coordinatewise. χ:P→ℝ and G:P→P are arbitrary factors; H(x)=χ(x)G(x). A:P→(P→L[ℝ]P) is a supplied derivative field for H.
                                      • s⊆P is countable; H is continuous on K, and HasFDerivAt H (A x) x for every x∈O∖s.
                                      • τ_A(x)=Σ_i(A(x)e_i)_i is integrable on K with respect to volume.
                                      • tsupport χ⊆O.

                                      Notation and interpretation

                                      Notation used below

                                      For a raw field F:P→P, W_F=T∘F∘T⁻¹ and δF(x) is coordinateDivergence W_F at Tx. For a supplied linear-map field A, τ_A is its coordinate trace.

                                      \[W_F:=T\circ F\circ T^{-1},\qquad\delta F(x):=\operatorname{Div}W_F(Tx),\qquad\tau_A(x):=\sum_i(A(x)e_i)_i.\]

                                      Mathematical proof

                                      1. Convert scalar closed support to ordinary support

                                      Ordinary support is contained in its closure, so supp χ⊆O follows from tsupp χ⊆O.

                                      \[\operatorname{supp}\chi\subseteq\operatorname{tsupp}\chi\subseteq O.\]
                                      Corresponding Lean step

                                      support_subset_univ_pi_Ioo_of_tsupport_subset_univ_pi_Ioo hχtsupp.

                                      2. Apply the existing scalar-support product theorem

                                      Keep all product-level regularity and integrability assumptions unchanged and apply the scalar ordinary-support result.

                                      \[\int_K\delta(\chi G)\,dx=0.\]
                                      Corresponding Lean step

                                      integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo ....

                                      Lean verification

                                      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                      Lean proof · integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_tsupport_subset_univ_pi_Ioo

                                      The source first ordinary support is contained in its closure, so supp χ⊆O follows from tsupp χ⊆O. It finishes as follows: Keep all product-level regularity and integrability assumptions unchanged and apply the scalar ordinary-support result. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      Download module (.lean)
                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_tsupport_subset_univ_pi_Ioo
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (F' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (Hc : ContinuousOn (fun x => χ x • G x) (Set.Icc a b))
                                          (Hd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt (fun x => χ x • G x) (F' x) x)
                                          (Hi_trace : IntegrableOn (fun x => ∑ i, F' x (Pi.single i (1 : ℝ)) i)
                                            (Set.Icc a b) volume)
                                          (hχtsupp : tsupport χ ⊆ Set.univ.pi (fun i => Set.Ioo (a i) (b i))) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 ((χ (WithLp.ofLp y)) • G (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0 :=
                                        integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo
                                          a b hle χ G F' s hs Hc Hd Hi_trace
                                          (support_subset_univ_pi_Ioo_of_tsupport_subset_univ_pi_Ioo hχtsupp)

                                      Exact module and namespace context

                                      Scope and omitted-condition boundaries
                                      • Only the finite box K is integrated. No passage to whole space, weighted integration by parts, generator domain, stationary law, or invariance follows from this wrapper alone.
                                      • Derivative values at the boundary and on the countable exceptional set are not prescribed; equality of integrands is used a.e.
                                      Sources, dependencies, and reuse

                                      Source and reuse

                                      Samplinglib parents called

                                      Mathlib API called (external library)

                                      No direct Mathlib call recorded; see the Samplinglib parents.

                                      Mathematical sources

                                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                      Samplinglib mathematical lesson

                                      Off-box scalar vanishing with separate product regularity gives zero box integral

                                      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo_of_regularity · theorem · Teaching coverage

                                      Read this first

                                      Mathematical statement

                                      Let a≤b, χ:P→ℝ, G:P→P, and a countable s⊆P. χ and G are continuous on K. At every x∈O∖s, HasFDerivAt χ (ℓ x) x and HasFDerivAt G (B x) x. The scalar trace σ is integrable on K with respect to volume; this is an explicit premise. χ(x)=0 for every x∉O. Then the wrapped coordinate divergence of H=χG integrates to zero over K.

                                      \[M(x)v=\chi(x)B(x)v+\ell(x)[v]G(x),\qquad \sigma(x)=\sum_i\left[\chi(x)(B(x)e_i)_i+\ell(x)[e_i]G_i(x)\right],\qquad\int_K\delta(\chi G)\,dx=0.\]
                                      Lean statement · integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo_of_regularity

                                      This theorem derives product-level continuity and derivative witnesses from the two factors. It does not derive trace integrability; that remains the Hi_trace parameter.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo_of_regularity
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (G' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (hχc : ContinuousOn χ (Set.Icc a b))
                                          (hGc : ContinuousOn G (Set.Icc a b))
                                          (hχd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt χ (χ' x) x)
                                          (hGd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt G (G' x) x)
                                          (Hi_trace : IntegrableOn
                                            (fun x => ∑ i, ((χ x • G' x + (χ' x).smulRight (G x))
                                              (Pi.single i (1 : ℝ))) i)
                                            (Set.Icc a b) volume)
                                          (hχzero : ∀ x ∉ (Set.univ.pi fun i => Set.Ioo (a i) (b i)), χ x = 0) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 ((χ (WithLp.ofLp y)) • G (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0

                                      Exact module and namespace context

                                      Proof roadmap

                                      1. 1Assemble continuity of the product on the closed box

                                        Continuity of scalar multiplication combines the separate continuity hypotheses to make H=χG continuous on K.

                                      2. 2Assemble its derivative on the good open set

                                        At x∈O∖s, the two supplied derivatives give the product derivative M(x)=χ(x)B(x)+ℓ(x).smulRight(G(x)).

                                      3. 3Use the product-level support-to-zero integral theorem

                                        The preceding two steps supply the product's regularity. The existing theorem uses the given scalar support/vanishing condition and the still-assumed σ integrability to cancel the box integral.

                                      Full assumptions and notation

                                      All objects and hypotheses

                                      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                      • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                      • a≤b coordinatewise; s⊆P is countable.
                                      • χ:P→ℝ, G:P→P, ℓ:P→(P→L[ℝ]ℝ), and B:P→(P→L[ℝ]P). Set M(x)=χ(x)B(x)+ℓ(x).smulRight(G(x)); thus M(x)v=χ(x)B(x)v+ℓ(x)[v]G(x). Set σ(x)=Σ_i(M(x)e_i)_i. Let H=χG.
                                      • χ and G are continuous on K. At every x∈O∖s, HasFDerivAt χ (ℓ x) x and HasFDerivAt G (B x) x.
                                      • The scalar trace σ is integrable on K with respect to volume; this is an explicit premise.
                                      • χ(x)=0 for every x∉O.

                                      Notation and interpretation

                                      Notation used below

                                      For a raw field F:P→P, W_F=T∘F∘T⁻¹ and δF(x) is coordinateDivergence W_F at Tx. For a supplied linear-map field A, τ_A is its coordinate trace.

                                      \[W_F:=T\circ F\circ T^{-1},\qquad\delta F(x):=\operatorname{Div}W_F(Tx),\qquad\tau_A(x):=\sum_i(A(x)e_i)_i.\]

                                      Mathematical proof

                                      1. Assemble continuity of the product on the closed box

                                      Continuity of scalar multiplication combines the separate continuity hypotheses to make H=χG continuous on K.

                                      \[\chi,G\in C^0(K)\Longrightarrow H\in C^0(K).\]
                                      Corresponding Lean step

                                      continuousOn_smul_vectorField_of_continuousOn a b χ G hχc hGc.

                                      2. Assemble its derivative on the good open set

                                      At x∈O∖s, the two supplied derivatives give the product derivative M(x)=χ(x)B(x)+ℓ(x).smulRight(G(x)).

                                      \[D H(x)[v]=\chi(x)B(x)[v]+\ell(x)[v]G(x)\qquad(x\in O\setminus s).\]
                                      Corresponding Lean step

                                      hasFDerivAt_smul_vectorField_off_countable a b χ χ' G G' s hχd hGd.

                                      3. Use the product-level support-to-zero integral theorem

                                      The preceding two steps supply the product's regularity. The existing theorem uses the given scalar support/vanishing condition and the still-assumed σ integrability to cancel the box integral.

                                      \[\operatorname{supp}H\subseteq O,\quad\sigma\in L^1(K)\Longrightarrow\int_K\delta H\,dx=0.\]
                                      Corresponding Lean step

                                      integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo a b hle χ G (fun x => χ x • G' x + (χ' x).smulRight (G x)) ...

                                      Lean verification

                                      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                      Lean proof · integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo_of_regularity

                                      The source first continuity of scalar multiplication combines the separate continuity hypotheses to make H=χG continuous on K. It finishes as follows: The preceding two steps supply the product's regularity. The existing theorem uses the given scalar support/vanishing condition and the still-assumed σ integrability to cancel the box integral. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      Download module (.lean)
                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo_of_regularity
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (G' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (hχc : ContinuousOn χ (Set.Icc a b))
                                          (hGc : ContinuousOn G (Set.Icc a b))
                                          (hχd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt χ (χ' x) x)
                                          (hGd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt G (G' x) x)
                                          (Hi_trace : IntegrableOn
                                            (fun x => ∑ i, ((χ x • G' x + (χ' x).smulRight (G x))
                                              (Pi.single i (1 : ℝ))) i)
                                            (Set.Icc a b) volume)
                                          (hχzero : ∀ x ∉ (Set.univ.pi fun i => Set.Ioo (a i) (b i)), χ x = 0) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 ((χ (WithLp.ofLp y)) • G (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0 := by
                                        exact integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo
                                          a b hle χ G (fun x => χ x • G' x + (χ' x).smulRight (G x)) s hs
                                          (continuousOn_smul_vectorField_of_continuousOn a b χ G hχc hGc)
                                          (hasFDerivAt_smul_vectorField_off_countable a b χ χ' G G' s hχd hGd)
                                          Hi_trace hχzero

                                      Exact module and namespace context

                                      Scope and omitted-condition boundaries
                                      • Finite-box zero integral only; no whole-space passage or invariant-law conclusion.
                                      • The support/vanishing assumption is imposed on χ; no value-one plateau or range [0,1] assumption is needed in this theorem.
                                      Sources, dependencies, and reuse

                                      Source and reuse

                                      Samplinglib parents called

                                      Mathlib API called (external library)

                                      No direct Mathlib call recorded; see the Samplinglib parents.

                                      Mathematical sources

                                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                      Samplinglib mathematical lesson

                                      Off-box scalar vanishing with continuous product trace gives zero box integral

                                      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo_of_trace_continuous · theorem · Teaching coverage

                                      Read this first

                                      Mathematical statement

                                      Let a≤b, χ:P→ℝ, G:P→P, and a countable s⊆P. χ and G are continuous on K. At every x∈O∖s, HasFDerivAt χ (ℓ x) x and HasFDerivAt G (B x) x. The entire scalar trace σ is continuous on K; its integrability is derived, not assumed. χ(x)=0 for every x∉O. Then the wrapped coordinate divergence of H=χG integrates to zero over K.

                                      \[M(x)v=\chi(x)B(x)v+\ell(x)[v]G(x),\qquad \sigma(x)=\sum_i\left[\chi(x)(B(x)e_i)_i+\ell(x)[e_i]G_i(x)\right],\qquad\int_K\delta(\chi G)\,dx=0.\]
                                      Lean statement · integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo_of_trace_continuous

                                      Only continuity of the whole trace is added in place of an explicit integrability input. The theorem still requires separate factor regularity and the stated support/vanishing condition.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo_of_trace_continuous
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (G' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (hχc : ContinuousOn χ (Set.Icc a b))
                                          (hGc : ContinuousOn G (Set.Icc a b))
                                          (hχd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt χ (χ' x) x)
                                          (hGd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt G (G' x) x)
                                          (htrace : ContinuousOn
                                            (fun x => ∑ i, ((χ x • G' x + (χ' x).smulRight (G x))
                                              (Pi.single i (1 : ℝ))) i)
                                            (Set.Icc a b))
                                          (hχzero : ∀ x ∉ (Set.univ.pi fun i => Set.Ioo (a i) (b i)), χ x = 0) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 ((χ (WithLp.ofLp y)) • G (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0

                                      Exact module and namespace context

                                      Proof roadmap

                                      1. 1Use compactness of K to obtain trace integrability

                                        The trace σ is continuous by hypothesis and K is compact, so σ is integrable on K.

                                      2. 2Apply the separate-regularity zero integral theorem

                                        That integrability discharges exactly the missing input of the existing regularity theorem. The separate derivative and continuity premises and the scalar support condition are unchanged.

                                      Full assumptions and notation

                                      All objects and hypotheses

                                      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                      • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                      • a≤b coordinatewise; s⊆P is countable.
                                      • χ:P→ℝ, G:P→P, ℓ:P→(P→L[ℝ]ℝ), and B:P→(P→L[ℝ]P). Set M(x)=χ(x)B(x)+ℓ(x).smulRight(G(x)); thus M(x)v=χ(x)B(x)v+ℓ(x)[v]G(x). Set σ(x)=Σ_i(M(x)e_i)_i. Let H=χG.
                                      • χ and G are continuous on K. At every x∈O∖s, HasFDerivAt χ (ℓ x) x and HasFDerivAt G (B x) x.
                                      • The entire scalar trace σ is continuous on K; its integrability is derived, not assumed.
                                      • χ(x)=0 for every x∉O.

                                      Notation and interpretation

                                      Notation used below

                                      For a raw field F:P→P, W_F=T∘F∘T⁻¹ and δF(x) is coordinateDivergence W_F at Tx. For a supplied linear-map field A, τ_A is its coordinate trace.

                                      \[W_F:=T\circ F\circ T^{-1},\qquad\delta F(x):=\operatorname{Div}W_F(Tx),\qquad\tau_A(x):=\sum_i(A(x)e_i)_i.\]

                                      Mathematical proof

                                      1. Use compactness of K to obtain trace integrability

                                      The trace σ is continuous by hypothesis and K is compact, so σ is integrable on K.

                                      \[\sigma\in C^0(K),\quad K\text{ compact}\Longrightarrow\sigma\in L^1(K).\]
                                      Corresponding Lean step

                                      integrableOn_smul_vectorField_trace_of_continuousOn a b χ χ' G G' htrace.

                                      2. Apply the separate-regularity zero integral theorem

                                      That integrability discharges exactly the missing input of the existing regularity theorem. The separate derivative and continuity premises and the scalar support condition are unchanged.

                                      \[\int_K\delta(\chi G)\,dx=0.\]
                                      Corresponding Lean step

                                      integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo_of_regularity ...

                                      Lean verification

                                      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                      Lean proof · integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo_of_trace_continuous

                                      The source first the trace σ is continuous by hypothesis and K is compact, so σ is integrable on K. It finishes as follows: That integrability discharges exactly the missing input of the existing regularity theorem. The separate derivative and continuity premises and the scalar support condition are unchanged. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      Download module (.lean)
                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo_of_trace_continuous
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (G' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (hχc : ContinuousOn χ (Set.Icc a b))
                                          (hGc : ContinuousOn G (Set.Icc a b))
                                          (hχd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt χ (χ' x) x)
                                          (hGd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt G (G' x) x)
                                          (htrace : ContinuousOn
                                            (fun x => ∑ i, ((χ x • G' x + (χ' x).smulRight (G x))
                                              (Pi.single i (1 : ℝ))) i)
                                            (Set.Icc a b))
                                          (hχzero : ∀ x ∉ (Set.univ.pi fun i => Set.Ioo (a i) (b i)), χ x = 0) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 ((χ (WithLp.ofLp y)) • G (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0 := by
                                        exact integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo_of_regularity
                                          a b hle χ χ' G G' s hs hχc hGc hχd hGd
                                          (integrableOn_smul_vectorField_trace_of_continuousOn a b χ χ' G G' htrace)
                                          hχzero

                                      Exact module and namespace context

                                      Scope and omitted-condition boundaries
                                      • Finite-box zero integral only; no whole-space passage or invariant-law conclusion.
                                      • The support/vanishing assumption is imposed on χ; no value-one plateau or range [0,1] assumption is needed in this theorem.
                                      Sources, dependencies, and reuse

                                      Source and reuse

                                      Samplinglib parents called

                                      Mathlib API called (external library)

                                      No direct Mathlib call recorded; see the Samplinglib parents.

                                      Mathematical sources

                                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                      Samplinglib mathematical lesson

                                      Off-box scalar vanishing with continuous trace components gives zero box integral

                                      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo_of_component_continuous · theorem · Teaching coverage

                                      Read this first

                                      Mathematical statement

                                      Let a≤b, χ:P→ℝ, G:P→P, and a countable s⊆P. χ and G are continuous on K. At every x∈O∖s, HasFDerivAt χ (ℓ x) x and HasFDerivAt G (B x) x. For every i, x↦ℓ(x)[e_i] and x↦(B(x)e_i)_i are continuous on K. Full operator-valued continuity of ℓ or B is not assumed. χ(x)=0 for every x∉O. Then the wrapped coordinate divergence of H=χG integrates to zero over K.

                                      \[M(x)v=\chi(x)B(x)v+\ell(x)[v]G(x),\qquad \sigma(x)=\sum_i\left[\chi(x)(B(x)e_i)_i+\ell(x)[e_i]G_i(x)\right],\qquad\int_K\delta(\chi G)\,dx=0.\]
                                      Lean statement · integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo_of_component_continuous

                                      The component assumptions on χ′ and G′ are only directional/diagonal scalar continuities, not full continuity of those operator fields. Product differentiation is justified separately by hχd and hGd.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo_of_component_continuous
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (G' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (hχc : ContinuousOn χ (Set.Icc a b))
                                          (hGc : ContinuousOn G (Set.Icc a b))
                                          (hχ'c : ∀ i, ContinuousOn
                                            (fun x => χ' x (Pi.single i (1 : ℝ))) (Set.Icc a b))
                                          (hG'c : ∀ i, ContinuousOn
                                            (fun x => (G' x (Pi.single i (1 : ℝ))) i) (Set.Icc a b))
                                          (hχd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt χ (χ' x) x)
                                          (hGd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt G (G' x) x)
                                          (hχzero : ∀ x ∉ (Set.univ.pi fun i => Set.Ioo (a i) (b i)), χ x = 0) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 ((χ (WithLp.ofLp y)) • G (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0

                                      Exact module and namespace context

                                      Proof roadmap

                                      1. 1Extract scalar component continuity of G

                                        Full continuity of G on K gives continuity of each scalar coordinate G_i. Combine this with the given χ, ℓ[e_i], and (B e_i)_i continuities.

                                      2. 2Assemble continuity of the trace expression

                                        Each summand χ(B e_i)_i+ℓ[e_i]G_i is a sum of products of continuous scalar functions. The finite sum σ is therefore continuous on K.

                                      3. 3Use the trace-continuous zero integral theorem

                                        This continuity yields compact-box trace integrability in the preceding theorem; with the unchanged derivative and scalar support assumptions it concludes the zero integral.

                                      Full assumptions and notation

                                      All objects and hypotheses

                                      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                      • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                      • a≤b coordinatewise; s⊆P is countable.
                                      • χ:P→ℝ, G:P→P, ℓ:P→(P→L[ℝ]ℝ), and B:P→(P→L[ℝ]P). Set M(x)=χ(x)B(x)+ℓ(x).smulRight(G(x)); thus M(x)v=χ(x)B(x)v+ℓ(x)[v]G(x). Set σ(x)=Σ_i(M(x)e_i)_i. Let H=χG.
                                      • χ and G are continuous on K. At every x∈O∖s, HasFDerivAt χ (ℓ x) x and HasFDerivAt G (B x) x.
                                      • For every i, x↦ℓ(x)[e_i] and x↦(B(x)e_i)_i are continuous on K. Full operator-valued continuity of ℓ or B is not assumed.
                                      • χ(x)=0 for every x∉O.

                                      Notation and interpretation

                                      Notation used below

                                      For a raw field F:P→P, W_F=T∘F∘T⁻¹ and δF(x) is coordinateDivergence W_F at Tx. For a supplied linear-map field A, τ_A is its coordinate trace.

                                      \[W_F:=T\circ F\circ T^{-1},\qquad\delta F(x):=\operatorname{Div}W_F(Tx),\qquad\tau_A(x):=\sum_i(A(x)e_i)_i.\]

                                      Mathematical proof

                                      1. Extract scalar component continuity of G

                                      Full continuity of G on K gives continuity of each scalar coordinate G_i. Combine this with the given χ, ℓ[e_i], and (B e_i)_i continuities.

                                      \[G\in C^0(K)\Longrightarrow G_i\in C^0(K).\]
                                      Corresponding Lean step

                                      (continuous_apply i).comp_continuousOn hGc.

                                      2. Assemble continuity of the trace expression

                                      Each summand χ(B e_i)_i+ℓ[e_i]G_i is a sum of products of continuous scalar functions. The finite sum σ is therefore continuous on K.

                                      \[\sigma(x)=\sum_i[\chi(x)(B(x)e_i)_i+\ell(x)[e_i]G_i(x)]\in C^0(K).\]
                                      Corresponding Lean step

                                      continuousOn_smul_vectorField_trace_of_component_continuousOn a b χ χ' G G' hχc ... hχ'c hG'c.

                                      3. Use the trace-continuous zero integral theorem

                                      This continuity yields compact-box trace integrability in the preceding theorem; with the unchanged derivative and scalar support assumptions it concludes the zero integral.

                                      \[\int_K\delta(\chi G)\,dx=0.\]
                                      Corresponding Lean step

                                      integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo_of_trace_continuous ...

                                      Lean verification

                                      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                      Lean proof · integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo_of_component_continuous

                                      The source first full continuity of G on K gives continuity of each scalar coordinate G_i. Combine this with the given χ, ℓ[e_i], and (B e_i)_i continuities. It finishes as follows: This continuity yields compact-box trace integrability in the preceding theorem; with the unchanged derivative and scalar support assumptions it concludes the zero integral. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      Download module (.lean)
                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo_of_component_continuous
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (G' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (hχc : ContinuousOn χ (Set.Icc a b))
                                          (hGc : ContinuousOn G (Set.Icc a b))
                                          (hχ'c : ∀ i, ContinuousOn
                                            (fun x => χ' x (Pi.single i (1 : ℝ))) (Set.Icc a b))
                                          (hG'c : ∀ i, ContinuousOn
                                            (fun x => (G' x (Pi.single i (1 : ℝ))) i) (Set.Icc a b))
                                          (hχd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt χ (χ' x) x)
                                          (hGd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt G (G' x) x)
                                          (hχzero : ∀ x ∉ (Set.univ.pi fun i => Set.Ioo (a i) (b i)), χ x = 0) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 ((χ (WithLp.ofLp y)) • G (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0 := by
                                        exact integral_coordinateDivergence_toPi_box_eq_zero_of_cutoff_eq_zero_off_univ_pi_Ioo_of_trace_continuous
                                          a b hle χ χ' G G' s hs hχc hGc hχd hGd
                                          (continuousOn_smul_vectorField_trace_of_component_continuousOn a b χ χ' G G' hχc
                                            (fun i => (continuous_apply i).comp_continuousOn hGc) hχ'c hG'c)
                                          hχzero

                                      Exact module and namespace context

                                      Scope and omitted-condition boundaries
                                      • Finite-box zero integral only; no whole-space passage or invariant-law conclusion.
                                      • The support/vanishing assumption is imposed on χ; no value-one plateau or range [0,1] assumption is needed in this theorem.
                                      Sources, dependencies, and reuse

                                      Source and reuse

                                      Samplinglib parents called

                                      Mathlib API called (external library)

                                      • continuous_apply
                                      • Continuous.comp_continuousOn

                                      Mathematical sources

                                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                      Samplinglib mathematical lesson

                                      Scalar support with separate product regularity gives zero box integral

                                      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_regularity · theorem · Teaching coverage

                                      Read this first

                                      Mathematical statement

                                      Let a≤b, χ:P→ℝ, G:P→P, and a countable s⊆P. χ and G are continuous on K. At every x∈O∖s, HasFDerivAt χ (ℓ x) x and HasFDerivAt G (B x) x. The scalar trace σ is integrable on K with respect to volume; this is an explicit premise. Function.support χ⊆O. Then the wrapped coordinate divergence of H=χG integrates to zero over K.

                                      \[M(x)v=\chi(x)B(x)v+\ell(x)[v]G(x),\qquad \sigma(x)=\sum_i\left[\chi(x)(B(x)e_i)_i+\ell(x)[e_i]G_i(x)\right],\qquad\int_K\delta(\chi G)\,dx=0.\]
                                      Lean statement · integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_regularity

                                      This theorem derives product-level continuity and derivative witnesses from the two factors. It does not derive trace integrability; that remains the Hi_trace parameter.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_regularity
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (G' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (hχc : ContinuousOn χ (Set.Icc a b))
                                          (hGc : ContinuousOn G (Set.Icc a b))
                                          (hχd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt χ (χ' x) x)
                                          (hGd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt G (G' x) x)
                                          (Hi_trace : IntegrableOn
                                            (fun x => ∑ i, ((χ x • G' x + (χ' x).smulRight (G x))
                                              (Pi.single i (1 : ℝ))) i)
                                            (Set.Icc a b) volume)
                                          (hχsupp : Function.support χ ⊆
                                            (Set.univ.pi fun i => Set.Ioo (a i) (b i))) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 ((χ (WithLp.ofLp y)) • G (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0

                                      Exact module and namespace context

                                      Proof roadmap

                                      1. 1Assemble continuity of the product on the closed box

                                        Continuity of scalar multiplication combines the separate continuity hypotheses to make H=χG continuous on K.

                                      2. 2Assemble its derivative on the good open set

                                        At x∈O∖s, the two supplied derivatives give the product derivative M(x)=χ(x)B(x)+ℓ(x).smulRight(G(x)).

                                      3. 3Use the product-level support-to-zero integral theorem

                                        The preceding two steps supply the product's regularity. The existing theorem uses the given scalar support/vanishing condition and the still-assumed σ integrability to cancel the box integral.

                                      Full assumptions and notation

                                      All objects and hypotheses

                                      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                      • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                      • a≤b coordinatewise; s⊆P is countable.
                                      • χ:P→ℝ, G:P→P, ℓ:P→(P→L[ℝ]ℝ), and B:P→(P→L[ℝ]P). Set M(x)=χ(x)B(x)+ℓ(x).smulRight(G(x)); thus M(x)v=χ(x)B(x)v+ℓ(x)[v]G(x). Set σ(x)=Σ_i(M(x)e_i)_i. Let H=χG.
                                      • χ and G are continuous on K. At every x∈O∖s, HasFDerivAt χ (ℓ x) x and HasFDerivAt G (B x) x.
                                      • The scalar trace σ is integrable on K with respect to volume; this is an explicit premise.
                                      • Function.support χ⊆O.

                                      Notation and interpretation

                                      Notation used below

                                      For a raw field F:P→P, W_F=T∘F∘T⁻¹ and δF(x) is coordinateDivergence W_F at Tx. For a supplied linear-map field A, τ_A is its coordinate trace.

                                      \[W_F:=T\circ F\circ T^{-1},\qquad\delta F(x):=\operatorname{Div}W_F(Tx),\qquad\tau_A(x):=\sum_i(A(x)e_i)_i.\]

                                      Mathematical proof

                                      1. Assemble continuity of the product on the closed box

                                      Continuity of scalar multiplication combines the separate continuity hypotheses to make H=χG continuous on K.

                                      \[\chi,G\in C^0(K)\Longrightarrow H\in C^0(K).\]
                                      Corresponding Lean step

                                      continuousOn_smul_vectorField_of_continuousOn a b χ G hχc hGc.

                                      2. Assemble its derivative on the good open set

                                      At x∈O∖s, the two supplied derivatives give the product derivative M(x)=χ(x)B(x)+ℓ(x).smulRight(G(x)).

                                      \[D H(x)[v]=\chi(x)B(x)[v]+\ell(x)[v]G(x)\qquad(x\in O\setminus s).\]
                                      Corresponding Lean step

                                      hasFDerivAt_smul_vectorField_off_countable a b χ χ' G G' s hχd hGd.

                                      3. Use the product-level support-to-zero integral theorem

                                      The preceding two steps supply the product's regularity. The existing theorem uses the given scalar support/vanishing condition and the still-assumed σ integrability to cancel the box integral.

                                      \[\operatorname{supp}H\subseteq O,\quad\sigma\in L^1(K)\Longrightarrow\int_K\delta H\,dx=0.\]
                                      Corresponding Lean step

                                      integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo a b hle χ G (fun x => χ x • G' x + (χ' x).smulRight (G x)) ...

                                      Lean verification

                                      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                      Lean proof · integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_regularity

                                      The source first continuity of scalar multiplication combines the separate continuity hypotheses to make H=χG continuous on K. It finishes as follows: The preceding two steps supply the product's regularity. The existing theorem uses the given scalar support/vanishing condition and the still-assumed σ integrability to cancel the box integral. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      Download module (.lean)
                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_regularity
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (G' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (hχc : ContinuousOn χ (Set.Icc a b))
                                          (hGc : ContinuousOn G (Set.Icc a b))
                                          (hχd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt χ (χ' x) x)
                                          (hGd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt G (G' x) x)
                                          (Hi_trace : IntegrableOn
                                            (fun x => ∑ i, ((χ x • G' x + (χ' x).smulRight (G x))
                                              (Pi.single i (1 : ℝ))) i)
                                            (Set.Icc a b) volume)
                                          (hχsupp : Function.support χ ⊆
                                            (Set.univ.pi fun i => Set.Ioo (a i) (b i))) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 ((χ (WithLp.ofLp y)) • G (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0 := by
                                        exact integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo
                                          a b hle χ G (fun x => χ x • G' x + (χ' x).smulRight (G x)) s hs
                                          (continuousOn_smul_vectorField_of_continuousOn a b χ G hχc hGc)
                                          (hasFDerivAt_smul_vectorField_off_countable a b χ χ' G G' s hχd hGd)
                                          Hi_trace hχsupp

                                      Exact module and namespace context

                                      Scope and omitted-condition boundaries
                                      • Finite-box zero integral only; no whole-space passage or invariant-law conclusion.
                                      • The support/vanishing assumption is imposed on χ; no value-one plateau or range [0,1] assumption is needed in this theorem.
                                      Sources, dependencies, and reuse

                                      Source and reuse

                                      Samplinglib parents called

                                      Mathlib API called (external library)

                                      No direct Mathlib call recorded; see the Samplinglib parents.

                                      Mathematical sources

                                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                      Samplinglib mathematical lesson

                                      Scalar support with the canonical vector-field derivative gives zero box integral

                                      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_fderiv · theorem · Teaching coverage

                                      Read this first

                                      Mathematical statement

                                      Let a≤b, χ:P→ℝ, G:P→P, and a countable s⊆P. χ and G are continuous on K. At every x∈O∖s, HasFDerivAt χ (ℓ x) x and DifferentiableAt ℝ G x. The scalar trace σ is integrable on K with respect to volume; this is an explicit premise. Function.support χ⊆O. Then the wrapped coordinate divergence of H=χG integrates to zero over K.

                                      \[M(x)v=\chi(x)B(x)v+\ell(x)[v]G(x),\qquad \sigma(x)=\sum_i\left[\chi(x)(B(x)e_i)_i+\ell(x)[e_i]G_i(x)\right],\quad B(x)=\operatorname{fderiv}_{\mathbb R}G(x),\qquad\int_K\delta(\chi G)\,dx=0.\]
                                      Lean statement · integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_fderiv

                                      This wrapper removes only the separately supplied vector derivative field G′, replacing it by canonical fderiv under actual differentiability. The scalar derivative field χ′ and trace-integrability premise remain.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_fderiv
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (hχc : ContinuousOn χ (Set.Icc a b))
                                          (hGc : ContinuousOn G (Set.Icc a b))
                                          (hχd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt χ (χ' x) x)
                                          (hGd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            DifferentiableAt ℝ G x)
                                          (Hi_trace : IntegrableOn
                                            (fun x => ∑ i, ((χ x • fderiv ℝ G x + (χ' x).smulRight (G x))
                                              (Pi.single i (1 : ℝ))) i)
                                            (Set.Icc a b) volume)
                                          (hχsupp : Function.support χ ⊆
                                            (Set.univ.pi fun i => Set.Ioo (a i) (b i))) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 ((χ (WithLp.ofLp y)) • G (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0

                                      Exact module and namespace context

                                      Proof roadmap

                                      1. 1Turn differentiability of G into a canonical derivative witness

                                        For x∈O∖s, DifferentiableAt ℝ G x certifies that fderiv ℝ G x is the actual Fréchet derivative. No formula for it is assumed away from that set.

                                      2. 2Specialize the separate-regularity scalar-support theorem

                                        Choose B=fderiv G in the existing regularity theorem. The assumed trace integrability already uses this canonical field, so all inputs match.

                                      Full assumptions and notation

                                      All objects and hypotheses

                                      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                      • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                      • a≤b coordinatewise; s⊆P is countable.
                                      • χ:P→ℝ, G:P→P, and ℓ:P→(P→L[ℝ]ℝ) are supplied. B(x) denotes canonical fderiv ℝ G x, not an additional parameter. Let H=χG, M(x)v=χ(x)B(x)v+ℓ(x)[v]G(x), and σ(x)=Σ_i(M(x)e_i)_i.
                                      • χ and G are continuous on K. At every x∈O∖s, HasFDerivAt χ (ℓ x) x and DifferentiableAt ℝ G x.
                                      • The scalar trace σ is integrable on K with respect to volume; this is an explicit premise.
                                      • Function.support χ⊆O.

                                      Notation and interpretation

                                      Notation used below

                                      For a raw field F:P→P, W_F=T∘F∘T⁻¹ and δF(x) is coordinateDivergence W_F at Tx. For a supplied linear-map field A, τ_A is its coordinate trace.

                                      \[W_F:=T\circ F\circ T^{-1},\qquad\delta F(x):=\operatorname{Div}W_F(Tx),\qquad\tau_A(x):=\sum_i(A(x)e_i)_i.\]

                                      Mathematical proof

                                      1. Turn differentiability of G into a canonical derivative witness

                                      For x∈O∖s, DifferentiableAt ℝ G x certifies that fderiv ℝ G x is the actual Fréchet derivative. No formula for it is assumed away from that set.

                                      \[x\in O\setminus s\Longrightarrow DG(x)=\operatorname{fderiv}_{\mathbb R}G(x).\]
                                      Corresponding Lean step

                                      fun x hx => (hGd x hx).hasFDerivAt.

                                      2. Specialize the separate-regularity scalar-support theorem

                                      Choose B=fderiv G in the existing regularity theorem. The assumed trace integrability already uses this canonical field, so all inputs match.

                                      \[M(x)=\chi(x)\operatorname{fderiv}_{\mathbb R}G(x)+\ell(x)\otimes G(x),\qquad\int_K\delta(\chi G)\,dx=0.\]
                                      Corresponding Lean step

                                      integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_regularity ... (fun x => fderiv ℝ G x) ....

                                      Lean verification

                                      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                      Lean proof · integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_fderiv

                                      The source first for x∈O∖s, DifferentiableAt ℝ G x certifies that fderiv ℝ G x is the actual Fréchet derivative. No formula for it is assumed away from that set. It finishes as follows: Choose B=fderiv G in the existing regularity theorem. The assumed trace integrability already uses this canonical field, so all inputs match. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      Download module (.lean)
                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_fderiv
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (hχc : ContinuousOn χ (Set.Icc a b))
                                          (hGc : ContinuousOn G (Set.Icc a b))
                                          (hχd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt χ (χ' x) x)
                                          (hGd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            DifferentiableAt ℝ G x)
                                          (Hi_trace : IntegrableOn
                                            (fun x => ∑ i, ((χ x • fderiv ℝ G x + (χ' x).smulRight (G x))
                                              (Pi.single i (1 : ℝ))) i)
                                            (Set.Icc a b) volume)
                                          (hχsupp : Function.support χ ⊆
                                            (Set.univ.pi fun i => Set.Ioo (a i) (b i))) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 ((χ (WithLp.ofLp y)) • G (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0 := by
                                        exact integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_regularity
                                          a b hle χ χ' G (fun x => fderiv ℝ G x) s hs hχc hGc hχd
                                          (fun x hx => (hGd x hx).hasFDerivAt) Hi_trace hχsupp

                                      Exact module and namespace context

                                      Scope and omitted-condition boundaries
                                      • Finite-box zero integral only; no whole-space passage or invariant-law conclusion.
                                      • The support/vanishing assumption is imposed on χ; no value-one plateau or range [0,1] assumption is needed in this theorem.
                                      Sources, dependencies, and reuse

                                      Source and reuse

                                      Samplinglib parents called

                                      Mathlib API called (external library)

                                      • DifferentiableAt.hasFDerivAt

                                      Mathematical sources

                                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                      Samplinglib mathematical lesson

                                      Scalar support with continuous product trace gives zero box integral

                                      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_trace_continuous · theorem · Teaching coverage

                                      Read this first

                                      Mathematical statement

                                      Let a≤b, χ:P→ℝ, G:P→P, and a countable s⊆P. χ and G are continuous on K. At every x∈O∖s, HasFDerivAt χ (ℓ x) x and HasFDerivAt G (B x) x. The entire scalar trace σ is continuous on K; its integrability is derived, not assumed. Function.support χ⊆O. Then the wrapped coordinate divergence of H=χG integrates to zero over K.

                                      \[M(x)v=\chi(x)B(x)v+\ell(x)[v]G(x),\qquad \sigma(x)=\sum_i\left[\chi(x)(B(x)e_i)_i+\ell(x)[e_i]G_i(x)\right],\qquad\int_K\delta(\chi G)\,dx=0.\]
                                      Lean statement · integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_trace_continuous

                                      Only continuity of the whole trace is added in place of an explicit integrability input. The theorem still requires separate factor regularity and the stated support/vanishing condition.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_trace_continuous
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (G' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (hχc : ContinuousOn χ (Set.Icc a b))
                                          (hGc : ContinuousOn G (Set.Icc a b))
                                          (hχd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt χ (χ' x) x)
                                          (hGd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt G (G' x) x)
                                          (htrace : ContinuousOn
                                            (fun x => ∑ i, ((χ x • G' x + (χ' x).smulRight (G x))
                                              (Pi.single i (1 : ℝ))) i)
                                            (Set.Icc a b))
                                          (hχsupp : Function.support χ ⊆
                                            (Set.univ.pi fun i => Set.Ioo (a i) (b i))) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 ((χ (WithLp.ofLp y)) • G (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0

                                      Exact module and namespace context

                                      Proof roadmap

                                      1. 1Use compactness of K to obtain trace integrability

                                        The trace σ is continuous by hypothesis and K is compact, so σ is integrable on K.

                                      2. 2Apply the separate-regularity zero integral theorem

                                        That integrability discharges exactly the missing input of the existing regularity theorem. The separate derivative and continuity premises and the scalar support condition are unchanged.

                                      Full assumptions and notation

                                      All objects and hypotheses

                                      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                      • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                      • a≤b coordinatewise; s⊆P is countable.
                                      • χ:P→ℝ, G:P→P, ℓ:P→(P→L[ℝ]ℝ), and B:P→(P→L[ℝ]P). Set M(x)=χ(x)B(x)+ℓ(x).smulRight(G(x)); thus M(x)v=χ(x)B(x)v+ℓ(x)[v]G(x). Set σ(x)=Σ_i(M(x)e_i)_i. Let H=χG.
                                      • χ and G are continuous on K. At every x∈O∖s, HasFDerivAt χ (ℓ x) x and HasFDerivAt G (B x) x.
                                      • The entire scalar trace σ is continuous on K; its integrability is derived, not assumed.
                                      • Function.support χ⊆O.

                                      Notation and interpretation

                                      Notation used below

                                      For a raw field F:P→P, W_F=T∘F∘T⁻¹ and δF(x) is coordinateDivergence W_F at Tx. For a supplied linear-map field A, τ_A is its coordinate trace.

                                      \[W_F:=T\circ F\circ T^{-1},\qquad\delta F(x):=\operatorname{Div}W_F(Tx),\qquad\tau_A(x):=\sum_i(A(x)e_i)_i.\]

                                      Mathematical proof

                                      1. Use compactness of K to obtain trace integrability

                                      The trace σ is continuous by hypothesis and K is compact, so σ is integrable on K.

                                      \[\sigma\in C^0(K),\quad K\text{ compact}\Longrightarrow\sigma\in L^1(K).\]
                                      Corresponding Lean step

                                      integrableOn_smul_vectorField_trace_of_continuousOn a b χ χ' G G' htrace.

                                      2. Apply the separate-regularity zero integral theorem

                                      That integrability discharges exactly the missing input of the existing regularity theorem. The separate derivative and continuity premises and the scalar support condition are unchanged.

                                      \[\int_K\delta(\chi G)\,dx=0.\]
                                      Corresponding Lean step

                                      integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_regularity ...

                                      Lean verification

                                      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                      Lean proof · integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_trace_continuous

                                      The source first the trace σ is continuous by hypothesis and K is compact, so σ is integrable on K. It finishes as follows: That integrability discharges exactly the missing input of the existing regularity theorem. The separate derivative and continuity premises and the scalar support condition are unchanged. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      Download module (.lean)
                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_trace_continuous
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (G' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (hχc : ContinuousOn χ (Set.Icc a b))
                                          (hGc : ContinuousOn G (Set.Icc a b))
                                          (hχd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt χ (χ' x) x)
                                          (hGd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt G (G' x) x)
                                          (htrace : ContinuousOn
                                            (fun x => ∑ i, ((χ x • G' x + (χ' x).smulRight (G x))
                                              (Pi.single i (1 : ℝ))) i)
                                            (Set.Icc a b))
                                          (hχsupp : Function.support χ ⊆
                                            (Set.univ.pi fun i => Set.Ioo (a i) (b i))) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 ((χ (WithLp.ofLp y)) • G (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0 := by
                                        exact integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_regularity
                                          a b hle χ χ' G G' s hs hχc hGc hχd hGd
                                          (integrableOn_smul_vectorField_trace_of_continuousOn a b χ χ' G G' htrace)
                                          hχsupp

                                      Exact module and namespace context

                                      Scope and omitted-condition boundaries
                                      • Finite-box zero integral only; no whole-space passage or invariant-law conclusion.
                                      • The support/vanishing assumption is imposed on χ; no value-one plateau or range [0,1] assumption is needed in this theorem.
                                      Sources, dependencies, and reuse

                                      Source and reuse

                                      Samplinglib parents called

                                      Mathlib API called (external library)

                                      No direct Mathlib call recorded; see the Samplinglib parents.

                                      Mathematical sources

                                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                      Samplinglib mathematical lesson

                                      Scalar support with continuous trace components gives zero box integral

                                      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_component_continuous · theorem · Teaching coverage

                                      Read this first

                                      Mathematical statement

                                      Let a≤b, χ:P→ℝ, G:P→P, and a countable s⊆P. χ and G are continuous on K. At every x∈O∖s, HasFDerivAt χ (ℓ x) x and HasFDerivAt G (B x) x. For every i, x↦ℓ(x)[e_i] and x↦(B(x)e_i)_i are continuous on K. Full operator-valued continuity of ℓ or B is not assumed. Function.support χ⊆O. Then the wrapped coordinate divergence of H=χG integrates to zero over K.

                                      \[M(x)v=\chi(x)B(x)v+\ell(x)[v]G(x),\qquad \sigma(x)=\sum_i\left[\chi(x)(B(x)e_i)_i+\ell(x)[e_i]G_i(x)\right],\qquad\int_K\delta(\chi G)\,dx=0.\]
                                      Lean statement · integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_component_continuous

                                      The component assumptions on χ′ and G′ are only directional/diagonal scalar continuities, not full continuity of those operator fields. Product differentiation is justified separately by hχd and hGd.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_component_continuous
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (G' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (hχc : ContinuousOn χ (Set.Icc a b))
                                          (hGc : ContinuousOn G (Set.Icc a b))
                                          (hχ'c : ∀ i, ContinuousOn
                                            (fun x => χ' x (Pi.single i (1 : ℝ))) (Set.Icc a b))
                                          (hG'c : ∀ i, ContinuousOn
                                            (fun x => (G' x (Pi.single i (1 : ℝ))) i) (Set.Icc a b))
                                          (hχd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt χ (χ' x) x)
                                          (hGd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt G (G' x) x)
                                          (hχsupp : Function.support χ ⊆
                                            (Set.univ.pi fun i => Set.Ioo (a i) (b i))) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 ((χ (WithLp.ofLp y)) • G (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0

                                      Exact module and namespace context

                                      Proof roadmap

                                      1. 1Extract scalar component continuity of G

                                        Full continuity of G on K gives continuity of each scalar coordinate G_i. Combine this with the given χ, ℓ[e_i], and (B e_i)_i continuities.

                                      2. 2Assemble continuity of the trace expression

                                        Each summand χ(B e_i)_i+ℓ[e_i]G_i is a sum of products of continuous scalar functions. The finite sum σ is therefore continuous on K.

                                      3. 3Use the trace-continuous zero integral theorem

                                        This continuity yields compact-box trace integrability in the preceding theorem; with the unchanged derivative and scalar support assumptions it concludes the zero integral.

                                      Full assumptions and notation

                                      All objects and hypotheses

                                      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                      • a,b∈P; K=[a,b]={x:∀i,a_i≤x_i≤b_i} is the closed box and O=∏_i(a_i,b_i) is the open box. All unspecified integrals and a.e. assertions use Lebesgue volume on P, restricted to K when indicated.
                                      • a≤b coordinatewise; s⊆P is countable.
                                      • χ:P→ℝ, G:P→P, ℓ:P→(P→L[ℝ]ℝ), and B:P→(P→L[ℝ]P). Set M(x)=χ(x)B(x)+ℓ(x).smulRight(G(x)); thus M(x)v=χ(x)B(x)v+ℓ(x)[v]G(x). Set σ(x)=Σ_i(M(x)e_i)_i. Let H=χG.
                                      • χ and G are continuous on K. At every x∈O∖s, HasFDerivAt χ (ℓ x) x and HasFDerivAt G (B x) x.
                                      • For every i, x↦ℓ(x)[e_i] and x↦(B(x)e_i)_i are continuous on K. Full operator-valued continuity of ℓ or B is not assumed.
                                      • Function.support χ⊆O.

                                      Notation and interpretation

                                      Notation used below

                                      For a raw field F:P→P, W_F=T∘F∘T⁻¹ and δF(x) is coordinateDivergence W_F at Tx. For a supplied linear-map field A, τ_A is its coordinate trace.

                                      \[W_F:=T\circ F\circ T^{-1},\qquad\delta F(x):=\operatorname{Div}W_F(Tx),\qquad\tau_A(x):=\sum_i(A(x)e_i)_i.\]

                                      Mathematical proof

                                      1. Extract scalar component continuity of G

                                      Full continuity of G on K gives continuity of each scalar coordinate G_i. Combine this with the given χ, ℓ[e_i], and (B e_i)_i continuities.

                                      \[G\in C^0(K)\Longrightarrow G_i\in C^0(K).\]
                                      Corresponding Lean step

                                      (continuous_apply i).comp_continuousOn hGc.

                                      2. Assemble continuity of the trace expression

                                      Each summand χ(B e_i)_i+ℓ[e_i]G_i is a sum of products of continuous scalar functions. The finite sum σ is therefore continuous on K.

                                      \[\sigma(x)=\sum_i[\chi(x)(B(x)e_i)_i+\ell(x)[e_i]G_i(x)]\in C^0(K).\]
                                      Corresponding Lean step

                                      continuousOn_smul_vectorField_trace_of_component_continuousOn a b χ χ' G G' hχc ... hχ'c hG'c.

                                      3. Use the trace-continuous zero integral theorem

                                      This continuity yields compact-box trace integrability in the preceding theorem; with the unchanged derivative and scalar support assumptions it concludes the zero integral.

                                      \[\int_K\delta(\chi G)\,dx=0.\]
                                      Corresponding Lean step

                                      integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_trace_continuous ...

                                      Lean verification

                                      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                      Lean proof · integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_component_continuous

                                      The source first full continuity of G on K gives continuity of each scalar coordinate G_i. Combine this with the given χ, ℓ[e_i], and (B e_i)_i continuities. It finishes as follows: This continuity yields compact-box trace integrability in the preceding theorem; with the unchanged derivative and scalar support assumptions it concludes the zero integral. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      Download module (.lean)
                                      theorem integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_component_continuous
                                          {n : ℕ}
                                          (a b : Fin (n + 1) → ℝ) (hle : a ≤ b)
                                          (χ : (Fin (n + 1) → ℝ) → ℝ)
                                          (χ' : (Fin (n + 1) → ℝ) → (Fin (n + 1) → ℝ) →L[ℝ] ℝ)
                                          (G : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (G' : (Fin (n + 1) → ℝ) →
                                            (Fin (n + 1) → ℝ) →L[ℝ] (Fin (n + 1) → ℝ))
                                          (s : Set (Fin (n + 1) → ℝ)) (hs : s.Countable)
                                          (hχc : ContinuousOn χ (Set.Icc a b))
                                          (hGc : ContinuousOn G (Set.Icc a b))
                                          (hχ'c : ∀ i, ContinuousOn
                                            (fun x => χ' x (Pi.single i (1 : ℝ))) (Set.Icc a b))
                                          (hG'c : ∀ i, ContinuousOn
                                            (fun x => (G' x (Pi.single i (1 : ℝ))) i) (Set.Icc a b))
                                          (hχd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt χ (χ' x) x)
                                          (hGd : ∀ x ∈ (Set.univ.pi fun i => Set.Ioo (a i) (b i)) \ s,
                                            HasFDerivAt G (G' x) x)
                                          (hχsupp : Function.support χ ⊆
                                            (Set.univ.pi fun i => Set.Ioo (a i) (b i))) :
                                          ∫ x in Set.Icc a b, coordinateDivergence
                                              (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                (WithLp.toLp 2 ((χ (WithLp.ofLp y)) • G (WithLp.ofLp y)) :
                                                  EuclideanSpace ℝ (Fin (n + 1))))
                                              (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0 := by
                                        exact integral_coordinateDivergence_toPi_box_eq_zero_of_scalar_support_subset_univ_pi_Ioo_of_trace_continuous
                                          a b hle χ χ' G G' s hs hχc hGc hχd hGd
                                          (continuousOn_smul_vectorField_trace_of_component_continuousOn a b χ χ' G G' hχc
                                            (fun i => (continuous_apply i).comp_continuousOn hGc) hχ'c hG'c)
                                          hχsupp

                                      Exact module and namespace context

                                      Scope and omitted-condition boundaries
                                      • Finite-box zero integral only; no whole-space passage or invariant-law conclusion.
                                      • The support/vanishing assumption is imposed on χ; no value-one plateau or range [0,1] assumption is needed in this theorem.
                                      Sources, dependencies, and reuse

                                      Source and reuse

                                      Samplinglib parents called

                                      Mathlib API called (external library)

                                      • continuous_apply
                                      • Continuous.comp_continuousOn

                                      Mathematical sources

                                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.

                                      Samplinglib mathematical lesson

                                      A compactly supported C¹ field has zero whole-space divergence integral

                                      AutoSamplingTheory.TechnicalLemmas.Analysis.Calculus.Divergence.integral_coordinateDivergence_wrapped_eq_zero_of_contDiff_of_hasCompactSupport · theorem · Teaching coverage

                                      Read this first

                                      Mathematical statement

                                      Let n∈ℕ and F:P→P be continuously differentiable on all raw P and have compact topological support. Then the whole-space Lebesgue integral of its PiLp-wrapped Euclidean coordinate divergence δF is zero.

                                      \[F\in C^1(P,P),\quad\operatorname{tsupp}F\text{ compact}\quad\Longrightarrow\quad\int_P\operatorname{Div}(T\circ F\circ T^{-1})(Tx)\,dx=0.\]
                                      Lean statement · integral_coordinateDivergence_wrapped_eq_zero_of_contDiff_of_hasCompactSupport

                                      This is an existing whole-space theorem, unlike the earlier box-only wrappers. It uses exact compact support to remove the box, not a cutoff-exhaustion or tail-limit argument. C¹, rather than C∞, is the exact regularity premise.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      theorem integral_coordinateDivergence_wrapped_eq_zero_of_contDiff_of_hasCompactSupport
                                          {n : ℕ}
                                          (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (hF : ContDiff ℝ 1 F)
                                          (hF_support : HasCompactSupport F) :
                                          ∫ x : Fin (n + 1) → ℝ,
                                              coordinateDivergence
                                                (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                  (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                                                    EuclideanSpace ℝ (Fin (n + 1))))
                                                (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0

                                      Exact module and namespace context

                                      Proof roadmap

                                      1. 1Enclose the closed support in a strict finite box

                                        Compact support is bounded, so choose R>0 with tsupp F⊆B_P(0,R). Let a_i=−R and b_i=R. The coordinate bound |x_i|≤‖x‖∞ shows this raw-norm ball lies inside O=(-R,R)^d, and O⊆K=[−R,R]^d.

                                      2. 2Obtain an integrable trace from global C¹ regularity

                                        C¹ regularity makes DF continuous. Evaluation at each fixed e_i and coordinate projection preserve continuity, and a finite sum makes τ_DF continuous. Thus its restriction to compact K is integrable.

                                      3. 3Apply the supported finite-box zero integral theorem

                                        Global C¹ gives continuity on K and actual derivatives everywhere, so take the exceptional set to be empty. The support enclosure and trace integrability give ∫_K δF=0.

                                      4. 4Show the divergence is zero outside the containing box

                                        If x∉K, the support enclosure implies x∉tsupp F. The field is locally zero there and therefore has zero Fréchet derivative. The pointwise transported trace theorem then gives δF(x)=0.

                                      5. 5Remove the box without taking a limit

                                        The integrand is exactly zero at every point of the complement of K. Its whole-space integral equals its restricted integral, already proved zero.

                                      Full assumptions and notation

                                      All objects and hypotheses

                                      • n∈ℕ, d=n+1≥1, P=(Fin d→ℝ) with its usual supremum norm, V=EuclideanSpace ℝ (Fin d) with its ℓ² norm. T:P→V is WithLp.toLp 2, a continuous linear equivalence, and e=T⁻¹=WithLp.ofLp.
                                      • F:P→P; ContDiff ℝ 1 F globally; HasCompactSupport F, meaning the closure of {x:F(x)≠0} is compact.
                                      • The integral is with respect to Lebesgue volume on raw P. No arbitrary measure, weight, density, or additional field occurs.

                                      Mathematical proof

                                      1. Enclose the closed support in a strict finite box

                                      Compact support is bounded, so choose R>0 with tsupp F⊆B_P(0,R). Let a_i=−R and b_i=R. The coordinate bound |x_i|≤‖x‖∞ shows this raw-norm ball lies inside O=(-R,R)^d, and O⊆K=[−R,R]^d.

                                      \[\operatorname{tsupp}F\subseteq B_P(0,R)\subseteq(-R,R)^d\subseteq[-R,R]^d,\qquad R>0.\]
                                      Corresponding Lean step

                                      hF_support.isCompact.isBounded.subset_ball_lt 0 0; norm_le_pi_norm x i; abs_lt.mp; construct a, b, hab, hball_open, hopen_closed.

                                      2. Obtain an integrable trace from global C¹ regularity

                                      C¹ regularity makes DF continuous. Evaluation at each fixed e_i and coordinate projection preserve continuity, and a finite sum makes τ_DF continuous. Thus its restriction to compact K is integrable.

                                      \[x\mapsto DF(x)\text{ continuous}\Longrightarrow\tau_{DF}\in C^0(P)\Longrightarrow\tau_{DF}\in L^1(K,dx).\]
                                      Corresponding Lean step

                                      hF.continuous_fderiv one_ne_zero; .clm_apply continuous_const; continuous_apply; continuous_finsetSum; .integrableOn_compact isCompact_Icc.

                                      3. Apply the supported finite-box zero integral theorem

                                      Global C¹ gives continuity on K and actual derivatives everywhere, so take the exceptional set to be empty. The support enclosure and trace integrability give ∫_K δF=0.

                                      \[\operatorname{supp}F\subseteq O,\quad s=\varnothing,\qquad\int_K\delta F\,dx=0.\]
                                      Corresponding Lean step

                                      integral_coordinateDivergence_toPi_box_eq_zero_of_support_subset_univ_pi_Ioo a b hab F (fun x => fderiv ℝ F x) ∅ Set.countable_empty; (hF.differentiable one_ne_zero x).hasFDerivAt.

                                      4. Show the divergence is zero outside the containing box

                                      If x∉K, the support enclosure implies x∉tsupp F. The field is locally zero there and therefore has zero Fréchet derivative. The pointwise transported trace theorem then gives δF(x)=0.

                                      \[x\notin K\Longrightarrow x\notin\operatorname{tsupp}F\Longrightarrow DF(x)=0\Longrightarrow\delta F(x)=0.\]
                                      Corresponding Lean step

                                      HasFDerivAt.of_notMem_tsupport ℝ hxtsupport; coordinateDivergence_wrapped_toPi_trace_of_hasFDerivAt; simplify the zero trace.

                                      5. Remove the box without taking a limit

                                      The integrand is exactly zero at every point of the complement of K. Its whole-space integral equals its restricted integral, already proved zero.

                                      \[\int_P\delta F\,dx=\int_K\delta F\,dx=0.\]
                                      Corresponding Lean step

                                      setIntegral_eq_integral_of_forall_compl_eq_zero; conclude with hbox.

                                      Lean verification

                                      The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.

                                      Lean proof · integral_coordinateDivergence_wrapped_eq_zero_of_contDiff_of_hasCompactSupport

                                      The source first compact support is bounded, so choose R>0 with tsupp F⊆B_P(0,R). Let a_i=−R and b_i=R. The coordinate bound |x_i|≤‖x‖∞ shows this raw-norm ball lies inside O=(-R,R)^d, and O⊆K=[−R,R]^d. It finishes as follows: The integrand is exactly zero at every point of the complement of K. Its whole-space integral equals its restricted integral, already proved zero. Intermediate steps below identify the actual helper calls and the conditions each one needs.

                                      Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.

                                      Download module (.lean)
                                      theorem integral_coordinateDivergence_wrapped_eq_zero_of_contDiff_of_hasCompactSupport
                                          {n : ℕ}
                                          (F : (Fin (n + 1) → ℝ) → Fin (n + 1) → ℝ)
                                          (hF : ContDiff ℝ 1 F)
                                          (hF_support : HasCompactSupport F) :
                                          ∫ x : Fin (n + 1) → ℝ,
                                              coordinateDivergence
                                                (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                  (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                                                    EuclideanSpace ℝ (Fin (n + 1))))
                                                (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0 := by
                                        obtain ⟨R, hR, htsupport_ball⟩ :=
                                          hF_support.isCompact.isBounded.subset_ball_lt 0
                                            (0 : Fin (n + 1) → ℝ)
                                        let a : Fin (n + 1) → ℝ := fun _ => -R
                                        let b : Fin (n + 1) → ℝ := fun _ => R
                                        have hab : a ≤ b := by
                                          intro i
                                          dsimp [a, b]
                                          linarith
                                        have hopen_closed :
                                            (Set.univ.pi fun i => Set.Ioo (a i) (b i)) ⊆ Set.Icc a b := by
                                          intro x hx
                                          rw [Set.mem_pi] at hx
                                          exact Set.mem_Icc.2 ⟨fun i => (hx i (Set.mem_univ i)).1.le,
                                            fun i => (hx i (Set.mem_univ i)).2.le⟩
                                        have hball_open : Metric.ball (0 : Fin (n + 1) → ℝ) R ⊆
                                            (Set.univ.pi fun i => Set.Ioo (a i) (b i)) := by
                                          intro x hxball
                                          have hxnorm : ‖x‖ < R := by
                                            simpa [Metric.mem_ball, dist_zero_right] using hxball
                                          rw [Set.mem_pi]
                                          intro i _hi
                                          have hxi : |x i| < R := by
                                            calc
                                              |x i| = ‖x i‖ := (Real.norm_eq_abs _).symm
                                              _ ≤ ‖x‖ := norm_le_pi_norm x i
                                              _ < R := hxnorm
                                          simpa [a, b] using (abs_lt.mp hxi)
                                        have hsupport : Function.support F ⊆
                                            (Set.univ.pi fun i => Set.Ioo (a i) (b i)) := by
                                          intro x hx
                                          exact hball_open (htsupport_ball (subset_tsupport F hx))
                                        have htrace_cont : Continuous
                                            (fun x : Fin (n + 1) → ℝ =>
                                              ∑ i, fderiv ℝ F x (Pi.single i (1 : ℝ)) i) := by
                                          apply continuous_finsetSum
                                          intro i _hi
                                          exact (continuous_apply i).comp
                                            (hF.continuous_fderiv one_ne_zero |>.clm_apply continuous_const)
                                        have hbox :
                                            ∫ x in Set.Icc a b,
                                                coordinateDivergence
                                                  (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                    (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                                                      EuclideanSpace ℝ (Fin (n + 1))))
                                                  (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) = 0 := by
                                          apply integral_coordinateDivergence_toPi_box_eq_zero_of_support_subset_univ_pi_Ioo
                                            a b hab F (fun x => fderiv ℝ F x) ∅ Set.countable_empty
                                          · exact hF.continuous.continuousOn
                                          · intro x _hx
                                            exact (hF.differentiable one_ne_zero x).hasFDerivAt
                                          · exact htrace_cont.continuousOn.integrableOn_compact isCompact_Icc
                                          · exact hsupport
                                        calc
                                          ∫ x : Fin (n + 1) → ℝ,
                                              coordinateDivergence
                                                (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                  (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                                                    EuclideanSpace ℝ (Fin (n + 1))))
                                                (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) =
                                              ∫ x in Set.Icc a b,
                                                coordinateDivergence
                                                  (fun y : EuclideanSpace ℝ (Fin (n + 1)) =>
                                                    (WithLp.toLp 2 (F (WithLp.ofLp y)) :
                                                      EuclideanSpace ℝ (Fin (n + 1))))
                                                  (WithLp.toLp 2 x : EuclideanSpace ℝ (Fin (n + 1))) := by
                                            symm
                                            apply setIntegral_eq_integral_of_forall_compl_eq_zero
                                            intro x hx
                                            have hxtsupport : x ∉ tsupport F := by
                                              intro hxt
                                              exact hx (hopen_closed (hball_open (htsupport_ball hxt)))
                                            have hzero := coordinateDivergence_wrapped_toPi_trace_of_hasFDerivAt
                                              (ι := Fin (n + 1)) (HasFDerivAt.of_notMem_tsupport ℝ hxtsupport)
                                            simpa using hzero
                                          _ = 0 := hbox
                                      
                                      end Divergence
                                      end Calculus
                                      end Analysis
                                      end TechnicalLemmas
                                      end AutoSamplingTheory

                                      Exact module and namespace context

                                      Scope and omitted-condition boundaries
                                      • Whole-space no-boundary integral for one compactly supported C¹ field only; no weighted integration-by-parts identity, Gibbs law, semigroup, generator-domain or invariance assertion.
                                      • The proof uses raw supremum-norm support enclosure and PiLp transport only in the divergence expression; it does not identify the two norms or apply a measure change.
                                      Sources, dependencies, and reuse

                                      Source and reuse

                                      Samplinglib parents called

                                      Mathlib API called (external library)

                                      • Bornology.IsBounded.subset_ball_lt
                                      • norm_le_pi_norm
                                      • ContDiff.continuous_fderiv
                                      • continuous_finsetSum
                                      • ContinuousOn.integrableOn_compact
                                      • HasFDerivAt.of_notMem_tsupport
                                      • MeasureTheory.setIntegral_eq_integral_of_forall_compl_eq_zero

                                      Mathematical sources

                                      Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.