MHB Understanding Dominant Matrices for Year 11 Students

  • Thread starter Thread starter Zashmar
  • Start date Start date
  • Tags Tags
    Matrices
Zashmar
Messages
48
Reaction score
0
Can anyone explain to a year 11 student what a dominant matrix is exactly?
my textbook is not making much sense, i understand basic matricies and how you times them and rearange equations.

Thank you so much(Happy)
 
Physics news on Phys.org
Are you referring to diagonal dominance, and if so, is it row or column?
 
Yes diagonally dominant, what does it mean
 
Let's say it is row diagonal dominance.

For the $n$th row, the magnitude of the entry in the $n$th column must be greater than or equal to the sum of the magnitudes of all other entries in that row.

This must be true for all rows. Stated mathematically:

$\displaystyle |a_{ii}|\ge\sum_{j\ne1}|a_{ij}|$ for all $i$.

where $a_{ij}$ denotes the entry in the $i$th row and $j$th column.

Note that this definition uses a weak inequality, and is therefore sometimes called weak diagonal dominance. If a strict inequality (>) is used, this is called strict diagonal dominance. The unqualified term diagonal dominance can mean both strict and weak diagonal dominance, depending on the context.
 
##\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...

Similar threads

Replies
2
Views
2K
Replies
4
Views
4K
Replies
2
Views
941
Replies
11
Views
5K
Back
Top