Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-30
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.

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.

Depends on

Used by

Dependency tree · two levels

2 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