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.
Automorphisms of the upper half-plane are real Mobius maps
Statement
A map is an automorphism of the upper half-plane if and only if
for real numbers with .
Facts & Assumptions
Given: The upper half-plane .
Automorphisms are biholomorphic self-maps in the sense of Conformal equivalence and the automorphism group of a domain.
Every disc automorphism is a rotated Blaschke factor (Every automorphism of the disc is a rotated Blaschke factor).
Every Möbius transformation is a biholomorphism of the Riemann sphere (Every Möbius transformation is a biholomorphism of the Riemann sphere).
A Möbius transformation has the form with (Möbius transformations of the Riemann sphere).
Proof
The Cayley transform is Möbius by [F4], hence biholomorphic by [F3]; the identities and show that maps biholomorphically onto .
Assume . Let with , and define ; this is a real Möbius automorphism of with , so is an automorphism of fixing .
The map is an automorphism of fixing , so [F2] gives for some real . Conjugating back and simplifying with gives , which has real coefficients and determinant ; since also has real coefficients and positive determinant , the composition is a real Möbius map with positive determinant.
Conversely, if with and , then for , so ; its inverse has the same form with real coefficients and positive determinant, so .
Depends on
Used by
Dependency tree · two levels
10 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
- Elias M. Stein and Rami Shakarchi, Complex Analysis, Theorem 2.4 (standard reference, not scraped)
- Lars V. Ahlfors, Complex Analysis, 3rd ed., Ch. 3 §3.5 (standard reference, not scraped)