MHB Finite Dimensional Division Algebras - Bresar Lemma 1.1

  • Thread starter Thread starter Math Amateur
  • Start date Start date
  • Tags Tags
    Division Finite
Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am reading Matej Bresar's book, "Introduction to Noncommutative Algebra" and am currently focussed on Chapter 1: Finite Dimensional Division Algebras ... ...

I need help with the an aspect of the proof of Lemma 1.1 ... ...

Lemma 1.1 reads as follows:
View attachment 6192

In the above text, at the start of the proof of Lemma 1.1, Bresar writes the following:" ... ... Since the dimension of $$D$$ is $$n$$, the elements $$1, x, \ ... \ ... \ , x^n$$ are linearly dependent. This means that there exists a non-zero polynomial $$f( \omega ) \in \mathbb{R} [ \omega ]$$ of degree at most $$n$$ such that $$f(x) = 0$$ ... ... "My question is as follows:

How exactly (rigorously and formally) does the elements $$1, x, \ ... \ ... \ , x^n$$ being linearly dependent allow us to conclude that there exists a non-zero polynomial $$f( \omega ) \in \mathbb{R} [ \omega ] $$ of degree at most $$n$$ such that $$f(x) = 0$$ ... ?Help will be much appreciated ...

Peter

=====================================================

In order for readers of the above post to appreciate the context of the post I am providing pages 1-2 of Bresar ... as follows ...https://www.physicsforums.com/attachments/6193
View attachment 6194
 
Physics news on Phys.org
Peter said:
My question is as follows:

How exactly (rigorously and formally) does the elements $$1, x, \ ... \ ... \ , x^n$$ being linearly dependent allow us to conclude that there exists a non-zero polynomial $$f( \omega ) \in \mathbb{R} [ \omega ] $$ of degree at most $$n$$ such that $$f(x) = 0$$ ... ?
The definition of dimension tells you that the maximum number of elements in a linearly independent set is $n$. The set $\{1,x,\ldots,x^n\}$ contains $n+1$ elements and must therefore be linearly dependent.

Now go back to the definition of linear dependence for the set $\{1,x,\ldots,x^n\}$. This says that there exist real numbers $\alpha_0,\alpha_1,\ldots,\alpha_n$, not all zero, such that $\alpha_01 + \alpha_1x + \alpha_2x^2 + \ldots + \alpha_nx^n = 0.$

Define the polynomial $f(\omega)$ by $f(\omega) = \alpha_0 + \alpha_1\omega + \alpha_2\omega^2 + \ldots + \alpha_n\omega^n.$ This polynomial is nonzero (because not all its coefficients are zero), and clearly $f(x) = 0.$
 
Opalg said:
The definition of dimension tells you that the maximum number of elements in a linearly independent set is $n$. The set $\{1,x,\ldots,x^n\}$ contains $n+1$ elements and must therefore be linearly dependent.

Now go back to the definition of linear dependence for the set $\{1,x,\ldots,x^n\}$. This says that there exist real numbers $\alpha_0,\alpha_1,\ldots,\alpha_n$, not all zero, such that $\alpha_01 + \alpha_1x + \alpha_2x^2 + \ldots + \alpha_nx^n = 0.$

Define the polynomial $f(\omega)$ by $f(\omega) = \alpha_0 + \alpha_1\omega + \alpha_2\omega^2 + \ldots + \alpha_n\omega^n.$ This polynomial is nonzero (because not all its coefficients are zero), and clearly $f(x) = 0.$
Thanks Opalg ... very clear and very helpful ...

Appreciate your help ...

Peter
 
##\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