This post has been de-listed
It is no longer included in search results and normal feeds (front page, hot posts, subreddit posts, etc). It remains visible only via the author's post history.
1
Triangle Inequality of Distances between sets
Post Flair (click to view more posts with a particular flair)
Post Body
consider two sets A, B subset of metric space X are non-empty and bounded. define distance function between this two set as D(A, B) = sup { d(a, b) : a ∈ A , b ∈ B}. now how to proof triangle inequality: D(A, B) <= D(A, C) D(C, B)?
Author
Account Strength
90%
Account Age
5 years
Verified Email
Yes
Verified Flair
No
Total Karma
4
Link Karma
1
Comment Karma
3
Profile updated: 4 days ago
Subreddit
Post Details
We try to extract some basic information from the post title. This is not
always successful or accurate, please use your best judgement and compare
these values to the post title and body for confirmation.
- Posted
- 7 months ago
- Reddit URL
- View post on reddit.com
- External URL
- reddit.com/r/askmath/com...