Alphabeta Math
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.

✓ 13 results · all verified · 6 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 7 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Mittag-Leffler and Runge's Theorem

1 · Prerequisites

2 · Summary

Runge's theorem is the approximation engine on this page. The compact-set version is built in three stages exactly as planned: a polygonal cycle enclosing the compact set, a Cauchy-integral Riemann-sum approximation with poles on that cycle, and pole pushing inside complementary components until the poles land in the chosen representative set. The connected-complement case then collapses to polynomial approximation.

Mittag-Leffler is the additive analogue. On the plane, Taylor-polynomial subtractions force convergence of the sum of principal parts; on a general plane domain, the same normal-convergence idea is driven by a Runge exhaustion. The page closes with the cotangent partial fractions and the standard divisor and quotient consequences for meromorphic functions on plane domains.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-30Open item page →

The principal part at an isolated singularity

Definition

Let a∈C, let R>0, and let f be holomorphic on the punctured disc 0<∣z−a∣<R. By Laurent expansion on an annulus, the function f has a Laurent expansion about a on that punctured disc. By Laurent series split into regular and principal parts, this expansion splits uniquely into its regular and principal parts.

The principal part of f at a is the negative-power part of that Laurent expansion:

∑m≥1c−m(z−a)−m.

For Mittag-Leffler data, a prescribed principal part at a means a finite sum

pa(z)=∑m=1Mc−m(z−a)−m.

This is exactly the shape of the principal part of a pole whose order is at most M, and its order is exactly M when c−M≠0.

Remarks

The point of the adjective "prescribed" is that one starts with the negative Laurent polynomial and asks for a meromorphic function having it at a. The pole order is then the largest m with c−m≠0.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-30Open item page →

Runge pole sets for rational approximation on a compact set

Definition

Let K⊆C be compact, let U be an open neighbourhood of K, and let f:U→C be holomorphic. A subset P⊆C^∖K is a Runge pole set for K when every connected component of C^∖K meets P.

One says that f is rationally approximable on K with poles in P when for every ε>0 there is a rational function r whose finite poles all lie in P∩C and whose only possible pole at ∞ is also in P, such that

sup⁡z∈K∣f(z)−r(z)∣<ε.

Remarks

If C^∖K is connected, then the singleton P={∞} is a Runge pole set. In that case the approximants are exactly polynomials.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-30Open item page →

Pole pushing along a chain of discs

Definition

Let K⊆C be compact. A pole-pushing chain from a0 to am relative to K is a finite list of closed discs D‾1,…,D‾m such that

  1. D‾j∩K=∅ for every j;
  2. aj−1,aj∈Dj for every j=1,…,m.

Given ε>0, pushing the pole of (z−a0)−1 along that chain to am means finding a rational function r with the following properties:

  1. r is holomorphic on a neighbourhood of K;
  2. r has at most one finite pole, namely at am;
  3. sup⁡z∈K∣r(z)−(z−a0)−1∣<ε.

If the terminal point is declared to be ∞, the third clause is kept and the second is replaced by "the approximant is a polynomial".

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-30Open item page →

A square-grid cycle enclosing a compact set

Statement

Let K⊆U⊆C, where K is compact and U is open. Then there is a complex chain Γ with polygonal trace such that

  1. Γ is a cycle;
  2. Γ∗⊆U∖K;
  3. n(Γ,z)=1 for every z∈K.

Facts & Assumptions

Given: A compact set K contained in an open set U⊆C.

[L1]

A compact subset of an open Euclidean set has a compact Jordan neighbourhood inside that open set, and it may be taken to be a finite union of closed grid rectangles (A compact subset of an open Euclidean set has a compact Jordan neighborhood inside that open set).

[L2]

The winding number of a closed contour is its continuous-argument increment divided by 2π (The winding number is the increment of a continuous argument divided by 2π).

[L3]

Chain integrals and indices are additive, and reversing an oriented edge negates its contribution (Chain integration and the index are additive in the chain, and reverse with it).

[L4]

The index of a cycle is locally constant off its trace (The index of a cycle is locally constant off its trace and vanishes far from it).

Proof

technique · constructive
1.1givenL1L3construct

By [L1], choose a compact Jordan set J such that K⊆int⁡J⊆J⊆U, and write J as a finite union of closed cells from one square grid. Give every cell boundary its positive orientation. Each edge internal to J then occurs twice with opposite orientations; cancel those pairs and let Γ be the finite chain of the remaining oriented frontier edges. At every grid vertex the incoming and outgoing coefficients balance, so Γ is a cycle. Its trace is the frontier of J, hence Γ∗⊆U∖K.

2.1step 1.1L2L3algebra

