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 · 7 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 6 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 aC, let R>0, and let f be holomorphic on the punctured disc 0<za<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:

m1cm(za)m.

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

pa(z)=m=1Mcm(za)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 cM0.

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 cm0.

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 KC be compact, let U be an open neighbourhood of K, and let f:UC be holomorphic. A subset PC^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 PC and whose only possible pole at is also in P, such that

supzKf(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 KC be compact. A pole-pushing chain from a0 to am relative to K is a finite list of closed discs D1,,Dm such that

  1. DjK= for every j;
  2. aj1,ajDj for every j=1,,m.

Given ε>0, pushing the pole of (za0)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. supzKr(z)(za0)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 KUC, where K is compact and U is open. Then there is a complex chain Γ with polygonal trace such that

  1. Γ is a cycle;
  2. ΓUK;
  3. n(Γ,z)=1 for every zK.

Facts & Assumptions

Given: A compact set K contained in an open set UC.

[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.1

By [L1], choose a compact Jordan set J such that KintJJU, 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 ΓUK.

givenL1L3construct
2.1

Let pintJ 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 pintQ and returns with zero net turn when pQ; 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.

step 1.1L2L3algebra
3.1

Fix zK. Choose a disc D(z,r)intJ and a point pD(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.

step 1.1step 2.1L4choosedischarge-construct
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-30Open item page →

Riemann sums of the Cauchy integral give rational approximation

Statement

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

supzKf(z)r(z)<ε.

Facts & Assumptions

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

[L1]

There is a polygonal cycle Γ with ΓUK and n(Γ,z)=1 for every zK (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.1

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(ζ)ζzdζ(zK).

L1L2given
2.1

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 zK.

step 1.1L3algebra
3.1

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 supzKf(z)r(z)<ε.

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

Runge's pole-pushing lemma

Statement

Let KC be compact.

  1. If D1,,Dm 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 supzKr(z)(za0)1<ε.
  2. If a0,,am is such a chain and in addition z<R<am for every zK, then for every ε>0 there is a polynomial p with supzKp(z)(za0)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 aj1,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,bD(c,ρ). [given, L1] Define SD(c,ρ) to be the set of points u such that (za)1 can be approximated uniformly on K by rational functions with only pole u. Certainly aS.

2.1

Let uS. Choose r>0 so that D(u,r)D(c,ρ) and r<dist(K,u)/2. [step 1.1, choose, algebra] If vD(u,r) and m1, then for zK one has uv<zv, so 1(zu)m=1(zv)m(1uvzv)m=ν=0(m+ν1ν)(uv)ν(zv)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 uS, this shows vS, so S is open. The same expansion with u and v exchanged shows that whenever vS is sufficiently close to u, then uS 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 bS.

givenL1algebra
3.1

If m=0, then am=a0, and r(z)=(za0)1 proves clause 1 with zero error. Assume m1. 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.

step 2.1chooseconstructcasesalgebra
4.1

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

step 3.1algebradischarge-construct
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-30Open item page →

Runge approximation with a prescribed pole set

Statement

Let KC be compact, let U be an open neighbourhood of K, let f:UC be holomorphic, and let PC^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

supzKf(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.1

By [L1], choose a rational function r0(z)=ν=1Ncν/(zaν) whose poles aν lie in C^K and such that supzKf(z)r0(z)<ε/2.

givenL1construct
2.1

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 N1.

step 1.1cases
3.1

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

L2L3step 1.1step 2.1choose
4.1

Put r=ν=1Nsν. Then every pole of r lies in P, and the triangle inequality together with steps 1.1 and 3.1 gives supzKf(z)r(z)supzKf(z)r0(z)+ν=1NsupzKsν(z)cνzaν<ε.

step 1.1step 2.1step 3.1algebra
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-30Open item page →

Runge polynomial approximation when the complement is connected

Statement

Let KC 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

supzKf(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.1

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 .

givenL1
2.1

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.

step 1.1algebra
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 PC^Ω, 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 PC, the only possible pole at infinity also lies in P, and

rnflocally 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 PC^Ω 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.1

Choose an increasing exhaustion K1K2 of compact subsets of Ω with nKn=Ω and KnintKn+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.

givenL1construct
2.1

Apply [L2] to each Kn with tolerance 2n. This gives a rational function rn with poles in P and supzKnf(z)rn(z)<2n.

L2step 1.1choose
3.1

Fix a compact set KΩ. Choose N with KKN. Then for every nN one has KKn, so step 2.1 gives supzKf(z)rn(z)2n. Hence rnf uniformly on K. Since K was arbitrary, [L3] gives local-uniform convergence on Ω.

step 2.1L3algebra
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.1

Choose radii Rn so that AD(0,Rn)= and AD(0,Rn) is finite for every n. [given, L1, choose] Put S1:=AD(0,R1),Sn:=A(D(0,Rn)D(0,Rn1))(n2). Then each Sn is finite and A=n1Sn. For n2, the finite sum fn(z):=akSnpk(z) is holomorphic on a neighbourhood of D(0,Rn1), because every pole it carries lies outside that disc. Set likewise f1(z):=akS1pk(z).

givenL1choose
2.1

By [L2], for each n2 choose a polynomial qn such that [L2, step 1.1, construct] supzRn1fn(z)qn(z)<2n. Put g1:=f1 and gn:=fnqn for n2. Then every gn is meromorphic on C, has the same principal parts as the finitely many pk with akSn, and is holomorphic on D(0,Rn1).

L2step 1.1construct
3.1

Fix a compact set KCA. Choose with [step 2.1, choose, algebra, discharge-construct] KD(0,R). For every n+1, one has KD(0,Rn1), so step 2.1 gives supKgn2n. Hence n1gn converges uniformly on K. Near any point akS, all terms except g are holomorphic, so the sum f:=n1gn is meromorphic on C and has principal part pk at ak.

step 2.1choosealgebradischarge-construct
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 aA let pa be a prescribed principal part at a. Then there is a meromorphic function on Ω whose principal part at each aA is pa.

Facts & Assumptions

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

[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.1

Choose an increasing compact exhaustion C1C2 of Ω with CnCn+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 K1K2 of compact subsets of Ω such that every connected component of C^Kn meets C^Ω. Because A is discrete, each set An:=A(KnKn1)(K0:=) is finite. Let fn(z):=aAnpa(z). Then fn is meromorphic on Ω and holomorphic on a neighbourhood of Kn1.

givenL1L3construct
2.1

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

L2step 1.1choose
3.1

For a compact set KΩA, choose N with [step 2.1, algebra, discharge-construct] KKN1. Then for every nN, step 2.1 gives supKhn2n. Therefore nhn converges uniformly on K. Only finitely many layers An meet a given compact set, so f:=n1hn is meromorphic on Ω, and its principal part at each aAn is exactly pa.

step 2.1algebradischarge-construct
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-30Open item page →

The Mittag-Leffler expansion of pi cotangent

Statement

For every zCZ,

πcot(πz)=1z+n12zz2n2=1z+n1(1zn+1z+n).

where the series converges locally uniformly on CZ.

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.1

Fix zCZ. For N large enough that z,zRN, 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)w2z2. By [L2], the poles of FN inside RN are the integers n with nN and the points w=±z. The residue at an integer n is (n2z2)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=NN1n2z2).

L2L3givenalgebra
2.1

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=sin2(πx)+sinh2(π(N+1/2)),cos(πw)2=cos2(πx)+sinh2(π(N+1/2)), so cot(πw)2. Also wN+1/2 on RN, hence w2z2w2z2(N+1/2)2z2. Thus FN(w)Cz/N2 on RN, and since the boundary length is 8N+4, one gets RNFN(w)dw0 as N.

L1step 1.1algebra
3.1

Letting N in step 1.1 and using step 2.1 yields [step 1.1, step 2.1, algebra] πcot(πz)z=nZ1n2z2=1z2+n12z2n2. Multiplying by z gives πcot(πz)=1z+n12zz2n2=1z+n1(1zn+1z+n). On every compact subset of CZ, 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.

step 1.1step 2.1algebra
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-30Open item page →

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

Statement

For every zCZ,

π2csc2(πz)=nZ1(zn)2=1z2+n1(1(zn)2+1(z+n)2).

with locally uniform convergence on CZ.

Facts & Assumptions

Given: The cotangent expansion on CZ.

[L1]

On CZ, πcot(πz)=1/z+n12z/(z2n2) (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.1

Let SN(z):=1z+n=1N(1zn+1z+n). By [L1], the holomorphic functions SN converge locally uniformly on CZ to πcot(πz). On any compact set KCZ, the derivatives satisfy SN(z)=1z2n=1N(1(zn)2+1(z+n)2), and this derivative series converges uniformly on K because its terms are O(n2) there. Therefore [L3] identifies the derivative of the limit with the displayed series on K.

L1L3given
2.1

Differentiating [L1] gives π2csc2(πz)=1z2n1(1(zn)2+1(z+n)2) by [L2]. Multiplying by 1 yields the claimed formula.

step 1.1L2algebra
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-30Open item page →

Every discrete effective divisor on a plane domain is the zero divisor of a holomorphic function

Statement

Let ΩC be a plane domain, and let AΩ be discrete with multiplicities m(a)N. Then there is a holomorphic function F on Ω whose zero at each aA has order exactly m(a) and which has no other zeros.

Facts & Assumptions

Given: A plane domain Ω and a discrete effective divisor aAm(a)[a] on Ω.

[L1]

The elementary factor Ep(w) has its only zero at w=1 (Weierstrass elementary factors).

[L2]

If w1, then 1Ep(w)wp+1 (The unit-disc estimate for Weierstrass elementary factors).

[L3]

A normally convergent product of holomorphic factors is holomorphic and has exactly the zeros contributed by its factors (Normally convergent products define holomorphic functions with the expected zeros).

[L4]

If m0 and (an) is a discrete sequence of nonzero complex numbers, then a product zmnEpn(z/an) is entire and has exactly the order-m zero at 0 and the listed nonzero zeros with multiplicity (Weierstrass product theorem on the complex plane).

Proof

technique · constructive
1.1

List the points of A with each a repeated m(a) times. If the list is finite, the corresponding finite polynomial works (with F1 for the empty list). If the list is infinite and Ω=C, let m0 be the multiplicity of 0 and enumerate the remaining nonzero terms as (an). Fact [L4] applied to m0 and (an) gives the required entire function. Thus assume CΩ. Define D:={zΩ:dist(z,CΩ)<1z+1}. Split the repeated list into (bj), consisting of the terms in D, and (cj), consisting of the remaining terms.

L4givenconstructcases
2.1

For each bj, choose pjCΩ with bjpj=dist(bj,CΩ). If (bj) is infinite, then bjpj0: otherwise a subsequence stays a fixed positive distance from the boundary, while the defining inequality for D keeps that subsequence bounded, producing a limit point in Ω. Define Qj(z):=Ej ⁣(bjpjzpj). Each Qj is holomorphic on Ω and, by [L1], has its only zero at z=bj.

L1step 1.1choosealgebra
2.2

If (cj) is infinite, then cj. Indeed, a bounded subsequence would have a limit point; discreteness excludes a limit in Ω, while cjD gives dist(cj,CΩ)1cj+1, which excludes a boundary limit. Let m0 be the multiplicity of 0 in this list and enumerate its nonzero terms as (dj). Then dj, so [L4] gives an entire function F2(z)=zm0jEpj(z/dj) whose zeros, with repetition, are exactly the cj. If the list is finite, take the corresponding finite polynomial, and if it is empty, take F21.

L4step 1.1casesalgebra
3.1

Fix a compact set KΩ and put d:=dist(K,CΩ)>0. For all sufficiently large j, supzKbjpjzpjbjpjd12. Hence [L2] gives supzK1Qj(z)2j1 after increasing the starting index if necessary. Thus jQj is normally convergent on Ω, and [L3] gives a holomorphic function F1 whose zeros, with repetition, are exactly the bj.

L2L3step 2.1algebra
4.1

The product F:=F1F2 is holomorphic on Ω. Steps 3.1 and 2.2 show that its zeros are exactly the original points aA, and repetition in the list gives each zero order m(a).

step 3.1step 2.2discharge-construct
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-30Open 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 discrete effective divisor on a plane domain is the zero divisor of a holomorphic function (Every discrete effective divisor on a plane domain is the zero divisor of a holomorphic function).

[L3]

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

Proof

technique · direct
1.1

Let P be the pole set of f, with multiplicities equal to pole orders. By [L2], choose a holomorphic function h on Ω whose zero divisor is exactly P.

L1L2givenconstruct
2.1

On ΩP, define g:=fh. Near a pole aP, 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.

L1L3step 1.1algebra
3.1

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 Ω.

step 1.1step 2.1algebra
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.1

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

given
2.1

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 g0, 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 Ω.

L1step 1.1algebra
3.1

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

step 1.1step 2.1algebra
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