Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
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.

The exterior of a closed disc in the plane is path-connected

Statement

Let c∈C. Then:

  1. for every real R≥0, the open exterior E>:={ z∈C : ∣z−c∣>R } is path-connected, and therefore a connected subset of C; taking R=0, the punctured plane C∖{c} is path-connected;
  2. for every real R>0, the closed exterior E≥:={ z∈C : ∣z−c∣≥R } is path-connected, and therefore a connected subset of C.

Facts & Assumptions

Given: A point c∈C and a real R, with R≥0 in clause 1 and R>0 in clause 2; the plane is read as R2 with its Euclidean metric through C=R[x]/(x2+1) as the Euclidean plane and as a normed real algebra: what the identification preserves. Write E for whichever of the two sets is under discussion.

[L1]

For n≥2 the unit sphere Sn−1⊆Rn is path-connected and connected (For n≥2, the sphere Sn−1 is path-connected and connected).

[L2]

For n≥1 the map ρ(x)=x/∥x∥2 from Rn∖{0} to Sn−1 is continuous (Radial normalisation x↦x/∥x∥2 is continuous on Rn∖{0}).

[L3]

For n≥1, Sn−1=S2(0,1)={x∈Rn:∥x∥2=1} (Euclidean spheres and closed balls as subspaces of Rn).

[L4]

A subset is path-connected when any two of its points are joined by a continuous map from [0,1] whose image lies in it (Paths, path-connected spaces and path components).

[L5]

A path-connected subset of a topological space is a connected subset (Every path-connected space is connected, and every path component lies inside a component).

[L6]

A composite of continuous maps is continuous, and a function whose restrictions to the members of a finite closed cover are continuous is continuous (Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous).

[L7]

B(x,r)={y:d(x,y)<r} (Open ball, closed ball and sphere in a metric space).

[L8]

∣zw∣=∣z∣∣w∣ and ∣z+w∣≤∣z∣+∣w∣ for complex z,w (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive).

Proof

technique · direct
1.1givenL2L3L7

Let z,w∈E and put ρ=max⁡(∣z−c∣,∣w−c∣). In clause 1 this gives ρ≥∣z−c∣>R≥0 and ρ≥∣w−c∣>R, and in clause 2 it gives ρ≥∣z−c∣≥R>0 and ρ≥∣w−c∣≥R; in both cases ρ>0 and z≠c, w≠c, so u=(z−c)/∣z−c∣ and v=(w−c)/∣w−c∣ lie on the unit circle S1 by [L2] and [L3].

1.2L1L4

By [L1] with n=2 there is a continuous σ:[0,1]→S1 with σ(0)=u and σ(1)=v.

2.1step 1.1L6L7L8

The map μ(s)=c+((1−s)∣z−c∣+sρ)u is continuous on [0,1] by [L6], joins z to c+ρu, and satisfies ∣μ(s)−c∣=(1−s)∣z−c∣+sρ by [L8] and ∣u∣=1; that value lies between ∣z−c∣ and ρ, so it exceeds R in clause 1 and is at least R in clause 2, and μ has image in E. The same formula with w and v gives a continuous ν:[0,1]→E joining w to c+ρv.

2.2step 1.1step 1.2L6L7L8

The map s↦c+ρ σ(s) is continuous on [0,1] by [L6], joins c+ρu to c+ρv, and has ∣c+ρσ(s)−c∣=ρ by [L8], which exceeds R in clause 1 and is at least R in clause 2, so its image lies in E.

3.1step 2.1step 2.2L4L5L6∎

Concatenating μ, the path of step 2.2 and the reversal of ν, each on a closed subinterval of [0,1] and agreeing at the two shared endpoints, gives by [L6] a continuous map [0,1]→E from z to w. Since z,w∈E were arbitrary, E is path-connected by [L4], hence a connected subset of C by [L5]; the argument was run for both clauses at once, and at R=0 clause 1 reads C∖{c}.

Depends on

Used by

Dependency tree · two levels

44 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