Hilbert metric
Builds on Convex setEuclidean distanceMetric space
Definition
Let and let be a bounded open convex set. Write for the Euclidean distance of points and . Let be distinct. The line through and meets the boundary of in exactly two points and . Name them so that lie on the line in this order. The Hilbert metric on is with .
Remarks
The map is a metric on ; the triangle inequality uses the convexity of .
Example: let and . For the boundary points are and , so , which tends to as .
Non-example: the open half-plane is convex but not bounded. A horizontal line in it does not meet the boundary at all, so the formula has no meaning.
Some authors omit the factor . When is the open unit ball, is the hyperbolic distance of the Beltrami–Klein model.
Reading path
To understand this page from the ground up, read these 18 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Convex set concept
- Element definition
- Euclidean distance concept
- Proposition concept
- Real numbers object
- Set definition
- Implication definition
- Predicate definition
- Ordered pair definition
- Existential quantifier definition
- Universal quantifier definition
- Cartesian product definition
- Subset definition
- Uniqueness quantifier definition
- Binary relation definition
- Function definition
- Metric space definition
- Hilbert metric definition
Further reading
About this page
| Tag | HDD0EB48AB |
|---|---|
| URI | m2://HDD0EB48AB |
| Kind | definition |
| Writing | W0 stub |
| MSC | 51F99, 52A20, 53C60 |
| Defines | Hilbert metric |
| Uses | Convex set, Euclidean distance, Metric space |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.