Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-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.

Rational degree appears as logarithmic characteristic

Example

Let R(z)=z2+1z−1. This is a rational map of degree two. For every r>1, its pole count is N(r,∞;R)=log⁡r, and its boundary proximity satisfies m(r,∞;R)=log⁡r+O(1)(r→∞). Consequently, T(r,R)=2log⁡r+O(1)(r→∞).

Facts & Assumptions

Given: The normalized chordal characteristic and the fixed rational composition law for meromorphic functions.

[F1]

T(r,f)=m(r,∞;f)+N(r,∞;f) (Counting, chordal proximity and characteristic).

[F2]

δ(w,∞)=1/1+∣w∣2, so log⁡(1/δ(w,∞))=12log⁡(1+∣w∣2) (Counting, chordal proximity and characteristic).

[F3]

n(r,a;f) sums local multiplicities on the closed disc ∣z∣≤r; for a=∞ these are pole orders (Counting, chordal proximity and characteristic).

[F4]

N(r,a;f)=n(0,a;f)log⁡r+∫0r(n(t,a;f)−n(0,a;f)) dt/t (Counting, chordal proximity and characteristic).

[F5]

If Q is a fixed rational map of degree d≥1 and h is nonconstant meromorphic, then T(r,Q(h))=dT(r,h)+OQ,h(1) (Elementary characteristic laws and fixed rational composition).

[F6]

A rational map of degree d≥1 has T(r,f)=dlog⁡r+O(1) (Rational functions are exactly those with logarithmic characteristic).

Verification

Given: The function R in the example and the definitions and laws above.

1.1F3F4algebra

Polynomial division gives R(z)=z+1+2/(z−1). The numerator equals 2 at z=1, so this is the unique pole and it is simple; the numerator and denominator are coprime and their maximum degree is 2. Also R(0)=−1, so n(0,∞;R)=0; then n(t,∞;R)=0 for t<1 and n(t,∞;R)=1 for t≥1. By [F3, F4], N(1,∞;R)=0 (the boundary pole has logarithmic weight log⁡1=0), while for every r>1, N(r,∞;R)=∫1rdt/t=log⁡r.

1.2F2algebra

For ∣z∣=r≥4, the decomposition gives ∣R(z)∣≥r−1−2/(r−1)≥r/2 and ∣R(z)∣≤r+1+2/(r−1)≤2r. Hence [F2] bounds the pointwise proximity by log⁡r−log⁡2≤12log⁡(1+∣R(z)∣2)≤log⁡r+12log⁡(4+r−2)=log⁡r+O(1) uniformly on the circle. Averaging gives m(r,∞;R)=log⁡r+O(1).

2.1F1F2F5F6step 1.1step 1.2algebra∎

By [F1] and steps 1.1–1.2, T(r,R)=2log⁡r+O(1). Also, [F1, F2] give T(r,z)=12log⁡(1+r2)=log⁡r+O(1) because z has no poles and ∣z∣=r on the averaging circle. Since R has degree two, [F5] applied to the identity map gives the same T(r,R)=2T(r,z)+O(1); this agrees with the exact rational degree law [F6].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

14 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