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 Poincare distance has the formula and is disc-automorphism invariant
Statement
For , the Poincare distance on the unit disc satisfies
where is the Blaschke factor carrying to . Moreover every disc automorphism preserves this distance.
Facts & Assumptions
Given: The Poincare metric and distance on .
The Poincare length and distance are defined by integrating along piecewise curves (The Poincare metric and distance on the unit disc).
Every Blaschke factor is an automorphism of (Blaschke factors are automorphisms of the disc).
Every automorphism of is a rotated Blaschke factor (Every automorphism of the disc is a rotated Blaschke factor).
Proof
For a Blaschke factor , a direct differentiation gives and . Therefore , so preserves Poincare length of every piecewise curve.
Since length is preserved under , taking infima in [F1] gives . By [F3], every disc automorphism is a composition of a Blaschke factor and a rotation, and rotations satisfy the same identity, so every disc automorphism preserves .
By step 2.1, . Write . If , then , so and both sides are . If , the radial segment from to has Poincare length , so .
For any piecewise curve from to , one has , hence . Taking the infimum over all such curves gives the reverse inequality.
Combining steps 3.1 and 4.1 yields , and step 2.1 gives automorphism invariance.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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
- Jiri Lebl, Guide to Cultivating Complex Analysis, §3.5 (standard reference, not scraped)
- Elias M. Stein and Rami Shakarchi, Complex Analysis, Ch. 8 §2 (standard reference, not scraped)