In discrete mathematics, the definition of binary relation on set (a, B, c) and why it is transitive relation is related to their relation It doesn't match, it doesn't match the symmetry

To understand the definition of transitive relationship:
If and, then
If there is no relation and, then it is not necessary to consider whether it is in the binary relation
The same is true of symmetry
So the binary relation is symmetric and transitive
The binary relation {,} is not symmetric but satisfies transitivity
If you have any questions, please let me know

RELATED INFORMATIONS

1. How is the binary relation calculated? R1={(a,b),(c,d)},R2={(b,c),(d,e)} So R1 * R2 = {(a, c)}, R2 * R1 = {(B, d)} What do I think, R1 * R2 = {(a, c), (C, e)}, Because (a, b) (B, c) can get (a, c) (C, d) (D, e) can get (C, e)
2. Discrete mathematics problem, let R be a binary relation on a, define s = {(a, b) | &; C ∈ a, (a, c) ∈ R, (C, b) ∈ r}, prove Let R be a binary relation on a, define s = {(a, b) | &; C ∈ a, (a, c) ∈ R, (C, b) ∈ r}, prove that if R is an equivalence relation on a, then s is also an equivalence relation, and S = R It's OK to connect~
3. Matrix graphic transformation Let me ask a more professional question: when using matrix multiplication method to carry out graphic transformation, the order of each transformation matrix cannot be adjusted. However, how can I know which matrix is in the front and which matrix is in the back?
4. Why is the matrix representing the transformation always placed on the left side of the transformed matrix in matrix multiplication
5. What is the row exchange of a matrix?
6. Matrix transformation What matrix is used to change y = x2-1 into y = | x2-1 | is it necessary to segment
7. After the elementary transformation of matrix, is the original matrix equal to the transformed matrix? Why are they equal? Take R1 * 999 1 0 0 0 0 5 2 8 0 2 3 4 So a11 is 999,
8. Example: R is a reflexive relation on the set X. it is proved that R is symmetric and transitive if and only if There is a difference between a, b > and in R Example: let R 1 and R 2 be two equivalence relations in set a, and R 1, R 2 = R 2, R 1, R 2 is also the equivalence relation on a Proof: 1) reflexivity (omitted) 2) Symmetry (omitted) 3) Transitivity: If, then And, so, so And then by and by transmission, we get, Again by knowing, so, so, again by and is transmitted, get, and so Example: let R be a reflexive transitive binary relation on set a, and let t also be a binary relation on set a, and satisfy the following conditions: . prove: t is the equivalent relation on a
9. Let G be a simple connected graph with n nodes and N edges, and there are nodes with degree 3 in G. it is proved that there is at least one node with degree 1 in G
10. What is the meaning of 316 stainless steel belt?
11. Transitive relationship If the relation R is transitive on X, why is it arbitrary, What about ror? Please prove, I saw a question: Let R be a binary relation on set X, and prove that R is a transitive relation on X if and only if ror belongs to R. I see that the answer proves its necessity in one step: "if the relation R is a transitive relation on X, for any, "Ror", I just want to ask how this sentence is deduced,
12. Judgment of reflexive antisymmetric transitivity X = {1,2,3,4}. If r = {(1,1) (2,3) (2,4) (3,4)} on X, then r has () A: Reflexivity B: anti reflexivity C: symmetry D: transitivity
13. Transitivity R1 = {(a, b), (B, c), (a, c)}, R1 is transitive, and R2 = {(a, b), (B, c), (a, c), (C, a)} is this transitive? That is, there can be no redundant ordered pairs that can be reused?
14. The problem of set transitivity in discrete mathematics Let a = {a, B, C}, then the above relation R={,,,} S = {} is transitive Why are R and s transitive? Can r be understood as not meeting all the delivery possibilities?
15. Draw a simple graph with four vertices Be sure to draw a picture
16. How to deduce the discrete mathematics P → (P → q) P → q? And what is the value of P ∨ P, P ∧ p
17. On Discrete Mathematics p - > (Q - > P) The original question is like this Non p - > (P - > q) P - > (Q - > P) How is it proved?
18. What does P mean if and only if Q in discrete mathematics
19. On the problem of graph It is known that: "in a graph of order n, if there is a path from vertex u to vertex v (U is not equal to V), then there must be a primary path from u to V, and the length of the path is less than n-1." and "in a graph of order n, the length of any primary circuit is not greater than n." my question is: the primary path includes the primary circuit, so why is the length of any primary circuit not greater than N, rather than n-1 in a graph of order n?
20. Discrete mathematics problem map urgent! What is the difference between the complement of a subgraph relative to the original graph and the complement of a complete graph?