OnlineWoerterBuecher.de
Internes

Lexikon


greatest lower bound


(glb, meet, infimum) The greatest lower bound of two elements, a and b is an element c such that c <= a and c <= b and if there is any other lower bound c' then c' <= c. The greatest lower bound of a set S is the greatest element b such that for all s in S, b <= s. The glb of mutually comparable elements is their minimum but in the presence of incomparable elements, if the glb exists, it will be some other element less than all of them. glb is the dual to least upper bound. (In LaTeX "<=" is written as sqsubseteq, the glb of two elements a and b is written as a sqcap b and the glb of set S as igsqcap S). (1995-02-03)

In addition suitable contents:
[ 2 ] [ = ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ be ] [ ig ] [ bo ] [ bs ] [ ca ] [ ch ] [ co ] [ com ] [ du ] [ dual ] [ ee ] [ element ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ fo ] [ for ] [ gl ] [ gr ] [ gs ] [ h ] [ hat ] [ hr ] [ id ] [ il ] [ in ] [ inc ] [ incomparable ] [ infimum ] [ ir ] [ is ] [ it ] [ LaTeX ] [ lb ] [ least upper bound ] [ less than ] [ Lex ] [ ly ] [ mo ] [ mod ] [ module ] [ mp ] [ mu ] [ na ] [ nc ] [ nf ] [ ni ] [ om ] [ pa ] [ pe ] [ ph ] [ pr ] [ query ] [ rc ] [ re ] [ S ] [ se ] [ set ] [ so ] [ sqcap ] [ sqsubseteq ] [ st ] [ su ] [ subseteq ] [ T ] [ test ] [ th ] [ theory ] [ to ] [ tt ] [ tw ] [ ua ] [ um ] [ up ] [ upper bound ] [ X ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2912 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.072 Seconds, with 16 Database-Queries
Zurück zur Startseite