Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-08-29
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.

Conformal equivalence is an equivalence relation

Statement

Conformal equivalence of complex domains is an equivalence relation: every complex domain U is conformally equivalent to itself; if U is conformally equivalent to V then V is conformally equivalent to U; and if U is conformally equivalent to V and V to W, then U is conformally equivalent to W.

Facts & Assumptions

Given: Complex domains U,V,W, and the conformal-equivalence notion of Conformal equivalence and the automorphism group of a domain.

[F1]

U and V are conformally equivalent when there exists a biholomorphism f:UV. The identity map idU is biholomorphic; the inverse of a biholomorphism is biholomorphic; and the composite of two biholomorphisms UU is biholomorphic (Conformal equivalence and the automorphism group of a domain).

Proof

technique · direct
1.1

Reflexivity: [F1] makes idU biholomorphic, witnessing UU.

F1given
1.2

Symmetry: for biholomorphic f:UV, [F1] makes f1:VU biholomorphic.

F1assume-hyp
1.3

Transitivity: for biholomorphic f:UV, g:VW, [F1] makes gf biholomorphic.

F1assume-hyp
2.1

Steps 1.1-1.3 are the three clauses of an equivalence relation.

step 1.1step 1.2step 1.3

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

2 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