is anybody good at discrete math?
me
Thanks!!
alright my question is how do you figure out if anything is antisymmetric
thats not very specific
like okay R1 (1,1),(1,2),(2,1),(2,2),(3,4),(4,1),(4,4)
In mathematics, a binary relation R on a set X is antisymmetric if, for all a and b in X if aRb and bRa then a = b,
yeah but how does that explain if this is antisymmetric or not
well first you have to state what the relation is, equality? less than, greater than? division modulo n?
I would say this is not anti-symmetric because you have (3,4) ( 4,1) but 3 does not equal 1
if you delete the point (3,4) then it is anti-symmetric
what about (1,2) and (2,1) and (1,1)
Wait so basically its anti symmetric if no points equal each other like a is not equal 2 b?
1R2 and 2R1 so 1 =1 is true
ohh so in that situation a = b?
and if thats the case then it would be antisymmetric
well the order relation <= is anti-symmetric
so the definition of anti-symmetry generalises what we find in the usual order relation <= . for instance if a<=b and b <= a , then a = b , where a,b are integers and <= means less than or equal (usual ordering). but notice you can have unusual relations, like subset. if A is a subset of B and B is a subset of A, then A = B
i dnt get that sorry this type of math is really confusing it took me 3 weeks to understand sets and now im trying to understand relations bim pretty much behind in class :/
That make sense but how does that apply to that problem
well we try to find in math the most general or abstract definitions. we find definitions that strip the terms of any specific meaning, so we can generalise to many different types of relations.
so we find many 'things' that behave in math just like the ordering <= where 2<= 3 . in advanced math we look for patterns
Yeah thats why im being confused because im so used to specific examples that this abstract way of thinking leaves me lost in the dark
ohhh okay
so how do you define <= . when you define it, you realise that other mathematical objects behave similiar to how 2 <= 3 . for instance {1,2} is a subset of {1,2,3}
Yeah i get that
so you could say {1,2} < {1,2,3} , or you could say <= to indicate that it is not a proper subset
alright
so using our austere definition we have R is antisymmetric if whenever (a,b) is in R and (b,a) is in R, then it must be the case that a = b
OHHHH IGET IT !!!!!!!
lol thanks but hold on lol hold on
lol
right, aRb is the same thing as saying (a,b) is in R. or equivalent
wait but if thats the case where (a,b) element of R and (b,a) an element of R and a = b then isnt that kinda like being symmetric
because (1,2) is symmetric to (2,1)
symmetric is different
how so
R is symmetric when if (a,b) is in R, then (b,a) is in R
thats the same thing i said tho
antisymmetry is different
right, sorry i didnt see what you wrote
yeah but using that.. isnt that the same as antisymmetric
ok so here are some examples one sec , thinking
okay
R = { (1,1) (2,1) (2,1) } is antisymmetric. R= { (1,1) , (1,2) (2,1) } is symmetric
A relation can be both symmetric and antisymmetric
woops
R= { (1,1) ( 1,2) } is anti symetric
a null set would be everything but i dnt get why the first one is antisymmetric
a = 2 right?
and b = 1?
lol careful you are speaking to an open mind at the moment
R= { (1,1) ( 2,1) } is antisyemmetric
The terms 'symmetric' and 'anti-symmetric' apply to a binary relation R: R symmetric means: if aRb then bRa. R anti-symmetric means: if aRb and bRa, then a=b.
okay i get that now because a in the R = {(1,1), (2,1)} is basically 1 and b is 1 as well so a is 1 in the (1,1) and b is 1 in the (2,1) right?
well it satisfies it because it doesnt violate it
it satisfies it trivially, since there is no occurence of both (a,b) and (b,a) in R R = {(1,1), (2,1)}
the antisymmetry is an 'AND' condition. if you have both (a,b) AND (b,a) , then a=b. the symmetry condition is if-then condition
hmm i guess sheesh why is this math so hard i swear who thinks of creating stuff like this
well they are both if then conditions, but the antisymmetry has a little extra in it
okay so symmetry mean something must happen first then something else happen.. its like a program
R is symmetric means: if (a,b) is in R then (b,a) is in R. R anti-symmetric means: if (a,b) and (b,a) is in R, then a=b.
okay so what about this one (3,4) what properties you give this in my eyes i see no reflexive no symmetry no antisymmetry and no transitive
yes its like rules for a checking program , you could program it to check
okay
so just that one point? R = { ( 3,4) } ?
yea
then it is not symmetric, but it is anti-symmetric (trivially)
its in an example in my book i hate that they dnt explain stuff
Yes thats what they said but it makes no sense
it is anti symetric why? do you see, because it is an if then condition
how its only (3,4)
if (a,b) and (b,a) are in R, then a=b. but you dont have (a,b) and (b,a) in R
yea okay you just have (a,b)
because 'if-then' is true when the 'if' part is false
i think thats called trivial or vacuously true. we just say true though :)
are you talking about the logic statement if p is false but q is true then the whole statement ends up being true?
p-> q is true when p is false.
or another way to read the definition... is ,
Program: if you can find two points in your relation (a,b) & (b,a) .... then it must be the case that a = b. else true
or true otherwise
and a specific example would be (3,4) so basically any single point except (1,1) or other any points similar to that are antisymmetric
Program: if you can find two points in your relation (a,b) & (b,a) .... then it must be the case that a = b. (if a does not equal B then your anti-symmetry is false.) otherwise true (if you cant find any two points (a,b) (b,a) )
right , any relation R = { (a,b) } is antisymmetric , trivially , since there is only one point
since you need at least two points to even check the condition
true cool so one answer down for the rest of my life a single point is antisymmetric
lol
well, you have to be more precise. the relation R= { (a,b)} is anti symmetric
and also better say its a binary operation, and 'point' is an element of your relation aRb or (a,b) ordered pair
yeah lol that .. R = { (a,b) }
now, how can we make your original relation antisymmetric. can we delete something
okay i get you
R= { (1,1),(1,2),(2,1),(2,2),(3,4),(4,1),(4,4) } now what are the least amount of points we can delete to make this anti-symmetric its no fair if we delete all but one , lol
lol okay
all try my best
ill*
ask yourself, why does it fail anti-symmetry (clue)
(4,40 and (1,1) and (2,2) and (3,4)
(4,4) i meant
Join our real-time social learning platform and learn together with your friends!