Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedaudited 2026-10-02
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.

Deficiencies of the exponential and sine

Example

Assume Countable Choice.

  1. For the entire function f(z)=ez one has T(r,f)=rπ+O(1),δ(0,f)=δ(∞,f)=1,δ(a,f)=0 for every a∈C∖{0}. In fact all ramification indices of ez vanish.
  2. For f(z)=sin⁡z one has T(r,f)=2r/π+o(r), in fact T(r,f)=2r/π+O(1), and δ(∞,f)=1 while every finite deficiency vanishes; moreover ε(1,f)=ε(−1,f)=12 and all other ramification indices vanish. Consequently the combined defect sum of sine is ∑a(δ(a,f)+ε(a,f))=2, meeting the general bound of the defect relation.

Facts & Assumptions

Given: The exponential f(z)=ez and the sine f(z)=sin⁡z; Countable Choice is assumed as in the statement, and the computations below are choice-free.

[F1]

Counting and characteristic: N(r,a;h)=n(0,a;h)log⁡r+∫0rn(t,a;h)−n(0,a;h)tdt is the centre-regularized integrated count, T(r,h)=m(r,∞;h)+N(r,∞;h) with the chordal proximity, and an entire h has N(r,∞;h)=0 (Counting, chordal proximity and characteristic).

[F2]

Truncated counts: N(r,a;h)=Nˉ(r,a;h)+N1(r,a;h), where nˉ counts each a-point once and N1 weights each point by its local degree minus one (Truncated value and ramification counts).

[F3]

Deficiency and ramification index: δ(a,h)=lim inf⁡rm(r,a;h)T(r,h)=1−lim sup⁡rN(r,a;h)T(r,h) and ε(a,h)=lim inf⁡rN1(r,a;h)T(r,h), both in [0,1]; if h omits a then δ(a,h)=1; the total deficiency sum over the sphere is the supremum of its finite subsums (Nevanlinna deficiency and ramification index).

[F4]

Defect relation: for every nonconstant meromorphic h on C, ∑a(δ(a,h)+ε(a,h))≤2 (Nevanlinna deficiency and ramification defect relations).

[F6]

Quadratic proximity comparison: with m0(r,h)=12π∫02πlog⁡+∣h(reit)∣dt the standard proximity and δ(w,∞)=1/1+∣w∣2 the chordal distance to infinity, one has log⁡+∣w∣≤12log⁡(1+∣w∣2)≤log⁡+∣w∣+12log⁡2 for every w, hence m0(r,h)≤m(r,∞;h)≤m0(r,h)+12log⁡2 for every meromorphic h (Counting, chordal proximity and characteristic).

[F7]

Complex sine and cosine: sin⁡z=exp⁡(iz)−exp⁡(−iz)2i and cos⁡z=exp⁡(iz)+exp⁡(−iz)2; both are entire, sin⁡′=cos⁡ and cos⁡′=−sin⁡ (Complex sine, cosine, hyperbolic sine, and hyperbolic cosine from the complex exponential, Complex sine, cosine, hyperbolic sine, and hyperbolic cosine are entire with their standard derivatives).

[F10]

