Assembling the generalized residue sum #
The engine of the Hungerbühler–Wasem generalized residue theorem, over an explicit polar
decomposition: along a closed, null-homologous piecewise-C¹ immersion in U whose
crossings of each pole are interior and (at every surviving higher-order coefficient) flat and
sector-compatible, the set-level Cauchy principal value of f exists and equals
2πi · Σ_{s ∈ S} n_s(γ) · Res_s f. The analytic remainder integrates to zero around the
null-homologous cycle (the homology Cauchy theorem through the decomposition), each polar part
contributes its winding-weighted residue, the contributions add across the singular set, and
f is identified with the assembled sum along the curve away from the poles — which is all
the excised principal value sees.
Main results #
Contour.PolarPartDecomposition.hasCauchyPV_residue_sum— the set-level principal value offalong the cycle is2πi · Σ_{s ∈ S} n_s(γ) · Res_s f.
Provenance #
Migrated from residueTheorem_crossing_compositional of Crossing.lean in the AINTLIB
LeanModularForms development (there taking the per-pole principal values as data; here they
are produced by the polar-part theorem). See N. Hungerbühler, M. Wasem, Non-integer valued
winding numbers and a generalized Residue Theorem, arXiv:1808.00997, §3.
The generalized residue sum over a polar decomposition: along a closed,
null-homologous piecewise-C¹ immersion in U whose crossings of each pole are interior and
gated-flat and gated-sector-compatible, the set-level principal value of f is
2πi · Σ_{s ∈ S} n_s(γ) · Res_s f.