Infimum
From Maths
(Unknown grade)
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:
Needs fleshing out, INCOMPLETE PAGE
- A closely related concept is the supremum, which is the smallest upper bound rather than the greatest lower bound.
Contents
[hide]Definition
An infimum or greatest lower bound (AKA: g.l.b) of a subset A⊆X of a poset (X,⪯)[1]:
- inf(A)
such that:
- ∀a∈A[inf(A)≤a] (that inf(A) is a lower bound)
- ∀x∈{y∈X | ∀a∈A[y≤a]}⏟The set of all lower bounds [inf(A)≥x] (that inf(A) is an upper bound of all lower bounds of A)
Proof of claims
(Unknown grade)
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:
The message provided is:
Make a subpage and put the proof here
See also
Notes
- Jump up ↑ This would require A≠∅
- Jump up ↑ Let some x∈X be given, if x≤inf(A) we can choose any a∈A as for implies if the LHS of the ⟹ isn't true, it matters not if we have the RHS or not.
References
|