Infimum
Contents
[hide]Definition
Let (X,⪯) be a poset and let A⊆X be any subset of X[Note 1]. The infimum (AKA: greatest lower bound, g.l.b) of A is an element of X, written Inf(A) that satisfies the following two conditions[1]:
- ∀a∈A[Inf(A)⪯a] - which states that Inf(A) is a lower bound of A - and
- ∀b∈{x∈X | (∀a∈A[x⪯a])}⏟the set of all lower bounds of A[b⪯Inf(A)] - which states that for all lower bounds of A, that lower bound "is majorised by"[Note 2] Inf(A)
- Claim 1: we have part 2 of the definition if and only if ∀x∈X[(∀a∈A[x⪯a])⏟x is a lower bound of A⟹x⪯Inf(A)]
- Claim 2: we claim 1 if and only if (A=∅∨(∀x∈X∃a∈A[x≻Inf(A)⟹a≺x]))
Notice the A=∅ condition here, as in the case A is empty, ∃a∈A is always false. This is a very big caveat.
See also
Notes
- Jump up ↑ Which may be written:
- Jump up ↑ Recall that if for a poset (P,⪯) and for p,q∈P if we have:
- p⪯q then we may say:
- p is majorised by q or
- q majorises p
- p⪯q then we may say:
References
|
OLD PAGE
- Caution:Rather than trying to fix the old page (which was written with an erroneous claim) I shall instead re-write it and make the caveat known
I got this slightly wrong initially, I was taught that an infimum is the greatest lower bound, that would mean that Inf(A) was a lower bound such that any value greater than Inf(A) would fail to be a lower bound (thus Inf(A) is the greatest one, as any bigger fail to be). This leads to the formulation of Inf(A) as:
- ∀x∈X∃a∈A[x>inf(A)⟹a<x] (If you pick a value greater than the inf, there exists an element in A less than what you picked) and
- ∀a∈A[inf(A)≤a] (the inf is actually a lower bound)
However there is a problem, the book I was reading speaks about Inf(∅), if A:=∅ then the expression:
- ∃a∈A
cannot be true (there does not exist anything in A at all! Let alone something that satisfies the rest of the statement!).
I must make this caveat very clear in the new version
OLD PAGE START
- A closely related concept is the supremum, which is the smallest upper bound rather than the greatest lower bound.
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
The message provided is:
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
|