Let p∈int⁡J lie on no grid line. Summing the positively oriented boundaries of all cells gives the same integral and index as Γ, because the two orientations of every internal edge cancel by [L3]. For one grid cell Q, the four-edge continuous argument of ζ−p makes one positive turn when p∈int⁡Q and returns with zero net turn when p∉Q; hence [L2] gives n(∂+Q,p)=1 in the first case and 0 in the second. Exactly one cell containing p contributes 1, so additivity in [L3] gives n(Γ,p)=1.

3.1step 1.1step 2.1L4choosedischarge-construct∎

Fix z∈K. Choose a disc D(z,r)⊆int⁡J and a point p∈D(z,r) on no grid line. The disc misses Γ∗ and is connected, so local constancy in [L4] and step 2.1 give n(Γ,z)=n(Γ,p)=1.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-30Open item page →

Riemann sums of the Cauchy integral give rational approximation

Statement

Let K⊆U⊆C, where K is compact and U is open, and let f:U→C be holomorphic. Then for every ε>0 there is a rational function r whose poles lie on a finite set contained in U∖K and such that

sup⁡z∈K∣f(z)−r(z)∣<ε.

Facts & Assumptions

Given: A compact set K, an open neighbourhood U of K, a holomorphic function f:U→C, and a tolerance ε>0.

[L1]

There is a polygonal cycle Γ with Γ∗⊆U∖K and n(Γ,z)=1 for every z∈K (A square-grid cycle enclosing a compact set).

[L2]

