Least Upper Bound & Greatest Lower Bound
Duration: 7 min
This video lesson is available to enrolled students.
AI Summary
An AI-generated summary of this video lecture.
The video is a lecture on Lattice Theory in Discrete Mathematics. The instructor defines Least Upper Bound (LUB/Join/Supremum) and Greatest Lower Bound (GLB/Meet/Infimum). He uses Hasse diagrams to demonstrate how to find these bounds for various subsets of elements within a partially ordered set. He works through multiple examples, calculating LUB and GLB for sets like {g, f, e, c}, {d, f}, {d, e}, {b, c}, {d, c}, and {b, e}. Finally, he introduces the standard notation for these operations: 'V' for Join and '^' for Meet.
Chapters
0:00 – 2:00 00:00-02:00
The instructor begins the lecture by defining fundamental concepts in lattice theory. The slide displays the title "Least Upper Bound / LUB / Join / Supremum / V" and "Greatest Lower Bound / GLB / Meet / Infimum / ^". He explains that LUB is the "Least value in the upper bound" and GLB is the "Greatest value in the lower bound". He uses a red pen to circle the word "Least" in the title to emphasize the specific nature of the bound being sought. He also underlines the terms "Upper Bound" and "Lower Bound" to distinguish the two main concepts being discussed in this session.
2:00 – 5:00 02:00-05:00
The instructor moves to a practical demonstration using a Hasse diagram drawn on a blue background. A table on the right side of the screen lists "Elements" and their corresponding bounds. He analyzes the subset B = {g, f, e, c}, identifying the Upper Bound as {i} and the Least Upper Bound as 'i'. For the Lower Bound, he finds {a, e}, making the Greatest Lower Bound 'e'. He then analyzes B = {d, f}, finding the Upper Bound set {i, g, h, f} and the Least Upper Bound 'f'. For the Lower Bound {a, d}, the Greatest Lower Bound is 'd'. He then switches to a different diagram for B = {d, e}, noting that the Upper Bound is empty (represented by phi) and the Greatest Lower Bound is 'c'. He continues with B = {b, c}, finding the Upper Bound {d, e, f} with LUB 'f' and Lower Bound {a} with GLB 'a'. He also analyzes B = {d, c}, finding LUB 'd' and GLB 'c', and B = {b, e}, finding LUB 'f' and GLB 'a'.
5:00 – 6:35 05:00-06:35
In the final segment, the instructor focuses on the algebraic notation for these operations. He writes "a V b" on the white space to represent the Join operation, which corresponds to the Least Upper Bound. He then writes "a ^ b" to represent the Meet operation, corresponding to the Greatest Lower Bound. He emphasizes the symbols V and ^ as the standard mathematical notation used in lattice theory. This notation simplifies the expression of these complex relationships between elements in a partially ordered set, providing a concise way to write LUB(a, b) as a V b and GLB(a, b) as a ^ b. The instructor ensures that students understand the visual representation of these symbols in the context of the diagrams.
The lecture progresses from theoretical definitions to practical application. It starts by defining LUB and GLB with their alternative names (Join/Supremum and Meet/Infimum). The instructor then systematically solves problems using Hasse diagrams, filling out a table to find bounds for different subsets. This practical application solidifies the definitions. Finally, the lesson concludes by formalizing the notation with the symbols V and ^, providing students with the standard algebraic representation for these lattice operations. The video effectively bridges the gap between abstract definitions and concrete calculation methods, ensuring students understand both the conceptual and computational aspects of lattice theory.