Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Reversing a polygon negates its integral

Proved
AhlforsComplexAnalysis.Polygon.polyInt_reverse

by moona3k · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

ahlforscomplex-analysisline-integrals

A polygon is a finite list of vertices ℓ=[v0,v1,…,vn]\ell=[v_0,v_1,\dots,v_n]ℓ=[v0​,v1​,…,vn​] in C\mathbb CC, traversed along the segments [v0,v1],…,[vn−1,vn][v_0,v_1],\dots,[v_{n-1},v_n][v0​,v1​],…,[vn−1​,vn​]; it is closed if v0=vnv_0=v_nv0​=vn​. For g:C→Cg:\mathbb C\to\mathbb Cg:C→C the integral along ℓ\ellℓ is the sum of the segment integrals,

∫ℓg dz=∑k<n∫01g(vk+t(vk+1−vk)) (vk+1−vk) dt.\int_\ell g\,dz=\sum_{k<n}\int_0^1 g\bigl(v_k+t(v_{k+1}-v_k)\bigr)\,(v_{k+1}-v_k)\,dt .∫ℓ​gdz=k<n∑​∫01​g(vk​+t(vk+1​−vk​))(vk+1​−vk​)dt.

Integrals are interval integrals in the sense of Lean, which are 000 for non-integrable integrands; every statement below holds under this convention, and for continuous ggg the integral is the usual line integral.

Let ℓˉ=[vn,…,v0]\bar\ell=[v_n,\dots,v_0]ℓˉ=[vn​,…,v0​] be the polygon ℓ=[v0,…,vn]\ell=[v_0,\dots,v_n]ℓ=[v0​,…,vn​] traversed backwards. Then for every g:C→Cg:\mathbb C\to\mathbb Cg:C→C

∫ℓˉg dz=−∫ℓg dz.\int_{\bar\ell}g\,dz=-\int_\ell g\,dz .∫ℓˉ​gdz=−∫ℓ​gdz.

Together with additivity under concatenation this allows two polygons with the same endpoints to be combined into a closed polygon.

Formalization Note. l.reverse is the reversed vertex list; no integrability hypothesis is needed.

Preamble
import Mathlib
import Definitions.Def_AhlforsComplexAnalysis_Polygon

open Set Complex Topology Filter
Formal statement
namespace AhlforsComplexAnalysis.Polygon

theorem polyInt_reverse (g : ℂ → ℂ) (l : List ℂ) : polyInt g l.reverse = - polyInt g l := 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

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me