MHB Vector Spaces: Explained (2x2 Matrices)

das1
Messages
40
Reaction score
0
Can someone explain this to me? Thanks!

The component in the ith row and jth column of a matrix can be
labeled m(i,j).
In this sense a matrix is a function of a pair of integers.
For what set S is the set of 2 × 2 matrices the same as the set Rs ?

Generalize to other size matrices.
 
Physics news on Phys.org
Well a 2x2 matrix has 4 numbers you need to specify.

How many (real) numbers to you need to specify in $\Bbb R^n$?

What they are trying to get you to see, is that a vector $(v_j) \in \Bbb R^n$ can be thought of as a function:

$f: \{1,2,\dots,n\} \to \Bbb R$, with:

$f(j) = v_j$.

For example, we can identify the vector $(1,3,-2) \in \Bbb R^3$ with the function:

$1 \mapsto 1$
$2 \mapsto 3$
$3 \mapsto -2$

the "order" of the coordinates is determined by the "natural" order of the natural numbers 1,2,3.

It may help to recall that the number of pairs from two finite sets $S,T$ is:

$|S \times T| = |S|\ast |T|$.

With $S = \{1,2\} = T$, this gives 4 pairs:

(1,1),(1,2),(2,1),(2,2)---the same number of possible "indices" of a 2x2 matrix.

EDIT: the set $S$ this problem is looking for might be "any" set with the proper cardinality (size). However, for finite sets, it is common to use for a set of cardinality $k$, the set $\{1,2,\dots,k\}$, which certainly has $k$ elements, because there is a "natural" way to describe:

1st element, 2nd element, etc. for this set.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top