Lattice
HTML-код
- Опубликовано: 7 сен 2024
- Discrete Mathematics: Lattice
Topics discussed:
1) The definition of Lattice.
2) Identifying if the given Hasse Diagram is a Lattice.
3) Identifying if the given Poset is a Lattice.
Follow Neso Academy on Instagram: @nesoacademy(bit.ly/2XP63OE)
Follow me on Instagram: @jaspreetedu(bit.ly/2YX26E5)
Contribute: www.nesoacadem...
Memberships: bit.ly/2U7YSPI
Books: www.nesoacadem...
Website ► www.nesoacadem...
Forum ► forum.nesoacad...
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
#DiscreteMathematicsByNeso #DiscreteMaths #PartialOrdering #HasseDiagram
all videos are arranged so well in a proper sequence
Fantastic videos. These videos are alone going to help me pass maths this semester.
Thank you so much. Your one lecture clears all my doubts about the lattice topic
Loved the explanation, you helped me a lot. Thx!
wouldn't b GLB(f,g) = e?
Yes true..
@@adityanprakash1281 not at all
Same doubt
i figured it out, the elements that can be GLB in (f,g) are e and b. Since you cannnot determine whether e is greater than b or b is greater than e due to the lack of relationship between e and b, there is no GLB. The same logic applies to determine the GLB and LUB of other pair of elements.
@@barlog6679 thank you for pointing out my same question and also for giving the answer of it. That is something that i didn't know.
Thank you❤❤ neso academy, I grateful to for my sessional exams
Hi five bro 🤜
Thank you, it was easy to understand and you set the previous knowledge requirements from the start.
Well explained,with more examples,there is no doubt n understand
FYI, you don't call the symbol for the empty set "phi". Phi is a greek letter that looks a little similar to the symbol for the empty set, but mathematicians are not using the greek letter phi in this case, it is just it's own symbol that denotes the empty set.
Yeah that was surprising for such a well-presented and informative video to make this error
@@AkamiChannel Perhaps not super-surprising? It's possible to be knowledgable in a field without having heard the terms of the field spoken in _english_.
Please list the related playlist in the video description as well, it makes it much easier to navigate.
Thank u so much sir.....all videos are in proper sequences
From figure (a)
Consider the incomparable pair (d,g)
GLB(d,g)=f
LUB(d,g)=¢( null set)
So, this is not lattice.
I have doubt .. please clarify that.
Lub of d and g is g
You are a life saviour sir🔥💯💥
Thankyou sir you rescued me a day before exam 😊😅
sir your voice so soothing ..after hearing that it makes maths a very easy subject. thank u for ur hardwork.
thanks a lot sir..Your videos are so easy to understand and organised...
This video is absolutely amazing!
thank u so muchhhh very helpfullll!!!!!!!
thanks man,apppreciate your work
Hello, at 7:25 can we say that the lower bounds of (f,g) are b,e,c,a but since b and e are not comparable -> No upper bound ?
yes
Upper bound of (f,g) is h. There is no lower bound for (f,g). You should have written "No Lower Bound".
@@rajeshprajapati6662hey y e can't be considered as GLB?
Please could you explain...
this guy is an amazing teacher omg
i will pass because of you. god bless you!
This is somewhere excellence is found!
GLB(f,g) for all pair isn't defined, thus the set is empty. since the two preceding lower bounds are incomparable, we can't define greatest lower bound.
bhai tu IIT ka hai?
fantastic explanation
6:12, example 2 (a), what is the GLB and LUB of pair (d and g)?
GLB d and LUB g
@@enes5345
couldn't be like this?
GLB is f
LUB is ø
how GLB is d when they first meet in f?
8:45 example 3 was the same as in my notebook
Very well explanation Sir !!
It’s really helpful
Excellent method..❤
Amazing !🎉🎉🎉🎉
Please add python and Dynamic programming courses too
at 8:15 in example(c) why didn't you consider (b,c) as incomparable????
You can consider it and you will find that unrelated pair (b,c) has GLB = a and LUB = g.
sir in example (b) isnt GLB of f and g is a? By following the path downwards we can find a lowerbound
Lower bound of (f,g) - abce
Let's check for GLB :
a - All elements of LB related to a ? No [Using Hasse Diagram]
b - All elements of LB related to b ? No [Using Hasse Diagram]
c - All elements of LB related to c ? Obviously No [Using Hasse Diagram]
e - All elements of LB related to e ? Obviously No [Using Hasse Diagram]
So, GLB = Phi
thanks man!@@rajeshprajapati6662
Very helpfull
Thanks so much
Nice explanation
In fig (c) why don't you consider f,e and d,c as incomparable pairs ?
what does the "rank" of a lattice mean? what's a "rank-1" lattice?
nice expalined properly
You're a legend
Way better than nptel
great video sir
Good morning every one
Thku
At 6:17 why don't we consider (g, d) to check either they have glb and lup
because d is related to g through transitive property
Sir ji direct product of lattice explain videos
Can someone please explain what do we mean by 'incomparable elements '.
It means if neither aRb nor bRa..
Love🎉
Wow 😲
Doesn't 3 also divide 12?
b,c ???
კიუელები გამოჩნდით xd
Wtf?
In fig (c) why don't you consider f,e and d,c as incomparable pairs ?
Thank you 😃