Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-26
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The Cauchy transform of a cycle is holomorphic off its trace, with the expected derivatives

Statement

Let Γ=∑k<rmkγk be a complex chain with trace Γ∗ and let φ be continuous on Γ∗. Put V=C∖Γ∗, which is open, and for every natural n≥1 define the Cauchy transform

Fn(z)=12πi∫Γφ(ζ)(ζ−z)n dζ(z∈V).

Then each Fn is holomorphic on V and

Fn′(z)=n Fn+1(z)(z∈V).

Facts & Assumptions

Given: A complex chain Γ=∑k<rmkγk and a continuous φ on its trace.

[L1]

Let γ:[α,β]→C be a rectifiable contour, let φ be continuous on its trace and let W⊆C be open and disjoint from that trace. For every natural n≥1 the function z↦(2πi)−1∫γφ(ζ)(ζ−z)−n dζ is holomorphic on W and its derivative is n times the corresponding function with exponent n+1 (Cauchy-kernel contour integrals may be differentiated by a direct difference-quotient estimate).

[L2]

∫Γf dz=∑k<r, mk≠0mk∫γkf dz (Integration over a complex chain and the index of a chain).

[L3]

A complex chain is a finite list of pairs (mk,γk) of integers and complex contours, and its trace is the union of the γk∗ with mk≠0 (Complex chains, their traces, and cycles).

[L4]

Finite linear combinations and products of complex-differentiable functions are complex differentiable, as are reciprocals and quotients wherever their denominators do not vanish; constants and the identity are complex differentiable (Linearity, product, reciprocal, and quotient rules for complex derivatives).

[L6]

Negative integer powers are defined exactly for nonzero complex bases (Integer powers in the complex field).

[L8]

A sum over a finite index set in the additive commutative monoid of C is well posed and additive, with empty sum 0; complex-field distributivity permits scaling term by term (A finite sum in a commutative monoid indexed by an arbitrary finite set, C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (a−bi)/(a2+b2)).

[L9]

A complex differentiable function is continuous (Complex differentiability at a point implies continuity there).

Proof

technique · direct
1.1givenL3L5L7

Each γk∗ is the continuous image of a compact interval, hence compact by [L5], so the trace Γ∗ of [L3] is a finite union of compact sets, compact by [L5] and closed by [L5]; therefore V=C∖Γ∗ is open by [L7].

1.2givenL2L4L6L9

For z∈V and ζ∈Γ∗ one has ζ−z≠0, so the powers (ζ−z)−n are defined by [L6]. For fixed z, the map ζ↦(ζ−z)−n is holomorphic on C∖{z} by repeated products and nonvanishing quotients, using [L4], hence continuous by [L9]; multiplying by the continuous function φ makes the integrand of each Fn continuous on Γ∗, so [L2] defines Fn(z).

2.1step 1.1step 1.2L1L3

Fix k<r with mk≠0. Then γk∗⊆Γ∗ by [L3], so the open set V of step 1.1 is disjoint from γk∗, and φ is continuous on γk∗; hence [L1] makes Fn(k)(z)=(2πi)−1∫γkφ(ζ)(ζ−z)−n dζ holomorphic on V with (Fn(k))′=nFn+1(k).

3.1step 2.1L2L4L8∎

By [L2] and [L8], Fn=∑k<r, mk≠0mkFn(k) on V, a finite linear combination with constant coefficients of the functions of step 2.1; so [L4] makes Fn holomorphic on V with Fn′=∑kmk(Fn(k))′=n∑kmkFn+1(k)=nFn+1. The empty chain, and a chain with all coefficients zero, give Fn≡0 and the identity holds trivially.

Depends on

Used by

Dependency tree · two levels

74 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources