English

For the matrix A = (2,3),(5,7), find (A + A') and verify that it is a symmetric matrix. - Mathematics

Advertisements
Advertisements

Question

For the matrix A = `[(2,3),(5,7)]`, find (A + A') and verify that it is a symmetric matrix.

Sum

Solution

`"A" = [(2,3),(5,7)]`

`"A+A"\prime = [(2,3),(5,7)] + [(2,5),(3,7)] = [(4,8),(8,14)]`

`("A+A"\prime)""^\prime= [(4,8),(8,14)] = ("A+A"\prime)`

Thus, `("A + A"\prime)` is a symmetric matrix.

shaalaa.com
  Is there an error in this question or solution?
2018-2019 (March) 65/4/3

RELATED QUESTIONS

If R=[(x, y) : x+2y=8] is a relation on N, write the range of R.


determination of whether the following relations are reflexive, symmetric, and transitive:

Relation R in the set A = {1, 2, 3, 4, 5, 6} as R = {(x, y): y is divisible by x}


Let A = {1, 2, 3}. Then number of equivalence relations containing (1, 2) is

(A) 1

(B) 2

(C) 3

(D) 4


Let A = {x ∈ Z : 0 ≤ x ≤ 12}. Show that R = {(ab) : a∈ A, |a – b| is divisible by 4}is an equivalence relation. Find the set of all elements related to 1. Also write the equivalence class [2]


Let A be the set of all human beings in a town at a particular time. Determine whether of the following relation is reflexive, symmetric and transitive :

R = {(x, y) : x and y live in the same locality}


Let A = {1, 2, 3}, and let R1 = {(1, 1), (1, 3), (3, 1), (2, 2), (2, 1), (3, 3)}, R2 = {(2, 2), (3, 1), (1, 3)}, R3 = {(1, 3), (3, 3)}. Find whether or not each of the relations R1, R2, R3 on A is (i) reflexive (ii) symmetric (iii) transitive.


Prove that every identity relation on a set is reflexive, but the converse is not necessarily true.


If = {1, 2, 3, 4} define relations on A which have properties of being reflexive, transitive but not symmetric ?


Give an example of a relation which is transitive but neither reflexive nor symmetric?


Let S be a relation on the set R of all real numbers defined by
S = {(a, b) ∈ R × R : a2 + b2 = 1}
Prove that S is not an equivalence relation on R.


Let Z be the set of all integers and Z0 be the set of all non-zero integers. Let a relation R on Z × Z0be defined as (a, b) R (c, d) ⇔ ad = bc for all (a, b), (c, d) ∈ Z × Z0,
Prove that R is an equivalence relation on Z × Z0.


If R and S are transitive relations on a set A, then prove that R ∪ S may not be a transitive relation on A.


Define a reflexive relation ?


R is a relation from {11, 12, 13} to {8, 10, 12} defined by y = x − 3. Then, R−1 is ______________ .


Let R = {(a, a), (b, b), (c, c), (a, b)} be a relation on set A = a, b, c. Then, R is _______________ .


If R is the largest equivalence relation on a set A and S is any relation on A, then _____________ .


 If A = {a, b, c, d}, then a relation R = {(a, b), (b, a), (a, a)} on A is _____________ .


Mark the correct alternative in the following question:

For real numbers x and y, define xRy if `x-y+sqrt2` is an irrational number. Then the relation R is ___________ .


Write the relation in the Roster form and hence find its domain and range:

R2 = `{("a", 1/"a")  "/"  0 < "a" ≤ 5, "a" ∈ "N"}`


Give an example of a map which is neither one-one nor onto


Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as aRb if a is congruent to b ∀ a, b ∈ T. Then R is ______.


Let A = {1, 2, 3}, then the relation R = {(1, 1), (1, 2), (2, 1)} on A is ____________.


Let S = {1, 2, 3, 4, 5} and let A = S x S. Define the relation R on A as follows:
(a, b) R (c, d) iff ad = cb. Then, R is ____________.


Let A = {x : -1 ≤ x ≤ 1} and f : A → A is a function defined by f(x) = x |x| then f is ____________.


Let the relation R in the set A = {x ∈ Z : 0 ≤ x ≤ 12}, given by R = {(a, b) : |a – b| is a multiple of 4}. Then [1], the equivalence class containing 1, is:


Given set A = {a, b, c}. An identity relation in set A is ____________.


On the set N of all natural numbers, define the relation R by a R b, if GCD of a and b is 2. Then, R is


lf A = {x ∈ z+ : x < 10 and x is a multiple of 3 or 4}, where z+ is the set of positive integers, then the total number of symmetric relations on A is ______.


Statement 1: The intersection of two equivalence relations is always an equivalence relation.

Statement 2: The Union of two equivalence relations is always an equivalence relation.

Which one of the following is correct?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×