Trouble setting up to prove unique factorization

  • Thread starter Thread starter lants
  • Start date Start date
  • Tags Tags
    Factorization
lants
Messages
14
Reaction score
1
This lemma the book states, I can't make sense of it.

Lemma: If a,b\in Z and b > 0, there exist q,r \in Z such that a = qb + r with 0 \leq r < b.

Proof: Consider the set of all integers of the form a-xb with x \in Z. This set includes positive elements. Let r = a - qb be the least nonnegative element in this set. We claim that 0\leq r < b. If not, r = a - qb \geq b and so 0\leq a-(q+1)b<r, which contradicts the minimality of r.

Can someone help explain this to me? Why can't a = 3, and b = 8. Then no q,r could exist so that r is less than b, right?
 
Physics news on Phys.org
Is this considered a textbook style question? Sorry, how can I move it? I just saw number theory and posted
 
What is wrong with a=3 and b=8? Here you simply take q=0 and r=3 (there is no condition that says either q or r have to be nonzero) to get 3=(0)(8) +3 and 0\leq 3&lt; 8 as required.
 
Wow I'm quitting now

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