Equivalent conditions to a set being bounded

From Maths
Revision as of 23:45, 29 October 2016 by Alec (Talk | contribs) (Created page with "{{Stub page|grade=A|msg=Created to document, textbook stub}} __TOC__ ==Statement== {{/Statement}} ==Proof of claims== {{begin Inline Theorem}} /1 implies 2|{{...")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search
Stub grade: A
This page is a stub
This page is a stub, so it contains little or minimal information and is on a to-do list for being expanded.The message provided is:
Created to document, textbook stub

Statement

Let [ilmath](X,d)[/ilmath] be a metric space and let [ilmath]A\in\mathcal{P}(X)[/ilmath] be an arbitrary subset of [ilmath]X[/ilmath]. Then the following are all logical equivalent to each other[Note 1]:

  1. [ilmath]\exists C<\infty\ \forall a,b\in A[d(a,b)<C][/ilmath] - [ilmath]A[/ilmath] is bounded (the definition)
  2. [ilmath]\forall x\in X\exists C<\infty\forall a\in A[d(a,x)<C][/ilmath][1]

Proof of claims

[ilmath]1\implies 2)[/ilmath] [ilmath]\big(\exists C<\infty\ \forall a,b\in A[d(a,b)<C]\big)\implies\big(\forall x\in X\exists C<\infty\forall a\in A[d(a,x)<C]\big)[/ilmath], that boundedness implies condition 2


Grade: C
This page requires one or more proofs to be filled in, it is on a to-do list for being expanded with them.
Please note that this does not mean the content is unreliable. Unless there are any caveats mentioned below the statement comes from a reliable source. As always, Warnings and limitations will be clearly shown and possibly highlighted if very important (see template:Caution et al).
The message provided is:
Easy and routine proof. If stuck see page 13 in Functional Analysis, Dzung Minh Ha

This proof has been marked as an page requiring an easy proof

[ilmath]2\implies 1)[/ilmath] [ilmath]\big(\forall x\in X\exists C<\infty\forall a\in A[d(a,x)<C]\big)\implies \big(\exists C<\infty\ \forall a,b\in A[d(a,b)<C]\big)[/ilmath], that condition 2 implies boundedness


Grade: C
This page requires one or more proofs to be filled in, it is on a to-do list for being expanded with them.
Please note that this does not mean the content is unreliable. Unless there are any caveats mentioned below the statement comes from a reliable source. As always, Warnings and limitations will be clearly shown and possibly highlighted if very important (see template:Caution et al).
The message provided is:
Easy and routine proof. If stuck see page 13 in Functional Analysis, Dzung Minh Ha

This proof has been marked as an page requiring an easy proof

Notes

  1. Just in case the reader isn't sure what this means, if [ilmath]A[/ilmath] and [ilmath]B[/ilmath] are logically equivalent then:
    • [ilmath]A\iff B[/ilmath]. In words "[ilmath]A[/ilmath] if and only if [ilmath]B[/ilmath]"

References

  1. Functional Analysis - Volume 1: A gentle introduction - Dzung Minh Ha