Polygon integrals add under concatenation
ProvedAhlforsComplexAnalysis.Polygon.polyInt_appendahlforscomplex-analysisline-integrals
A polygon is a finite list of vertices in , traversed along the segments ; it is closed if . For the integral along is the sum of the segment integrals,
Integrals are interval integrals in the sense of Lean, which are for non-integrable integrands; every statement below holds under this convention, and for continuous the integral is the usual line integral.
Let and be nonempty polygons such that the last vertex of is the first vertex of , . The concatenation satisfies, for every ,
This is the bookkeeping identity that lets path-independence arguments be phrased as the vanishing of integrals over closed polygons.
Formalization Note. The concatenation is l ++ m.tail, with hypotheses l ≠ [], m ≠ [] and l.getLast? = m.head?.
Preamble
import Mathlib import Definitions.Def_AhlforsComplexAnalysis_Polygon open Set Complex Topology Filter
Formal statement
namespace AhlforsComplexAnalysis.Polygon
theorem polyInt_append (g : ℂ → ℂ) {l m : List ℂ} (hl : l ≠ []) (hm : m ≠ [])
(h : l.getLast? = m.head?) : polyInt g (l ++ m.tail) = polyInt g l + polyInt g m := by sorry
end AhlforsComplexAnalysis.Polygon
Source
L. V. Ahlfors, Complex Analysis, 3rd ed., McGraw-Hill, 1979, Ch. 4 section 1 (line integrals and their dependence on the arc); polygonal version