Infimum

From Maths
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:
Fleshing out, make sure the caveat is known, proof of claim

Definition

Let (X,) be a poset and let AX 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]:

  1. aA[Inf(A)a] - which states that Inf(A) is a lower bound of A - and
  2. b{xX | (aA[xa])}the set of all lower bounds of A[bInf(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 xX[(aA[xa])x is a lower bound of AxInf(A)]
    • Claim 2: we claim 1 if and only if (A=(xXaA[xInf(A)ax]))

Notice the A= condition here, as in the case A is empty, aA is always false. This is a very big caveat.

See also

Notes

  1. Jump up Which may be written:
    • AP(X) where P(S) denotes the power set of a set S
  2. Jump up Recall that if for a poset (P,) and for p,qP if we have:
    • pq then we may say:
      1. p is majorised by q or
      2. q majorises p

References

  1. Jump up Lattice Theory: Foundation - George Grätzer

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:

  • xXaA[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
  • aA[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:

  • aA

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

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:
Needs fleshing out, INCOMPLETE PAGE
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 AX of a poset (X,)[1]:

  • inf(A)

such that:

  1. aA[inf(A)a] (that inf(A) is a lower bound)
  2. x{yX | aA[ya]}The set of all lower bounds  [inf(A)x] (that inf(A) is an upper bound of all lower bounds of A)
    • Claim 1: , this is the same as xXaA[x>inf(A)a<x][Note 1][Note 2]

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:
Make a subpage and put the proof here

See also

Notes

  1. Jump up This would require A
  2. Jump up Let some xX be given, if xinf(A) we can choose any aA as for implies if the LHS of the isn't true, it matters not if we have the RHS or not.

References

  1. Jump up Lattice Theory: Foundation - George Grätzer