Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

The following is about a proof in Bratteli Robinson vol 1. Let $\mathcal{A}$ be some C*-algebra. Show that $$\mathcal{B}=\{(A,\alpha)~|~A\in\mathcal{A}, \alpha\in\mathbb{C}\}$$ together with the norm $$\lVert(A,\alpha)\lVert=\sup_{B\in\mathcal{A}, \lVert B\lVert\leq 1} \lVert AB+\alpha B \lVert$$ and the operations $$(A,\alpha)(B,\beta)=(AB+\alpha B+\beta A, \alpha \beta)$$ $$\lambda(A,\alpha)=(\lambda A, \lambda\alpha)$$ $$(A,\alpha)+(B,\beta)=(A+B, \alpha+ \beta)$$ $$(A,\alpha)^*=(A^*,\bar{\alpha})$$ is again a C*-algebra. I understood the proof in general, but I don't see why the norm product inequality ($\lVert (A,\alpha)(B,\beta)\lVert\leq\lVert (A,\alpha)\lVert \lVert(B,\beta)\lVert$) holds. Any hints?

share|improve this question

1 Answer 1

up vote 1 down vote accepted

Hint: Plug $\dfrac{BC + \beta C}{\Vert BC + \beta C\Vert}$ into the norm computation of $(A,\alpha)$ and compare to plugging in $C$ to the norm computation of $(A,\alpha)(B,\beta)$.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.