Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)audited 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.

Exponential omits two sphere values

Example

Assume Countable Choice. The entire function f(z)=ez omits the value 0 and, viewed as a meromorphic map into the Riemann sphere, also omits ∞. Every nonzero finite value a is attained exactly at the simple points b+2πik, k∈Z, where b is any fixed logarithm of a. Thus 0 and ∞ are exactly the two sphere values omitted by f.

Facts & Assumptions

Given: The entire function f(z)=ez; Countable Choice is assumed as in the statement.

[F1]

For every sphere target a, m(r,a;f)+N(r,a;f)=T(r,f)+C(f,a), with C(f,∞)=0 and C(f,a) as in the exact centre-constant form of the First Main Theorem (Nevanlinna’s First Main Theorem with exact centre constant).

[F3]

ker⁡(exp⁡)=2πiZ and ez=ew exactly when z−w∈2πiZ (ker⁡(exp⁡)=2πiZ, and exp⁡z=exp⁡w exactly when z−w∈2πiZ).

[F4]

The complex exponential maps C onto C∖{0} (The complex exponential maps C onto C∖{0}).

Verification

technique · identify the image of the exponential directly and translate the two omitted targets and the attained targets into the counting and proximity terms of the First Main Theorem
1.1F2given

By [F2] the function f is entire, so as a meromorphic sphere map it has no poles: f(z)≠∞ for every z, i.e. f omits ∞; and ∣f(z)∣=eRe⁡z>0, so f omits 0.

1.2F3F4algebra

Let a∈C∖{0} and let b be a logarithm of a, so eb=a by [F4]. For z∈C, by [F3], ez=a holds if and only if ez−b=1, if and only if z−b∈2πiZ, if and only if z=b+2πik for some k∈Z. Hence the preimage of every nonzero finite value is exactly this arithmetic progression in b.

2.1F2step 1.2algebra

At a point z=b+2πik the derivative is f′(z)=ez=a≠0 by [F2] and step 1.2; therefore f−a has a simple zero there, that is, the value a is attained only with multiplicity one.

3.1F1step 1.1step 1.2step 2.1

Combining steps 1.1, 1.2 and 2.1: the two sphere values 0 and ∞ are omitted, and no other sphere value is omitted. In the notation of [F1], for a=0,∞ the counting function N(r,a;f) vanishes identically and the whole characteristic sits in the proximity term, m(r,a;f)=T(r,f)+C(f,a); the corresponding deficiency-one computation is carried out in the companion example on this page devoted to deficiencies of elementary functions.

4.1F1given∎

The argument is choice-free: the only choices made are the fixed logarithm b of a and the integer enumeration of the progression, both of which are data of the example. Countable Choice is carried only because the surrounding Nevanlinna quantities and their exceptional-set interface are stated under it.

Depends on

Used by

Dependency tree · two levels

33 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