Difference between revisions of "Infimum"

From Maths
Jump to: navigation, search
m
m
Line 1: Line 1:
{{Stub page|Needs fleshing out, INCOMPLETE PAGE}}
+
{{Stub page|Needs fleshing out, INCOMPLETE PAGE|grade=A}}
 
: A closely related concept is the [[supremum]], which is the smallest upper bound rather than the greatest lower bound.
 
: A closely related concept is the [[supremum]], which is the smallest upper bound rather than the greatest lower bound.
 
==Definition==
 
==Definition==

Revision as of 21:27, 19 April 2016

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 [ilmath]A\subseteq X[/ilmath] of a poset [ilmath](X,\preceq)[/ilmath][1]:

  • [ilmath]\text{inf}(A)[/ilmath]

such that:

  1. [ilmath]\forall a\in A[\text{inf}(A)\le a][/ilmath] (that [ilmath]\text{inf}(A)[/ilmath] is a lower bound)
  2. [ilmath]\forall x\in\underbrace{\{y\in X\ \vert\ \forall a\in A[y\le a]\} }_{\text{The set of all lower bounds} }\ \ [\text{inf}(A)\ge x][/ilmath] (that [ilmath]\text{inf}(A)[/ilmath] is an upper bound of all lower bounds of [ilmath]A[/ilmath])
    • Claim 1: , this is the same as [ilmath]\forall x\in X\exists a\in A[x>\text{inf}(A)\implies a<x][/ilmath][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. This would require [ilmath]A\ne\emptyset[/ilmath]
  2. Let some [ilmath]x\in X[/ilmath] be given, if [ilmath]x\le\text{inf}(A)[/ilmath] we can choose any [ilmath]a\in A[/ilmath] as for implies if the LHS of the [ilmath]\implies[/ilmath] isn't true, it matters not if we have the RHS or not.

References

  1. Lattice Theory: Foundation - George Grätzer