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

Poles of a meromorphic function form a closed discrete set and are at most countable

Statement

Let f be meromorphic on a plane domain Ω, and let P⊆Ω be its pole set. Then:

  1. every a∈P has a neighbourhood in Ω containing no other pole, so P is discrete in Ω;
  2. Ω∖P is open, so P is closed in Ω;
  3. P is at most countable.

Facts & Assumptions

Given: A meromorphic function f:Ω∖P→C on a nonempty connected open set Ω.

[L1]

By definition, every point of P is a pole, and f is holomorphic on Ω∖P (Meromorphic functions on a plane domain, Isolated singularities: removable, poles, and essential singularities).

[L2]

The rationals are countable, the product of two at most countable sets is at most countable, a subset of an at most countable set is at most countable, and every nonempty at most countable set admits a surjection from N whose least-hit map gives an injection into N (Q is countably infinite, A product of two at most countable sets is at most countable, Every subset of an at most countable set is at most countable, A nonempty set is at most countable iff it is a surjective image of N).

[L3]

Between any two real numbers lies a rational (The rationals embed densely in the reals).

[L4]

Every nonempty subset of N has a least element (The well-ordering principle).

Proof

technique · direct
1.1L1

Fix a∈P. By [L1], a is a pole, so some radius ra>0 has ∣z−a∣<ra contained in Ω and f holomorphic on 0<∣z−a∣<ra. If b∈P and 0<∣b−a∣<ra, then b lies in a region where f is holomorphic, contradicting b∈P. Thus B(a,ra) contains no pole other than a.

1.2L2

Let D be the family of discs B(p+iq,s) with p,q,s∈Q and s>0. By [L2], Q3 is at most countable, so D is at most countable and admits an injection e:D→N.

2.1step 1.1L1

Step 1.1 proves that P is discrete in Ω. If c∈Ω∖P, then [L1] says f is holomorphic on a neighbourhood of c, and that neighbourhood contains no point of P; hence Ω∖P is open and P is closed in Ω.

2.2step 1.1L3choose

For each a∈P, step 1.1 gives ra>0. Write a=x+iy. By [L3], choose rationals p,q with ∣x−p∣<ra/8 and ∣y−q∣<ra/8, so ∣a−(p+iq)∣<ra/4; choose a rational s with ∣a−(p+iq)∣<s<ra/2, again by [L3]. Then a∈B(p+iq,s)⊆B(a,ra), so the set of discs in D containing a and contained in B(a,ra) is nonempty.

3.1step 1.1step 1.2step 2.2L4

For each a∈P, the set Ea:={ e(D):D∈D, a∈D⊆B(a,ra) } is nonempty by step 2.2, so [L4] gives its least element; call it j(a). If j(a)=j(b), then injectivity of e makes the corresponding discs equal, and that disc lies inside B(a,ra) and contains both a and b, so step 1.1 forces a=b. Therefore a↦j(a) is injective from P into N.

4.1step 2.1step 1.2step 3.1L2∎

The injection of step 3.1 makes P at most countable, completing the proof.

Remarks

The pole set need not be closed in all of C when Ω≠C: it may accumulate at boundary points of the domain. The theorem says precisely that no accumulation can happen inside Ω.

Depends on

Used by

Dependency tree · two levels

41 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