For A &#x2208;<!-- ∈ --> B ( H ) where H is a separable Hilbert space (so a coun

2nalfq8 2022-06-30 Answered
For A B ( H ) where H is a separable Hilbert space (so a countable orthonormal basis exists or also known as a maximal orthonormal system) where A is also a Hilbert-Schmidt operator and B B ( H ) (so B does not need to be a Hilbert-Schmidt operator. It is just linear and bounded.) How do I show that | | A B | | H S | | A | | H S | | B | | H and | | B A | | H S | | A | | H S | | B | | H where H S is the Hilbert Schmidt norm and H is just the standard operator norm. I have never been introduced to the trace operator so I can't use that. I can only use the standard Hilbert space inequalities like Cauchy-Schwarz, Parseval's and Bessel's inequality as well as the fact that A H A H S I have not been able to turn the left hand side anywhere close to the right hand side so I'm not sure if there is some trick I'm missing or some inequality I haven't thought of.
You can still ask an expert for help

Want to know more about Inequalities systems and graphs?

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question

Answers (1)

lofoptiformfp
Answered 2022-07-01 Author has 16 answers
Hint: Use B A e i H B H A e i H to show B A H S B H A H S . For the other inequality it is useful to first show B H = B H and A H S = A H S .
Not exactly what you’re looking for?
Ask My Question

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

You might be interested in

asked 2022-07-04
Suppose I have a string of inequalities, i.e.
f ( x , y , z ) < g ( x , y , z ) < h ( x , y , z )
Clearly, if I find when g ( x , y , z ) < h ( x , y , z ) and f < g, then f < h when both these conditions hold.
Is it ever useful to compare f ( x , y , z ) < h ( x , y , z ) in addition to f < g and g < h
Or is it useful to compare the conditions (assuming I can get them in a comparable form) from g < h and f < h to each other? Maybe comparing the two can give a single, simplified condition for f < g < h to hold?
asked 2022-07-14
Strategies to work with system of trigonometric inequality
[ exp ( q 1 i ) cos 3 ( p 3 ) sin ( p 1 ) sin ( p 2 ) sin ( p 3 ) ] a [ exp ( q 2 i ) exp ( q 3 i ) cos ( p 1 ) cos ( p 2 ) cos 2 ( p 3 ) sin ( p 2 ) sin 2 ( p 3 ) ] b 0 ,
where a and b are complex variables and q i and p i are real variables. The real system (the least of them) have 18 inequalities and 8 variables, I need know if there is a set of values (8 real values) that makes true at least one of the inequalities. Maybe a good path is know how determine the minimum value of a expression of type
[ exp ( a 1 i ) cos 3 ( a 2 ) sin ( a 3 ) sin ( a 4 ) sin 2 ( a 5 ) ]
or a bit more complex like
[ exp ( a 1 i ) cos 3 ( a 2 ) sin ( a 3 ) sin ( a 4 ) sin 2 ( a 5 ) ] [ exp ( b 1 i ) cos 2 ( b 2 ) sin ( b 3 ) sin ( b 4 ) sin 3 ( b 5 ) ] .
Then, some idea?
asked 2022-05-20
Given: For some X, V a r ( X ) = 9, E ( X ) = 2, E ( X 2 ) = 13
Problem: P r [ X = 2 ] > 0
The solution in my book says to construct a r.v. to satisfy the above conditions and confirm or deny the statement from there. For simplicity, assume X can take on two values P r [ a ] = 1 2 and P r [ b ] = 1 2 . Finding that a and b are not 2 is enough to disprove the statement. We can apply the constraints:
1 2 a + 1 2 b = 2
1 2 a 2 + 1 2 b 2 = 13
So I did this:
a = 4 b from the first equation
b 2 4 b 5 = 0 by substituting a
The above quadratic has two solutions, b = 1 and b = 5 which happen to be the same solutions the book got for a and b respectively.
I'm not sure if this is the right way to solve this problem since I never explicitly solved for a and the two solutions for b may coincidentally be the same.
asked 2022-06-14
How to solve systems of polynomial inequalities?
asked 2022-05-20
Solve absolute value inequality with x and y
I have difficulties to solve this system of inequalities. Normally you would solve it like a normal system of equations just writing or instead of =. But these contain an absolute value which confuses me. The system I want to solve is this:
{ | x y | 1 | x + y | 1
I would have written it like that
{ 1 x y 1 1 x + y 1
And by adding the inequalities I would obtain 1 x 1. I can’t get y though.
I don’t understand how my textbook got a third inequality out of the two initial ones
{ 1 x y 1 1 y x 1 1 x + y 1
But with that they can solve the system like so: ( 1 ) + ( 3 ) : 1 x 1 and ( 2 ) + ( 3 ) : 1 y 1.
asked 2022-06-28
Why in module inequality | f ( x ) | < A with a positive A we do not explicitly check that f ( x ) >= 0 and f ( x ) < 0?
| f ( x ) | < A when А > 0 is equivalent to the following system:
{ f ( x ) < A f ( x ) > A
I do not completely understand, why we do not exclude those x, for which f ( x ) < 0 in the first equation, and x for which f ( x ) < 0 in the second equation - I mean why we do not write explicitly two systems of inequalities, uniting their solutions like this:
{ f ( x ) < A f ( x ) >= 0
{ f ( x ) > A f ( x ) < 0
asked 2022-05-31
have a system of 3 nonlinear inequalities in 3 variables, and I need to find x , y , z, in terms of the parameters, that satisfies the equations. The system is:
1 1 + z m a x < 0 x b y < 0 y c z < 0
Where a , b , c > 0 are constants and m a positive integer. How can I go about solving for x, y, z in terms of the parameters?