TheoremStatement: 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.

Great Picard theorem

Statement

Let $f$ be holomorphic on a punctured disc $0 < ∣ z - a ∣ < R$ and suppose $a$ is an essential singularity of $f$ . With at most one finite exception, every value in $C$ is assumed infinitely often in every punctured neighborhood of $a$ .

Facts & Assumptions

Given: A holomorphic function on $0 < ∣ z - a ∣ < R$ with an essential singularity at $a$ .

[L1]

If a punctured-disc holomorphic function omits two distinct finite values, then the singularity is removable or a pole (Two omitted finite values rule out an essential singularity).

Proof

technique · direct

1.1

Suppose two distinct finite values $w_{1}, w_{2}$ each failed to occur infinitely often in some punctured neighborhood of $a$ . After passing to the smaller of those neighborhoods, each equation $f (z) = w_{j}$ would have only finitely many solutions there. Shrink once more past all those finitely many points. The resulting punctured disc omits both $w_{1}$ and $w_{2}$ , so [L1] would make the singularity removable or a pole, contradicting the hypothesis that it is essential.

L1givenassume-contradischarge-contradiction

2.1

Step 1.1 shows that at most one finite value can fail the asserted infinitely-often property. Every other finite value is therefore assumed infinitely often in every punctured neighborhood of $a$ .

step 1.1algebra

3.1

This is exactly the Great Picard conclusion for finite values.

step 2.1∎

Depends on

Two omitted finite values rule out an essential singularity

Used by

Dependency tree · two levels

8 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

Aleksander Simonic, The Ahlfors lemma and Picard's theorems, §6.4 (standard reference, not scraped)