Lower bound

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:
Needs fleshing out, a few references and a terminology section would be good

Definition

Let [ilmath](X,\preceq)[/ilmath] be a poset and let [ilmath]A\in\mathcal{P}(X)[/ilmath] be any subset of [ilmath]X[/ilmath]. An element [ilmath]b\in X[/ilmath] is an lower bound of [ilmath]A[/ilmath] if[1]:

  • [ilmath]\forall a\in A[b\preceq a][/ilmath].

Equivalently, a subset [ilmath]A\in\mathcal{P}(X)[/ilmath] has a lower bound if:

  • [ilmath]\exists b\in X\forall a\in A[b\preceq a][/ilmath] - "if there exists a lower bound."

Terminology


TODO: Things like "bounded below" and such


See also

References

  1. Lattice Theory: Foundation - George Grätzer