Alphabeta Math
Session-authored (Fable 5 assisted)
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.

11 results · all verified · 2 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 9 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

The Argument Principle and Rouché's Theorem — Examples

1 · Prerequisites

2 · Summary

These examples keep the page honest about what the theorem family actually computes. Three short Rouché counts show how the boundary inequality turns into interior root counts; the cubic image-curve example makes the geometric winding interpretation visible; the Hurwitz and inverse-formula examples show how the counting results control limiting and local inverse behavior.

The companion counterexamples and false statements isolate the standard failure modes. Equality on the boundary is not enough for the classical Rouché theorem, the essential-singularity setting does not carry a finite argument-principle count, and the injective-limit theorem really does need its “or constant” escape clause.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-28Open item page →

The polynomial z^5 + 3z + 1 has one zero in the unit disc

Example

The polynomial

p(z)=z5+3z+1

has exactly one zero in the unit disc.

Facts & Assumptions

Given: The polynomial p(z)=z5+3z+1 and the unit circle z=1.

[L1]

Rouché's theorem preserves the zero count when the strict boundary inequality holds (Rouche's theorem in the classical strict-inequality form).

Verification

technique · direct
1.1

On z=1, z5+1z5+1=2<3=3z.

givenalgebra
2.1

Apply [L1] with f=p and g(z)=3z. The function 3z has exactly one zero in z<1, so p has exactly one zero there as well.

step 1.1L1
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-28Open item page →

The same polynomial has four zeros in the annulus 1 < |z| < 2

Example

The polynomial z5+3z+1 has exactly four zeros in the annulus 1<z<2.

Facts & Assumptions

Given: The polynomial p(z)=z5+3z+1.

[L1]

Rouché's theorem preserves the zero count on a circle (Rouche's theorem in the classical strict-inequality form).

Verification

technique · direct
1.1

On the circle z=2, 3z+13z+1=7<32=z5. So [L1] applied to p and z5 shows that p has five zeros in z<2, counted with multiplicity.

L1givenalgebra
1.2

On the circle z=1, z5+12<3=3z. Another application of [L1] shows that p has exactly one zero in z<1.

L1givenalgebra
2.1

Therefore the number of zeros in the annulus 1<z<2 is 51=4.

step 1.1step 1.2
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-28Open item page →

The equation e^z = 3z has exactly one solution in the unit disc

Example

The equation

ez=3z

has exactly one solution in the unit disc.

Facts & Assumptions

Given: The function f(z)=ez3z and the unit circle z=1.

[L1]

Rouché's theorem preserves the zero count under the strict boundary inequality (Rouche's theorem in the classical strict-inequality form).

Verification

technique · direct
1.1

If z=1, then Rez1, so ez=eReze<3=3z.

givenalgebra
2.1

Apply [L1] to f(z)=ez3z and g(z)=3z. Since 3z has exactly one zero in z<1, so does f.

step 1.1L1
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-28Open item page →

A cubic image curve winds three times around the origin

Example

Let γ(t)=2eit for 0t2π and let f(z)=z31. Then the image contour fγ winds three times around the origin:

n(fγ,0)=3.

Facts & Assumptions

Given: The circle γ(t)=2eit and the cubic polynomial f(z)=z31.

[L1]

The logarithmic-derivative integral equals the winding number of the image contour, and on a null-homologous contour it also equals the zero-minus-pole count (The argument-principle integral is the winding number of the image cycle).

Verification

technique · direct
1.1

The three zeros of f are the cube roots of unity, so they all lie in z<2. The function has no poles.

givenalgebra
2.1

Apply [L1] to the circle γ. Since γ is null-homologous in C and encloses all three zeros of f, the argument-principle count is 3. Therefore n(fγ,0)=3.

step 1.1L1
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-28Open item page →

Hurwitz preserves a simple zero under local uniform convergence

Example

Define

fn(z)=z+z2n+1.

Then fnz locally uniformly, and on a small disc around 0 each sufficiently large fn has exactly one zero counted with multiplicity.

Facts & Assumptions

Given: The sequence fn(z)=z+z2/(n+1) and the limit function f(z)=z.

[L1]

Locally uniform convergence preserves the total multiplicity near an isolated zero (Locally uniform convergence preserves the total multiplicity near an isolated zero).

Verification

technique · direct
1.1

On every compact set, z2/(n+1)0, so fnf locally uniformly. The limit function f(z)=z has a simple zero at 0.

givenalgebra
2.1

Apply [L1] to the isolated zero at 0. It follows that on some disc D(0,r), every sufficiently large fn has exactly one zero counted with multiplicity.

step 1.1L1
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-28Open item page →

The inverse contour formula recovers a local inverse value

Example

Let f(z)=z+z2, let γ(t)=14eit, and let w satisfy w<18. Let s be the square root of 1+4w with positive real part. Then f(z)=w has exactly one simple solution inside γ, namely

z(w)=1+s2,

and the inverse contour formula gives

z(w)=12πiγζ(1+2ζ)ζ+ζ2wdζ.

