Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24
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 Hawaiian earring retracts onto each of its circles

Example

For every n≥1, the Hawaiian earring admits a retraction onto its circle Cn.

Facts & Assumptions

Given: The Hawaiian earring H=⋃m≥1Cm and a fixed integer n≥1.

[F1]

For every integer m≥1, Cm is the circle of radius 1/m centred at (1/m,0), and H=⋃m≥1Cm (The Hawaiian earring is compact and path-connected).

[F2]

A continuous map r:X→A that restricts to the identity on A is a retraction (Retractions and deformation retracts, with a deformation retraction required to fix the retract pointwise).

[L2]

For every real ε>0 there is an integer N≥1 with 1/N<ε (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε).

[L3]

The Euclidean norm satisfies the reverse triangle inequality ∣∥u∥2−∥v∥2∣≤∥u−v∥2 (The finite and reverse triangle inequalities for a norm; and for n≥1 every norm N on Rn satisfies N(x)≤C∥x∥1 and is Lipschitz, hence continuous, for d2).

Verification

technique · constructive
1.1givenF1constructalgebra

Define rn:H→Cn by rn(x)=x for x∈Cn and rn(x)=0 for x∈Cm with m≠n. Distinct circles meet only at 0: subtracting their equations x12+x22=2x1/m and x12+x22=2x1/k gives x1=x2=0. Thus the clauses agree and define a function.

2.1step 1.1F1L2L3algebra

Let x∈Cm∖{0} and put d=∥x∥2>0. By [L2], choose N with 2/N<d/2; then every Ck with k≥N lies in B(0,d/2) and is disjoint from B(x,d/2). For each of the finitely many k<N with k≠m, the positive number ∣∥x−(1/k,0)∥2−1/k∣ and [L3] give a ball about x missing Ck; intersect these finitely many balls with B(x,d/2). The resulting relative neighbourhood in H meets only Cm, so there rn is the identity when m=n and the constant map 0 when m≠n.

3.1step 1.1step 2.1F3L1

Let V⊆Cn be open and let x∈rn−1[V]. If x≠0 and x∈Cm, step 2.1 gives a relative open neighbourhood N of x meeting only Cm. When m=n, write V=O∩Cn by [F3] and replace N by N∩O; the identity clause of rn then maps it into V. When m≠n, one has rn(x)=0∈V and the constant clause maps all of N into V. If x=0, then 0∈V; write V=O∩Cn and choose an ambient open neighbourhood W of 0 with W⊆O. Every point of W∩Cn is fixed and every point of W∩Cm for m≠n maps to 0, so W∩H⊆rn−1[V]. Thus every point of rn−1[V] has a relative open neighbourhood inside it, making that preimage open. The criterion [L1] now shows that rn is continuous.

4.1step 3.1F2discharge-construct∎

The continuous map rn restricts to the identity on Cn, so it is a retraction of H onto Cn.

Depends on

Used by

Dependency tree · two levels

49 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