Fundamental theorem of algebra: every nonconstant complex polynomial has a complex root (Fundamental theorem of algebra by Liouville's theorem).

Verification

technique · compute the characteristic and counting functions of the two explicit entire functions, read off the deficiencies and ramification indices from the definitions, and add the nonzero contributions to obtain the defect sums
1.1F1F5F6algebra

(Exponential: characteristic) By [F1] and [F6], for the entire function ez one has m0(r,ez)≤T(r,ez)≤m0(r,ez)+12log⁡2. For z=reit the modulus formula [F5] gives log⁡+∣ez∣=max⁡(0,rcos⁡t)=rcos⁡+t, and ∫02πcos⁡+t dt=∫−π/2π/2cos⁡t dt=2, so m0(r,ez)=r2π⋅2=rπ. Hence T(r,ez)=rπ+O(1).

1.2F2F5algebra

(Exponential: a-point counts) By [F5] the kernel of the exponential is 2πiZ and every nonzero value is attained, so for fixed a≠0 and a logarithm b of a the a-points of ez are exactly the points b+2πik, k∈Z, and they are simple because (ez)′=ez≠0 there. The number of k∈Z with ∣b+2πik∣≤t is tπ+O(1) for large t: writing b=u+iv, the condition is ∣v+2πk∣≤t2−u2, a nonempty integer interval of length tπ+O(1). Therefore n(t,a;ez)=tπ+O(1) and N(r,a;ez)=Nˉ(r,a;ez)=rπ+O(log⁡r) with N1(r,a;ez)=0.

1.3F5F6F7F9algebra

(Sine: characteristic) By [F7] sine is entire, so [F6] gives m0(r,sin⁡)≤T(r,sin⁡)≤m0(r,sin⁡)+12log⁡2. For z=reit the definition [F7] and the modulus formula [F5] give ∣sin⁡z∣≤12(e∣Im⁡z∣+e−∣Im⁡z∣)≤e∣Im⁡z∣=er∣sin⁡t∣, so log⁡+∣sin⁡z∣≤r∣sin⁡t∣ and m0(r,sin⁡)≤r2π∫02π∣sin⁡t∣ dt=2rπ by [F7]. Conversely, ∣sin⁡z∣≥12(e∣Im⁡z∣−e−∣Im⁡z∣)≥14er∣sin⁡t∣ whenever r∣sin⁡t∣≥1, so log⁡+∣sin⁡z∣≥r∣sin⁡t∣−log⁡4 on that set, and since the integrand is nonnegative everywhere, m0(r,sin⁡)≥12π∫02π(r∣sin⁡t∣−log⁡4) dt=2rπ−log⁡4. Hence T(r,sin⁡)=2rπ+O(1).

1.4F5F7F10algebra

(Sine: reduction to a quadratic) Fix a∈C; putting w=eiz, one has sin⁡z=a if and only if w2−2iaw−1=0, because eiz≠0 and multiplying w−w−12i=a by 2iw is reversible. If q(w)=w2−2iaw−1 has a double root w, then w=ia and w2=−1, forcing a2=1; so for a≠±1 the polynomial q has two distinct roots w1,w2, and q(0)=−1 shows both are nonzero. By [F7] a root w1≠0 exists, and w2:=−1/w1 is a second root, since w12−2iaw1−1=0 gives q(−1/w1)=w1−2(1+2iaw1−w12)=0.

1.5F8F7algebra

(Sine: simplicity away from ±1) At a solution of sin⁡z=a with w=eiz one has cos⁡z=w+w−12=w2+12w by [F7], which vanishes exactly when w=±i by [F7]; then sin⁡z=w−w−12i equals 1 for w=i and −1 for w=−i. Hence for a≠±1 no a-point has cos⁡z=0, and since sin⁡′=cos⁡ by [F7] every a-point is simple.

2.1F1F3F5step 1.1step 1.2

(Exponential: deficiencies) Since ez is entire, N(r,∞;ez)=0 and [F3] gives δ(∞,ez)=1; since ez≠0 for all z the value 0 is omitted and [F3] gives δ(0,ez)=1; for 0≠a∈C step 1.2 gives N(r,a;ez)T(r,ez)→1, hence δ(a,ez)=1−lim sup⁡rN(r,a;ez)T(r,ez)=0.

2.2F2F3step 1.2

(Exponential: ramification indices) For finite a≠0 all a-points of ez are simple by step 1.2, so N1(r,a;ez)=0 and ε(a,ez)=0; for a=0 the counting function is identically zero, so ε(0,ez)=0; and N1(r,∞;ez)=0 because ez has no poles, so ε(∞,ez)=0.

2.3F5step 1.4algebra

(Sine: the a-point progressions) With wj≠0 as in step 1.4, fix bj with ebj=wj by [F5]; then eiz=wj if and only if iz−bj∈2πiZ, that is, z∈−ibj+2πZ by [F5]. Hence for a≠±1 the solutions of sin⁡z=a are exactly the two disjoint arithmetic progressions −ib1+2πZ and −ib2+2πZ.

2.4F1F2F7F8step 1.4algebra

(Sine: the values ±1) For a=1 the quadratic of step 1.4 is q(w)=(w−i)2, so sin⁡z=1 if and only if eiz=i, that is, z∈π2+2πZ; at these points cos⁡z=0 by [F7] and sin⁡′′=−sin⁡=−1≠0 by [F7], so each is a double point: n(t,1;sin⁡)=2tπ+O(1) with multiplicity and nˉ(t,1;sin⁡)=tπ+O(1), whence N(r,1;sin⁡)=2rπ+O(log⁡r), Nˉ(r,1;sin⁡)=rπ+O(log⁡r) and N1(r,1;sin⁡)=rπ+O(log⁡r). The same computation with −i and the progression −π2+2πZ gives the analogous statements for a=−1.

3.1F1F2step 2.3step 1.5algebra

(Sine: counting for a≠±1) For a fixed c∈C, the number of k∈Z with ∣c+2πik∣≤t is tπ+O(1) as t→∞: the condition is ∣2πk+Im⁡c∣≤t2−(Re⁡c)2, an integer interval of length tπ+O(1). The two disjoint progressions of step 2.3 therefore give n(t,a;sin⁡)=2tπ+O(1), and by step 1.5 all a-points are simple, so N(r,a;sin⁡)=Nˉ(r,a;sin⁡)=2rπ+O(log⁡r) and N1(r,a;sin⁡)=0.

4.1F2F3step 1.3step 3.1step 2.4

(Sine: deficiencies and ramification indices) Since sine is entire, N(r,∞;sin⁡)=0, so δ(∞,sin⁡)=1 by [F3]. For every finite a, steps 3.1 and 2.4 give N(r,a;sin⁡)T(r,sin⁡)→1 because T(r,sin⁡)=2rπ+O(1) by step 1.3, so δ(a,sin⁡)=1−lim sup⁡rNT=0. For a∉{1,−1} step 3.1 gives N1(r,a;sin⁡)=0, so ε(a,sin⁡)=0, including a=0; and ε(∞,sin⁡)=0 because the N1-count at ∞ vanishes for an entire function; while for a=±1 step 2.4 gives N1(r,a;sin⁡)T(r,sin⁡)→r/π2r/π=12, so ε(1,sin⁡)=ε(−1,sin⁡)=12.

5.1F3F4step 4.1algebra

(Sine: combined defect sum) By step 4.1 the only nonzero terms of the total deficiency sum of [F3] are δ(∞,sin⁡)=1, ε(1,sin⁡)=12 and ε(−1,sin⁡)=12; the supremum of finite subsums is therefore 1+12+12=2, so the combined defect sum of sine equals 2, in agreement with the general upper bound of [F4].

6.1F3F4step 2.1step 2.2algebra∎

(Exponential: combined defect sum) For ez steps 2.1 and 2.2 give the only nonzero terms δ(0,ez)=δ(∞,ez)=1, so its combined defect sum is 2 as well, again with equality in the bound of [F4].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

100 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