0
Some relations are, some are not.
Wiki User
∙ 13y ago
Add your answer:
Earn +20 pts
Does the relation is perpendicular to have a reflexive property?
No, equality of numbers has a reflexive property. Perpendicularity of lines has a symmetric property.
When can you say that a relation is reflexive property?
A statement that undergoes the reflexive property is a statement that is turned backwards. Ex. Original- If an animal is a frog, it is an amphibian. Reflexive- If an animal is an amphibian, it is a frog.
What is the formula of reflexive relation?
Call the relation R. Also, x R y means (x, y) is in R. (For an idea of how that works, in the set called <, the first element of each ordered pair is always smaller than the second.) Now, a relation is reflexive if, for all x in the domain of R, x R x. That is, (x, x) is in R. A few examples are =, ≤, | (or, "is divisible by"), and the ever familiar, "plus some integer equals."
which correctly completes the flow proof?
(1) transitive, (2) reflexive
What is the definition of reflexive property of equality?
The reflexive property simply says that A=A, in other words, any number is equal to itself.
Give an example to a relation which is reflexive symmetric but not transitive?
A=r mod z R= a relation which is reflexive symmetric but not transitive
Does the relation is perpendicular to have a reflexive property?
No, equality of numbers has a reflexive property. Perpendicularity of lines has a symmetric property.
Is the divides relation on the set of positive integers is reflexive?
No, it is not.
What does irreflexive mean?
A relation that is irreflexive, or anti-reflexive, is a binary relation on a set where no element is related to itself.
When can you say that a relation is reflexive property?
A statement that undergoes the reflexive property is a statement that is turned backwards. Ex. Original- If an animal is a frog, it is an amphibian. Reflexive- If an animal is an amphibian, it is a frog.
Example of sets having both reflexive and irreflexive relation?
when x is not an element of the set, it is both reflexive and irreflexive by vacuos truth
For each part give a relation that satisfies the condition a Reflexive and symmetric but not transitive b Reflexive and transitive but not symmetric c Symmetric and transitive but not reflexive?
No. Do your own homework. http://docs.google.com/gview?a=v&q=cache:ZZmsH0jKHH8J:www.cs.utk.edu/~horton/hw1.pdf+For+each+part+give+a+relation+that+satisfies+the+condition+a+Reflexive+and+symmetric+but+not+transitive+b+Reflexive+and+transitive+but+not+symmetric+c+Symmetric+and+transitive+but+not+reflexive%3F&hl=en&gl=us&sig=AFQjCNHGyc1EDhfqj_mu-RV9yTYZZfXl6A
What is the total number of reflexive and symmetric relations on a set containing n elements?
the total no of reflexive relation on an n- element set is 2^(n^2-n).
What do you mean by equivalence relation Give atleast two examples of equivalence relation?
An relation is equivalent if and only if it is symmetric, reflexive and transitive. That is, if a ~ b and b ~a, if a ~ a, and if a ~ b, and b ~ c, then a ~ c.
What is the largest equivalence relation on a set A?
An equivalence relation on a set is one that is transitive, reflexive and symmetric. Given a set A with n elements, the largest equivalence relation is AXA since it has n2 elements. Given any element a of the set, the smallest equivalence relation is (a,a) which has n elements.
A c program to find an entered relation is equivalence relation or not?
void reflexive(int a[], int sizeOfA, int b[], int sizeOfB) { bool hold = true; for(i = 0; i < sizeOfA && hold; ++i ) { for( int j = 0; j < sizeOfB && hold; ++j ) { int elemA = a[i]; int elemB = b[i]; if(a[i] == b[i]) { hold = true; break; } } if(hold == false) { cout << "Reflexive - No" << endl; break; } } if(hold == true) cout << "Reflexive - Yes" << endl; }
What is the formula of reflexive relation?
Call the relation R. Also, x R y means (x, y) is in R. (For an idea of how that works, in the set called <, the first element of each ordered pair is always smaller than the second.) Now, a relation is reflexive if, for all x in the domain of R, x R x. That is, (x, x) is in R. A few examples are =, ≤, | (or, "is divisible by"), and the ever familiar, "plus some integer equals."
