You need to check EVERY spot for reflexivity, symmetry, and transitivity

Подписаться 413 тыс.

Просмотров 17 тыс.

50% 1

A key detail regarding relations is that in order to be, say, symmetric it isn't enough that there is ONE loop that goes out and then comes right back. You need EVERY connection out to have a corresponding connection back. Ditto for reflexive and transitive.
My thank you to the student who kindly agreed to have this video posted.
►FULL DISCRETE MATH PLAYLIST: • Discrete Math (Full Co...
OTHER COURSE PLAYLISTS:
►CALCULUS I: • Calculus I (Limits, De...
► CALCULUS II: • Calculus II (Integrati...
►MULTIVARIABLE CALCULUS (Calc III): • Calculus III: Multivar...
►VECTOR CALCULUS (Calc IV): • Calculus IV: Vector Ca...
►DIFFERENTIAL EQUATIONS: • How to solve ODEs with...
►LINEAR ALGEBRA: • Linear Algebra (Full C...
OTHER PLAYLISTS:
► Learning Math Series
• 5 Tips To Make Math Pr...
►Cool Math Series:
• Cool Math Series
BECOME A MEMBER:
►Join: / @drtrefor
MATH BOOKS & MERCH I LOVE:
► My Amazon Affiliate Shop: www.amazon.com/shop/treforbazett
SOCIALS:
►Twitter (math based): / treforbazett
►Instagram (photography based): / treforphotography

Опубликовано:

27 окт 2017

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 10

@anuragmarola4257 5 лет назад

i have to finish assignments and found your videos so helpful.. hope i can donate smth to you.

@ramyhuber8392 2 года назад

Thanks much for clarification of previous video, I was wondering about this watching the video intro to Ref, Sym and Trans relations.

@blackthorn5533 6 лет назад

The last example was tricky for sure , but it teaches you to think beyond the obvious :) On point explanations on all of your videos and you helped me out with a lot of questions i had , insta subbing to your channel :)

@Jason-ey2jy Год назад

I know it's not in your curriculum, but how would you describe anti-symmetry in this context? The one topic I can't wrap my head around in my course, is the only one you haven't taught!

@DiegoMathemagician 4 года назад

So if there is a graph where you have only a node and has the reflexive property then it has the symmetric property as well because if a path P is from node A to node A, then the reverse path (inv(P)) would be a path from A to A, and since the original node has a path starting in the node to itself that path is also its reverse and thus, the graph (which had only that node) is symmetric? Or does the node need to have another path from the node to itself in order to have the symmetric property? Thank you for making these videos, I love how you transmit the passion in your entonation

@blindphil 6 месяцев назад

Thank you!

@vaginalarthritis1753 4 года назад

This is awesome. On the topic of the 2nd example being all 3, specifically transitive: The rule was if aRb and bRc then aRc. In the example can we say that since xRx and xRx then xRx? Am I just reiterating what you said or will this thinking run me into trouble down the line?

@vaginalarthritis1753 4 года назад

@@DrTrefor Oh AWESOME! Thanks for clearing that up.