Distance between invertible elements of a normed algebra

  • Thread starter Thread starter Fredrik
  • Start date Start date
  • Tags Tags
    Algebra Elements
Fredrik
Staff Emeritus
Science Advisor
Homework Helper
Insights Author
Gold Member
Messages
10,876
Reaction score
423
Is there a way to see that if \|x-y\| is "small", then so is \|x^{-1}-y^{-1}\|? For example, if \|x-y\|<r, is there a function f such that \|x^{-1}-y^{-1}\|<f(r)

Edit: Nevermind. What I needed is just the operator version of (1/2-2/3)=(3-2)/6:

\|x^{-1}-y^{-1}\|=\|x^{-1}yy^{-1}-x^{-1}xy^{-1}\|=\|x^{-1}(y-x)y^{-1}\|\leq \|x^{-1}\|\|x-y\|\|y^{-1}\|
 
Last edited:
Physics news on Phys.org
|x-y| can be made as small as you want while |x^-1+y^-1| simultaneously can be made as large as you want.

In R, take x=2/2^k, y=1/2^k, and let k grow without restriction.
 
Good point. I was however more interested in showing that you can make \|x^{-1}-y^{-1}\| as small as you want by choosing y so that \|x-y\| is small enough. The calculation I added in my edit is what I need for that.
 
##\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

Back
Top