Facts & Assumptions

Given: The function f(z)=z+z2, the circle γ(t)=14eit, and a complex number w with w<18.

[L1]

If a contour encloses exactly one simple preimage of w, the inverse contour formula recovers it (A contour formula for a locally single-valued holomorphic inverse).

Verification

technique · direct
1.1

On the circle z=1/4 one has z2wz2+w<116+18=316<14=z. So Rouché's theorem applied to z and z+z2w shows that f(z)w has exactly one zero inside γ.

givenalgebra
2.1

The two roots of z2+zw are (1±s)/2. Since Res>0, one has s+11+Res>1, so s1=s21s+1=4ws+1<12. Therefore 1+s2<14,1s2=1+s2>12>14. So the unique zero inside γ is z(w)=(1+s)/2.

step 1.1givenalgebra
3.1

If f(z)=w and z<1/4, then 1+2z12z>1/2, so the enclosed zero is simple. The positively oriented circle γ(t)=14eit winds once around every point of z<1/4, so the hypotheses of [L1] are satisfied and the inverse contour formula gives z(w)=12πiγζ(1+2ζ)ζ+ζ2wdζ.

L1step 1.1step 2.1algebra
CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

The sequence z/(n+1) shows why the injective-limit theorem needs the constant escape clause

Statement refuted

Refuted claim: a locally uniform limit of injective holomorphic functions is still injective, with no exception.

Facts & Assumptions

Given: The sequence fn(z)=z/(n+1) on C.

[L1]

The correct theorem says that such a limit is injective or constant (A locally uniform limit of injective holomorphic functions is injective or constant).

Counterexample

technique · direct
1.1

Every fn(z)=z/(n+1) is entire and injective. On each compact set, fn(z)supKz/(n+1)0, so fn0 locally uniformly.

givenalgebra
2.1

The limit function is the constant 0, which is not injective. Thus the claim without the constant escape clause is false, exactly as [L1] warns.

step 1.1L1
CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-28Open item page →

The function e^(1/z) shows that essential singularities lie outside the argument principle

Statement refuted

Refuted claim: the argument principle still applies unchanged when the enclosed singularity is essential.

Facts & Assumptions

Given: The punctured unit disc and the function f(z)=e1/z1.

[L1]

The argument principle requires a finite zero-minus-pole count for a meromorphic function (The argument principle for an admissible null-homologous cycle).

Counterexample

technique · direct
1.1

The equation e1/z1=0 is equivalent to 1/z=2πik for some nonzero integer k, so the zeros are zk=12πik(kZ{0}). These are infinitely many distinct points, and they accumulate at 0.

givenalgebra
2.1

Thus every small circle around 0 encloses infinitely many zeros of e1/z1, while 0 is an essential singularity rather than a pole. The finite meromorphic count required by [L1] is unavailable, so the naive extension of the argument principle to essential singularities is false.

step 1.1L1
CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-28Open item page →

The weak inequality |f-g| <= |g| does not suffice in Rouche

Statement refuted

Refuted claim: Rouché's theorem remains valid when the strict boundary inequality fg<g is weakened to fgg.

Facts & Assumptions

Given: The unit circle, g(z)=z, and f(z)=z+1.

[L1]

The classical theorem requires the strict inequality (Rouche's theorem in the classical strict-inequality form).

Counterexample

technique · direct
1.1

On z=1 one has f(z)g(z)=1=1=z=g(z), so the weak inequality holds everywhere on the boundary.

givenalgebra
2.1

But f vanishes at z=1, which lies on the boundary itself. So the interior zero-count conclusion is no longer even well posed. This is exactly why [L1] is stated with a strict inequality.

step 1.1L1
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

FALSE: a locally uniform limit of injective holomorphic functions is always injective

Statement

False claim: a locally uniform limit of injective holomorphic functions is always injective.

Facts & Assumptions

Given: The sequence fn(z)=z/(n+1) on C.

[L1]

The correct theorem says that the limit is injective or constant (A locally uniform limit of injective holomorphic functions is injective or constant).

Refutation

technique · direct
1.1

Each fn(z)=z/(n+1) is injective, entire, and converges locally uniformly to the constant function 0.

givenalgebra
2.1

The limit 0 is not injective. Therefore the claim is false, and [L1] identifies the missing clause exactly.

step 1.1L1
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-28Open item page →

FALSE: the argument principle ignores multiplicity

Statement

False claim: the argument principle counts zeros of a holomorphic function without multiplicity.

Facts & Assumptions

Given: The function f(z)=z2 and the unit circle γ(t)=eit.

[L1]

The argument principle counts zeros with multiplicity (The argument principle for an admissible null-homologous cycle).

Refutation

technique · direct
1.1

The function f(z)=z2 has exactly one distinct zero, namely 0, but that zero has multiplicity 2.

given
2.1

Applying [L1] on the unit circle gives 12πiγf(z)f(z)dz=12πiγ2zdz=2. So the argument principle returns 2, not the number of distinct zeros. The claim is false.

step 1.1L1algebra

Sources