A cycle null-homologous in an open set satisfies the global Cauchy formula there (Cauchy's integral formula for a null-homologous cycle, Null-homologous cycles and homologous cycles in an open set).

Proof

technique · direct
1.1L1L2given

Choose Γ as in [L1]. Because n(Γ,z)=1 on K and Γ∗⊆U, the cycle is null-homologous in U and [L2] gives f(z)=12πi∫Γf(ζ)ζ−z dζ(z∈K).

2.1step 1.1L3algebra

Decompose Γ into finitely many oriented line segments γj:[aj,bj]→C. For each j, the function ϕj(t,z)=f(γj(t))γj′(t)/(γj(t)−z) is continuous on the compact set [aj,bj]×K, because Γ∗∩K=∅. By [L3], each ϕj is uniformly continuous there, so a fine enough Riemann sum approximates ∫ajbjϕj(t,z) dt uniformly in z∈K.

3.1step 1.1step 2.1constructalgebra∎

Summing those edgewise Riemann sums gives a rational function of the form r(z)=∑νcν/(ξν−z) with sample points ξν∈Γ∗. Choosing the mesh so that the total edgewise error is below ε and using step 1.1 yields sup⁡z∈K∣f(z)−r(z)∣<ε.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-30Open item page →

Runge's pole-pushing lemma

Statement

Let K⊆C be compact.

  1. If D‾1,…,D‾m is a pole-pushing chain from a0 to am relative to K, then for every ε>0 there is a rational function r with at most one finite pole, at am, such that sup⁡z∈K∣r(z)−(z−a0)−1∣<ε.
  2. If a0,…,am is such a chain and in addition ∣z∣<R<∣am∣ for every z∈K, then for every ε>0 there is a polynomial p with sup⁡z∈K∣p(z)−(z−a0)−1∣<ε.

Facts & Assumptions

Given: A compact set K, a pole-pushing chain as in the statement, and a tolerance ε>0.

[L1]

In a pole-pushing chain, each consecutive pair aj−1,aj lies in a closed disc disjoint from K (Pole pushing along a chain of discs).

Proof

technique · constructive
1.1

Fix one disc step of the chain, say a closed disc D‾(c,ρ) disjoint from K and two points a,b∈D(c,ρ). [given, L1] Define S⊆D(c,ρ) to be the set of points u such that (z−a)−1 can be approximated uniformly on K by rational functions with only pole u. Certainly a∈S.

2.1givenL1algebra

Let u∈S. Choose r>0 so that D‾(u,r)⊆D(c,ρ) and r<dist⁡(K,u)/2. [step 1.1, choose, algebra] If v∈D(u,r) and m≥1, then for z∈K one has ∣u−v∣<∣z−v∣, so 1(z−u)m=1(z−v)m(1−u−vz−v)−m=∑ν=0∞(m+ν−1ν)(u−v)ν(z−v)m+ν, with uniform convergence on K. Therefore every rational function with only pole u can be approximated uniformly on K by one with only pole v. Since u∈S, this shows v∈S, so S is open. The same expansion with u and v exchanged shows that whenever v∈S is sufficiently close to u, then u∈S as well. Hence S is also closed in D(c,ρ). Because the disc is connected and S is nonempty, S=D(c,ρ), so in particular b∈S.

3.1step 2.1chooseconstructcasesalgebra

If m=0, then am=a0, and r(z)=(z−a0)−1 proves clause 1 with zero error. Assume m≥1. Apply step 2.1 successively to the discs of the chain, choosing the j-th local error below ε/m. [step 2.1, choose, construct, cases, algebra] The triangle inequality then produces a rational function with only pole am and total error below ε on K. This proves clause 1.

4.1step 3.1algebradischarge-construct∎

For clause 2, clause 1 gives a rational function r with only pole am and sup⁡K∣r(z)−(z−a0)−1∣<ε/2. [step 3.1, algebra, discharge-construct] Write the principal part of r at am as ∑ℓ=1Ldℓ(z−am)−ℓ. Because ∣z∣<R<∣am∣ on K, each factor (z−am)−ℓ=(−am)−ℓ(1−z/am)−ℓ has a power series in z/am that converges uniformly on K. Truncating those finitely many series gives a polynomial p with sup⁡K∣p−r∣<ε/2. Then sup⁡K∣p(z)−(z−a0)−1∣<ε, proving the polynomial approximation.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-30Open item page →

Runge approximation with a prescribed pole set

Statement

Let K⊆C be compact, let U be an open neighbourhood of K, let f:U→C be holomorphic, and let P⊆C^∖K be a Runge pole set for K. Then for every ε>0 there is a rational function r with poles only in P such that

sup⁡z∈K∣f(z)−r(z)∣<ε.

Facts & Assumptions

Given: A compact set K, a holomorphic function f on a neighbourhood of K, a Runge pole set P, and a tolerance ε>0.

[L1]

The Cauchy integral over a suitable enclosing cycle can be approximated uniformly on K by rational functions with poles on that cycle (Riemann sums of the Cauchy integral give rational approximation).

[L2]

A Runge pole set meets every complementary component of C^∖K (Runge pole sets for rational approximation on a compact set).

[L3]

A simple pole may be pushed through one complementary component to any chosen representative in that component, or to ∞ in the unbounded case (Runge's pole-pushing lemma).

Proof

technique · direct
1.1givenL1construct

By [L1], choose a rational function r0(z)=∑ν=1Ncν/(z−aν) whose poles aν lie in C^∖K and such that sup⁡z∈K∣f(z)−r0(z)∣<ε/2.

2.1step 1.1cases

If N=0, then r0 already has no finite poles, so its poles are contained in P and step 1.1 already proves the theorem. Assume from now on that N≥1.

3.1L2L3step 1.1step 2.1choose

For each pole aν, let Cν be the connected component of C^∖K containing it. By [L2], choose pν∈P∩Cν. Applying [L3] to the function cν/(z−aν) inside Cν, choose a rational function sν with poles only at pν and sup⁡z∈K∣sν(z)−cνz−aν∣<ε2N.

4.1step 1.1step 2.1step 3.1algebra∎

Put r=∑ν=1Nsν. Then every pole of r lies in P, and the triangle inequality together with steps 1.1 and 3.1 gives sup⁡z∈K∣f(z)−r(z)∣≤sup⁡z∈K∣f(z)−r0(z)∣+∑ν=1Nsup⁡z∈K∣sν(z)−cνz−aν∣<ε.

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-30Open item page →

Runge polynomial approximation when the complement is connected

Statement

Let K⊆C be compact and let C^∖K be connected. If f is holomorphic on a neighbourhood of K, then for every ε>0 there is a polynomial p such that

sup⁡z∈K∣f(z)−p(z)∣<ε.

Facts & Assumptions

Given: A compact set K with connected complement and a holomorphic function f on a neighbourhood of K.

[L1]

Runge approximation holds for every pole set meeting each complementary component (Runge approximation with a prescribed pole set).

Proof

technique · direct
1.1givenL1

Since C^∖K is connected, the singleton P={∞} meets its unique complementary component. Applying [L1] with that pole set gives rational approximants whose only possible pole is at ∞.

2.1step 1.1algebra∎

If r=P/Q is such a rational function in lowest terms and Q has positive degree, then a zero of Q would give a finite pole of r. Therefore Q is constant, so r is a polynomial. Hence the approximants from step 1.1 are polynomials.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-30Open item page →

Runge approximation on a plane domain

Definition

Let Ω⊆C be a plane domain, let P⊆C^∖Ω, and let f:Ω→C be holomorphic.

One says that f is Runge-approximable on Ω with poles in P when there is a sequence of rational functions (rn) such that every finite pole of rn lies in P∩C, the only possible pole at infinity also lies in P, and

rn→flocally uniformly on Ω.

If C^∖Ω is connected and P={∞}, this is simply polynomial approximation on Ω.

Remarks

The compact-set theorem supplies the local pieces of this definition. The next theorem upgrades them to a single sequence on the whole domain by choosing an exhaustion.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-30Open item page →

Runge approximation on plane domains

Statement

Let Ω⊆C be a plane domain, let P⊆C^∖Ω meet every connected component of C^∖Ω, and let f:Ω→C be holomorphic. Then f is Runge-approximable on Ω with poles in P.

Facts & Assumptions

Given: A plane domain Ω, a pole set P meeting every component of C^∖Ω, and a holomorphic function f on Ω.

[L1]

Every compact set inside an open Euclidean set has a compact Jordan neighbourhood still inside that open set (A compact subset of an open Euclidean set has a compact Jordan neighborhood inside that open set).

[L2]

Runge approximation on one compact set holds once the pole set meets every component of its complement (Runge approximation with a prescribed pole set).

[L3]

Local-uniform approximation on a plane domain means uniform approximation on each compact set in an exhaustion (Runge approximation on a plane domain).

Proof

technique · direct
1.1givenL1construct

Choose an increasing exhaustion K1⊆K2⊆⋯ of compact subsets of Ω with ⋃nKn=Ω and Kn⊆int⁡Kn+1. By recursively applying [L1] and filling every complementary component of the chosen Jordan neighbourhood that lies entirely in Ω, we may also require that every connected component of C^∖Kn meets P.

2.1L2step 1.1choose

Apply [L2] to each Kn with tolerance 2−n. This gives a rational function rn with poles in P and sup⁡z∈Kn∣f(z)−rn(z)∣<2−n.

3.1step 2.1L3algebra∎

Fix a compact set K⊆Ω. Choose N with K⊆KN. Then for every n≥N one has K⊆Kn, so step 2.1 gives sup⁡z∈K∣f(z)−rn(z)∣≤2−n. Hence rn→f uniformly on K. Since K was arbitrary, [L3] gives local-uniform convergence on Ω.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-30Open item page →

Mittag-Leffler on the complex plane

Statement

Let A={a1,a2,… }⊆C be a discrete set, listed so that ∣an∣→∞, and let pn be a prescribed principal part at an for each n. Then there is a meromorphic function f on C whose principal part at an is pn for every n.

Facts & Assumptions

Given: A discrete set A={an} with ∣an∣→∞ and prescribed principal parts pn.

[L1]

A prescribed principal part is a finite negative Laurent polynomial at the chosen point (The principal part at an isolated singularity).

[L2]

On a compact set with connected complement, every holomorphic function on a neighbourhood is uniformly approximable by polynomials (Runge polynomial approximation when the complement is connected).

Proof

technique · constructive
1.1givenL1choose

Choose radii Rn↑∞ so that A∩∂D(0,Rn)=∅ and A∩D‾(0,Rn) is finite for every n. [given, L1, choose] Put S1:=A∩D‾(0,R1),Sn:=A∩(D‾(0,Rn)∖D‾(0,Rn−1))(n≥2). Then each Sn is finite and A=⨆n≥1Sn. For n≥2, the finite sum fn(z):=∑ak∈Snpk(z) is holomorphic on a neighbourhood of D‾(0,Rn−1), because every pole it carries lies outside that disc. Set likewise f1(z):=∑ak∈S1pk(z).

2.1L2step 1.1construct

By [L2], for each n≥2 choose a polynomial qn such that [L2, step 1.1, construct] sup⁡∣z∣≤Rn−1∣fn(z)−qn(z)∣<2−n. Put g1:=f1 and gn:=fn−qn for n≥2. Then every gn is meromorphic on C, has the same principal parts as the finitely many pk with ak∈Sn, and is holomorphic on D‾(0,Rn−1).

3.1step 2.1choosealgebradischarge-construct∎

Fix a compact set K⊆C∖A. Choose ℓ with [step 2.1, choose, algebra, discharge-construct] K⊆D‾(0,Rℓ). For every n≥ℓ+1, one has K⊆D‾(0,Rn−1), so step 2.1 gives sup⁡K∣gn∣≤2−n. Hence ∑n≥1gn converges uniformly on K. Near any point ak∈Sℓ, all terms except gℓ are holomorphic, so the sum f:=∑n≥1gn is meromorphic on C and has principal part pk at ak.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-30Open item page →

Mittag-Leffler on plane domains

Statement

Let Ω⊆C be a plane domain, let A⊆Ω be a discrete set, and for each a∈A let pa be a prescribed principal part at a. Then there is a meromorphic function on Ω whose principal part at each a∈A is pa.

Facts & Assumptions

Given: A plane domain Ω, a discrete set A⊆Ω, and a prescribed principal part pa at each a∈A.

[L1]

Every compact subset of an open Euclidean set has a compact Jordan neighbourhood still inside that open set (A compact subset of an open Euclidean set has a compact Jordan neighborhood inside that open set).

[L2]

If a compact set has a pole set meeting every complementary component, then every function holomorphic on a neighbourhood of that compact set is uniformly approximable there by rational functions with poles in the chosen set (Runge approximation with a prescribed pole set).

[L3]

A prescribed principal part is a finite negative Laurent polynomial (The principal part at an isolated singularity).

Proof

technique · constructive
1.1givenL1L3construct

Choose an increasing compact exhaustion C1⊆C2⊆⋯ of Ω with Cn⊆Cn+1∘ and ⋃nCn=Ω. [given, L1, L3, construct] Recursively apply [L1] to choose compact Jordan neighbourhoods of the Cn and then fill every complementary component lying entirely in Ω. This gives an increasing exhaustion K1⊆K2⊆⋯ of compact subsets of Ω such that every connected component of C^∖Kn meets C^∖Ω. Because A is discrete, each set An:=A∩(Kn∖Kn−1)(K0:=∅) is finite. Let fn(z):=∑a∈Anpa(z). Then fn is meromorphic on Ω and holomorphic on a neighbourhood of Kn−1.

2.1L2step 1.1choose

Fix a set P⊆C^∖Ω meeting every connected component of C^∖Ω. [L2, step 1.1, choose] Step 1.1 makes P meet every connected component of C^∖Kn−1 as well. Put r1:=0 and h1:=f1. For each n≥2, apply [L2] to fn on a neighbourhood of Kn−1 and choose a rational function rn with poles in P such that sup⁡Kn−1∣fn−rn∣<2−n. Then hn:=fn−rn is meromorphic on Ω, has the same principal parts as fn on An, and is uniformly small on Kn−1.

3.1step 2.1algebradischarge-construct∎

For a compact set K⊆Ω∖A, choose N with [step 2.1, algebra, discharge-construct] K⊆KN−1. Then for every n≥N, step 2.1 gives sup⁡K∣hn∣≤2−n. Therefore ∑nhn converges uniformly on K. Only finitely many layers An meet a given compact set, so f:=∑n≥1hn is meromorphic on Ω, and its principal part at each a∈An is exactly pa.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-30Open item page →

The Mittag-Leffler expansion of pi cotangent

Statement

For every z∈C∖Z,

πcot⁡(πz)=1z+∑n≥12zz2−n2=1z+∑n≥1(1z−n+1z+n).

where the series converges locally uniformly on C∖Z.

Facts & Assumptions

Given: The integer pole set and the cotangent function.

[L1]

The complex sine and cosine are defined by the complex exponential, so their standard x+iy formulas are available by direct algebra (Complex sine, cosine, hyperbolic sine, and hyperbolic cosine from the complex exponential).

[L2]

The zeros of sin⁡(πz) are exactly the integers, and sin⁡′(πz)=πcos⁡(πz), so πcot⁡(πz) is meromorphic with simple residue-1 poles at the integers (Tangent, cotangent, secant, and cosecant on their exact natural domains, Complex sine, cosine, hyperbolic sine, and hyperbolic cosine are entire with their standard derivatives, The zeros of complex sine are the integer multiples of pi, and the zeros of complex cosine are the odd half-integer multiples of pi).

[L3]

The residue theorem evaluates contour integrals by enclosed residues. (The residue theorem for a null-homologous cycle)

Proof

technique · direct
1.1L2L3givenalgebra

Fix z∈C∖Z. For N large enough that z,−z∈RN∘, let RN be the positively oriented rectangle with [L2, L3, given, algebra] vertices ±(N+1/2)±i(N+1/2) and set FN(w):=πcot⁡(πw)w2−z2. By [L2], the poles of FN inside RN are the integers n with ∣n∣≤N and the points w=±z. The residue at an integer n is (n2−z2)−1, while the residues at w=z and w=−z sum to πcot⁡(πz)2z+πcot⁡(−πz)−2z=πcot⁡(πz)z. Therefore [L3] gives ∫∂RNFN(w) dw=2πi(πcot⁡(πz)z+∑n=−NN1n2−z2).

2.1L1step 1.1algebra

On the vertical sides of ∂RN, write w=±(N+1/2)+iy. [L1, step 1.1, algebra] sin⁡(πw)=±cosh⁡(πy) and cos⁡(πw)=∓isinh⁡(πy) by [L1], so ∣cot⁡(πw)∣=∣tanh⁡(πy)∣≤1. On the horizontal sides, w=x±i(N+1/2), and [L1] gives ∣sin⁡(πw)∣2=sin⁡2(πx)+sinh⁡2(π(N+1/2)),∣cos⁡(πw)∣2=cos⁡2(πx)+sinh⁡2(π(N+1/2)), so ∣cot⁡(πw)∣≤2. Also ∣w∣≥N+1/2 on ∂RN, hence ∣w2−z2∣≥∣w∣2−∣z∣2≥(N+1/2)2−∣z∣2. Thus ∣FN(w)∣≤Cz/N2 on ∂RN, and since the boundary length is 8N+4, one gets ∫∂RNFN(w) dw→0 as N→∞.

3.1step 1.1step 2.1algebra∎

Letting N→∞ in step 1.1 and using step 2.1 yields [step 1.1, step 2.1, algebra] πcot⁡(πz)z=−∑n∈Z1n2−z2=1z2+∑n≥12z2−n2. Multiplying by z gives πcot⁡(πz)=1z+∑n≥12zz2−n2=1z+∑n≥1(1z−n+1z+n). On every compact subset of C∖Z, the last series is bounded termwise by CK/n2 for all large n, so it converges locally uniformly there. This is exactly the claimed expansion.

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-30Open item page →

The partial-fraction expansion of pi-squared cosecant-squared

Statement

For every z∈C∖Z,

π2csc⁡2(πz)=∑n∈Z1(z−n)2=1z2+∑n≥1(1(z−n)2+1(z+n)2).

with locally uniform convergence on C∖Z.

Facts & Assumptions

Given: The cotangent expansion on C∖Z.

[L1]

On C∖Z, πcot⁡(πz)=1/z+∑n≥12z/(z2−n2) (The Mittag-Leffler expansion of pi cotangent).

[L3]

Locally uniform convergence of holomorphic partial sums forces local-uniform convergence of their derivatives to the derivative of the limit (Locally uniform limits of holomorphic functions are holomorphic and their derivatives converge locally uniformly).

Proof

technique · direct
1.1L1L3given

Let SN(z):=1z+∑n=1N(1z−n+1z+n). By [L1], the holomorphic functions SN converge locally uniformly on C∖Z to πcot⁡(πz). On any compact set K⊆C∖Z, the derivatives satisfy SN′(z)=−1z2−∑n=1N(1(z−n)2+1(z+n)2), and this derivative series converges uniformly on K because its terms are O(n−2) there. Therefore [L3] identifies the derivative of the limit with the displayed series on K.

2.1step 1.1L2algebra∎

Differentiating [L1] gives −π2csc⁡2(πz)=−1z2−∑n≥1(1(z−n)2+1(z+n)2) by [L2]. Multiplying by −1 yields the claimed formula.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Every locally finite effective divisor on a plane domain is a holomorphic zero divisor

Statement

Let Ω⊆C be a plane domain, let A⊆Ω, and assign a nonnegative integer m(a) to each a∈A. Suppose the positive support S:={a∈A:m(a)>0} is locally finite in Ω: every compact subset of Ω meets S in finitely many points. Then there is a holomorphic function F≢0 on Ω with ord⁡a(F)=m(a) for each a∈A and with no zeros in Ω∖S. In particular, m(a)=0 means F(a)≠0.

This is the realization of the effective divisor ∑a∈Sm(a)[a]. Its support has no accumulation point in Ω; isolation of the points of S alone is insufficient. Empty and finite supports are included.

Facts & Assumptions

Given: A plane domain Ω, a set A⊆Ω, and finite nonnegative integer multiplicities whose positive support S satisfies the stated local finiteness condition.

[L1]

The elementary factors are Ep(w)=(1−w)exp⁡(w+w2/2+⋯+wp/p), with E0(w)=1−w (Weierstrass elementary factors). The exponential is entire and satisfies exp⁡(u)exp⁡(−u)=exp⁡(0)=1, so every Ep has exactly one zero, simple, at w=1 (The complex exponential is entire and its complex derivative is itself, exp⁡(z+w)=exp⁡z exp⁡w, and the complex exponential extends the real exponential). Finite products, quotients with nonzero denominator, and compositions of holomorphic functions are holomorphic (Linearity, product, reciprocal, and quotient rules for complex derivatives, The chain rule for complex derivatives).

[L2]

For ∣w∣≤1, ∣1−Ep(w)∣≤∣w∣p+1 (The unit-disc estimate for Weierstrass elementary factors).

[L3]

A holomorphic product whose factors are not identically zero and whose deviations from 1 are summable uniformly on each compact set after deleting finitely many zero-contributing factors has a holomorphic limit with exactly the factor zeros and their multiplicities (Normally convergent products define holomorphic functions with the expected zeros).

[L5]

The order at a point where a holomorphic function is nonzero is 0 (The order of a zero of a holomorphic function).

[L6]

The rationals are countable and dense in the reals, finite products of countable sets are countable, integer pairs have an explicit integer code, and an infinite subset of the nonnegative integers is enumerated by successively taking its least unused member; these statements use no Choice (Q is countably infinite, The rationals embed densely in the reals, A product of two at most countable sets is at most countable, N×N≈N, Every subset of an at most countable set is at most countable).

Proof

technique · constructive
1.1givenL4L6constructcases

Every point of Ω has a closed disc neighbourhood contained in Ω, so local finiteness makes each point of S isolated and prevents any accumulation point of S in Ω. By [L6], enumerate all open discs with rational centre coordinates and positive rational radius in a fixed order. For each a∈S, let k(a) be the least index of such a disc containing a and meeting S only at a; isolation and density of the rationals ensure its existence. Distinct points have distinct indices. Thus S injects into the nonnegative integers. By [L6], encode the pairs (k(a),r) with 1≤r≤m(a) by a fixed pairing of integers, and list the resulting codes in increasing order. This gives the points of S repeated exactly m(a) times, without a choice principle. A compact subset contains only finitely many entries of this list. If the list is finite, F(z)=∏a∈S(z−a)m(a) works, with empty product 1. Henceforth assume it is infinite.

2.1step 1.1L4constructcases

If C:=C∖Ω is empty, put all entries into a list (cj) and leave the list (bj) empty. If C is nonempty, set δ(z):=dist⁡(z,C) and split the repeated list, preserving its order, according to D:={z∈Ω:δ(z)<1/(∣z∣+1)}: (bj) contains the entries in D, and (cj) those outside D. Either sublist may be empty, finite, or infinite. The closedness of C and openness of Ω imply δ(z)>0 on Ω, and [L4] makes δ continuous.

3.1step 1.1step 2.1L4construct

Suppose (bj) is infinite. For each ε>0, an entry bj with δ(bj)≥ε satisfies ∣bj∣<1/ε. Such entries lie in the closed bounded set {z:∣z∣≤1/ε, δ(z)≥ε}, contained in Ω and compact by [L4]. Step 1.1 makes their number finite. Thus δ(bj)→0. To specify a nearest boundary point without simultaneous choices, consider the compact nonempty set C∩B‾(bj,δ(bj)+1). The minimum of ∣bj−p∣ on it is δ(bj): points outside it have distance greater than δ(bj)+1, and the definition of the infimum supplies points inside it with distance arbitrarily close to δ(bj). The nearest-point set is therefore nonempty compact. First minimize Re⁡p on that set, then minimize Im⁡p on the minimizers. This specifies a unique pj∈C with ∣bj−pj∣=δ(bj).

3.2step 1.1step 2.1L4constructcases

Suppose (cj) is infinite. If C=∅, every closed disc is compact in Ω=C, so step 1.1 shows that only finitely many entries have modulus at most any fixed R. If C≠∅, entries with ∣cj∣≤R satisfy δ(cj)≥1/(R+1); they lie in the compact subset {z:∣z∣≤R, δ(z)≥1/(R+1)} of Ω, which again contains only finitely many entries. In either case ∣cj∣→∞. Let m0 be the finite number of zero entries and enumerate the nonzero entries as (dj). Then ∣dj∣→∞.

4.1step 3.1L1L2L3L4constructcases

For infinite (bj) define Qj(z):=Ej((bj−pj)/(z−pj)). Its denominator is nonzero on Ω, so [L1] makes it holomorphic. Its only zero is bj, and that zero is simple because 1−(bj−pj)/(z−pj)=(z−bj)/(z−pj) and the exponential factor never vanishes. For a nonempty compact K⊆Ω, [L4] gives dK:=min⁡z∈Kδ(z)>0. Since pj∈C, sup⁡z∈K∣(bj−pj)/(z−pj)∣≤δ(bj)/dK≤1/2 for all sufficiently large j. These tail factors have no zeros on K, and [L2] gives sup⁡K∣1−Qj∣≤2−j−1. Hence [L3] yields a holomorphic function F1:=∏j≥1Qj with precisely the listed bj zeros and their multiplicities. If (bj) is finite, take its finite polynomial instead, and if it is empty take F1=1.

4.2step 3.2L1L2L3constructcases

On each disc ∣z∣≤R, eventually ∣dj∣>2R, so Ej(z/dj) is zero-free there and [L2] gives sup⁡∣z∣≤R∣1−Ej(z/dj)∣≤2−j−1. By [L1] and [L3], H(z):=∏j≥1Ej(z/dj) is entire with exactly the listed nonzero zeros and their multiplicities; H(0)=1 since every partial product equals 1 there. Thus F2(z):=zm0H(z) contributes the listed cj zeros, with z0=1 contributing no zero at 0. If (cj) is finite, take its finite polynomial instead, and if it is empty take F2=1.

5.1step 1.1step 4.1step 4.2L1L5discharge-construct∎

Set F:=F1F2. It is holomorphic by [L1], and steps 4.1 and 4.2 show that its zero set is exactly S, with order m(a) at each a∈S: at a given point the orders of the finitely many contributing factors add and the remaining local product is nonzero. Every point of Ω has a disc meeting S in finitely many points, and that disc contains a point outside this finite set, so F is not identically zero. It is nonzero at each point of Ω∖S, and [L5] gives order 0 there, including each a∈A with m(a)=0. This proves the stated realization.

CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Every meromorphic function on a plane domain is a quotient of holomorphic functions

Statement

Every meromorphic function on a plane domain is a quotient of holomorphic functions.

Facts & Assumptions

Given: A meromorphic function f on a plane domain Ω.

[L1]

A meromorphic function is holomorphic away from a discrete pole set (Meromorphic functions on a plane domain).

[L2]

Every effective divisor with locally finite positive support on a plane domain is the zero divisor of a nonzero holomorphic function (Every locally finite effective divisor on a plane domain is a holomorphic zero divisor).

[L3]

A locally bounded punctured singularity is removable (Characterizations of removable singularities).

Proof

technique · direct
1.1L1L2givenconstruct

Let P be the pole set of f, with multiplicities equal to its positive finite pole orders. Each x∈Ω∖P has a holomorphy neighbourhood disjoint from P, and each a∈P has an isolated-pole neighbourhood meeting P only at a. Hence every point of Ω has a neighbourhood meeting P in finitely many points. For a compact K⊆Ω, the family of all such open neighbourhoods covers K; a finite subcover shows that K∩P is finite. Thus [L2] applies. Choose a holomorphic function h on Ω whose zero divisor is exactly P.

2.1L1L3step 1.1algebra

On Ω∖P, define g:=fh. Near a pole a∈P, the zero of h has exactly the same order as the pole of f, so g is locally bounded on a punctured neighbourhood of a. By [L3], g extends holomorphically across every point of P.

3.1step 1.1step 2.1algebra∎

Away from P, one has f=g/h. Since both sides are meromorphic and agree on the dense open set Ω∖P, this quotient represents f on all of Ω.

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-30Open item page →

Meromorphic functions on a connected plane domain form a field

Statement

Let Ω⊆C be a connected plane domain. Then the meromorphic functions on Ω form a field under pointwise addition and multiplication.

Facts & Assumptions

Given: A connected plane domain Ω.

[L1]

Every meromorphic function on Ω is a quotient g/h of holomorphic functions with h≢0 (Every meromorphic function on a plane domain is a quotient of holomorphic functions).

Proof

technique · direct
1.1given

Sums and products of meromorphic functions are meromorphic by the pointwise formulas on the common holomorphic locus.

2.1L1step 1.1algebra

Let f be a nonzero meromorphic function. By [L1], write f=g/h with g,h holomorphic and h≢0. Since Ω is connected and f≢0, one also has g≢0. On the set where g≠0, 1/f=h/g, which is meromorphic; at a zero of g this quotient has at worst a pole. Hence 1/f is meromorphic on Ω.

3.1step 1.1step 2.1algebra∎

Therefore every nonzero meromorphic function has a multiplicative inverse, and together with step 1.1 this makes the meromorphic functions a field.

RemarkRemark: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-30Open item page →

Choice bookkeeping for Runge and Mittag-Leffler

Remark

The proofs on this page separate two kinds of choice.

First, the compact-set Runge theorem is finitary once the pole representatives are named: the enclosing cycle is a finite polygonal chain, the Riemann sums use finite sampling, and pole pushing moves finitely many poles along finitely many disc chains.

Second, the domain versions need an exhaustion and one representative in each component of C^∖Ω. The exhaustion can be chosen canonically, but the complementary representatives are genuine extra data unless the domain already comes with a distinguished choice, for example when the complement is connected and {∞} is the pole set. The local proofs therefore stay within ordinary finitary reasoning, while the global statements record exactly where the component-by-component bookkeeping enters.

5 · Examples, counterexamples and false statements

None yet.

Sources