Suppose $U_1,dots,U_k$ and $V_1,dots,V_k$ are $ntimes n$ unitary matrices. Show that $|U_1cdots U_k-V_1cdots V_k|leqsum_i=1^k|U_i-V_i|$Is there a condition for the following consequence?Orthogonal Inner Product Proofprove change of basis matrix is unitarya matrix metricMatrix of non-degenerate product invertible?Prove that there is a $uin V$, such that $<u,v_i>$ is greater than zero, for every $i in 1,..,m$.Find shortest vectors $u_1,v_1,cdots,u_N,v_N$ such that $langle u_i,v_jrangle=1$ if $ile j$ and $langle u_i,v_jrangle=0$ if $i>j$Inner product of dual basisColumn Spaces and SubsetsInduced inner product on tensor powers.
In a future war, an old lady is trying to raise a boy but one of the weapons has made everyone deaf
How to make healing in an exploration game interesting
Professor being mistaken for a grad student
How to deal with a cynical class?
What's the meaning of “spike” in the context of “adrenaline spike”?
If curse and magic is two sides of the same coin, why the former is forbidden?
How do anti-virus programs start at Windows boot?
Bach's Toccata and Fugue in D minor breaks the "no parallel octaves" rule?
How to write cleanly even if my character uses expletive language?
Combining an idiom with a metonymy
Do I need to be arrogant to get ahead?
A Cautionary Suggestion
compactness of a set where am I going wrong
How to use deus ex machina safely?
Do the common programs (for example: "ls", "cat") in Linux and BSD come from the same source code?
Welcoming 2019 Pi day: How to draw the letter π?
Credit cards used everywhere in Singapore or Malaysia?
Gravity magic - How does it work?
Are ETF trackers fundamentally better than individual stocks?
Is it possible to upcast ritual spells?
Life insurance that covers only simultaneous/dual deaths
Python if-else code style for reduced code for rounding floats
What approach do we need to follow for projects without a test environment?
Gantt Chart like rectangles with log scale
Suppose $U_1,dots,U_k$ and $V_1,dots,V_k$ are $ntimes n$ unitary matrices. Show that $|U_1cdots U_k-V_1cdots V_k|leqsum_i=1^k|U_i-V_i|$
Is there a condition for the following consequence?Orthogonal Inner Product Proofprove change of basis matrix is unitarya matrix metricMatrix of non-degenerate product invertible?Prove that there is a $uin V$, such that $<u,v_i>$ is greater than zero, for every $i in 1,..,m$.Find shortest vectors $u_1,v_1,cdots,u_N,v_N$ such that $langle u_i,v_jrangle=1$ if $ile j$ and $langle u_i,v_jrangle=0$ if $i>j$Inner product of dual basisColumn Spaces and SubsetsInduced inner product on tensor powers.
$begingroup$
Let $V,W$ be complex inner product spaces. Suppose $T: V to W$ is a linear map, then we define
$$|T|:=supv$$ where $|v_V|:=sqrtlangle v,vrangle$ and $|Tv|_W:=sqrtlangle Tv,Tvrangle$.
Question: Suppose $U_1,ldots,U_k$ and $V_1,ldots,V_k$ are $n times n$ unitary matrices. Show that
$$|U_1cdots U_k-V_1cdots V_k| leq sum_i=1^k|U_i-V_i|$$
I have tried to use triangle inequality for norms and induction but failed. Can anyone give some hints? Thank you!
linear-algebra matrices functional-analysis norm
edited 2 hours ago
Asaf Karagila♦
306k33438769
asked 5 hours ago
bbwbbw
52239
$endgroup$
add a comment |
$begingroup$
Let $V,W$ be complex inner product spaces. Suppose $T: V to W$ is a linear map, then we define
$$|T|:=supv$$ where $|v_V|:=sqrtlangle v,vrangle$ and $|Tv|_W:=sqrtlangle Tv,Tvrangle$.
Question: Suppose $U_1,ldots,U_k$ and $V_1,ldots,V_k$ are $n times n$ unitary matrices. Show that
$$|U_1cdots U_k-V_1cdots V_k| leq sum_i=1^k|U_i-V_i|$$
I have tried to use triangle inequality for norms and induction but failed. Can anyone give some hints? Thank you!
linear-algebra matrices functional-analysis norm
edited 2 hours ago
Asaf Karagila♦
306k33438769
asked 5 hours ago
bbwbbw
52239
$endgroup$
add a comment |
$begingroup$
Let $V,W$ be complex inner product spaces. Suppose $T: V to W$ is a linear map, then we define
$$|T|:=supv$$ where $|v_V|:=sqrtlangle v,vrangle$ and $|Tv|_W:=sqrtlangle Tv,Tvrangle$.
Question: Suppose $U_1,ldots,U_k$ and $V_1,ldots,V_k$ are $n times n$ unitary matrices. Show that
$$|U_1cdots U_k-V_1cdots V_k| leq sum_i=1^k|U_i-V_i|$$
I have tried to use triangle inequality for norms and induction but failed. Can anyone give some hints? Thank you!
linear-algebra matrices functional-analysis norm
edited 2 hours ago
Asaf Karagila♦
306k33438769
asked 5 hours ago
bbwbbw
52239
$endgroup$
Let $V,W$ be complex inner product spaces. Suppose $T: V to W$ is a linear map, then we define
$$|T|:=supv$$ where $|v_V|:=sqrtlangle v,vrangle$ and $|Tv|_W:=sqrtlangle Tv,Tvrangle$.
Question: Suppose $U_1,ldots,U_k$ and $V_1,ldots,V_k$ are $n times n$ unitary matrices. Show that
$$|U_1cdots U_k-V_1cdots V_k| leq sum_i=1^k|U_i-V_i|$$
I have tried to use triangle inequality for norms and induction but failed. Can anyone give some hints? Thank you!
linear-algebra matrices functional-analysis norm
linear-algebra matrices functional-analysis norm
edited 2 hours ago
Asaf Karagila♦
306k33438769
asked 5 hours ago
bbwbbw
52239
edited 2 hours ago
Asaf Karagila♦
306k33438769
asked 5 hours ago
bbwbbw
52239
edited 2 hours ago
Asaf Karagila♦
306k33438769
edited 2 hours ago
Asaf Karagila♦
306k33438769
edited 2 hours ago
Asaf Karagila♦
306k33438769
306k33438769
asked 5 hours ago
bbwbbw
52239
asked 5 hours ago
bbwbbw
52239
asked 5 hours ago
bbwbbw
52239
52239
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
For $k = 1$, the inequality becomes an identity. So, start with the special case $k = 2$:
$$
beginarrayll
& ||U_1 U_2 - V_1 V_2||\ \
= & ||U_1 U_2 - V_1 U_2 + V_1 U_2 - V_1 V_2||\ \
= &
|| ( U_1 - V_1) U_2 + V_1 (U_2 - V_2) || \ \
leq & ||( U_1 - V_1) U_2 || + ||V_1 (U_2 - V_2) ||.\
endarray
$$
(The last inequality is the triangle inequality.) Now, since $U_2$ is unitary, we have $||U_2|| = 1$, so
$$
|| ( U_1 - V_1) U_2 || leq || U_1 - V_1 ||.
$$
A similar bound obtains for $||V_1 (U_2 - V_2) ||$.
This should give you enough "building blocks".:)
answered 5 hours ago
avsavs
3,434513
$endgroup$
$begingroup$
Thank you so much!
$endgroup$
– bbw
5 hours ago
1
$begingroup$
You are welcome. I edited to remove the (unjustified) assumption that the matrices commute.:)
$endgroup$
– avs
4 hours ago
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3149889%2fsuppose-u-1-dots-u-k-and-v-1-dots-v-k-are-n-times-n-unitary-matrices-sh%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
For $k = 1$, the inequality becomes an identity. So, start with the special case $k = 2$:
$$
beginarrayll
& ||U_1 U_2 - V_1 V_2||\ \
= & ||U_1 U_2 - V_1 U_2 + V_1 U_2 - V_1 V_2||\ \
= &
|| ( U_1 - V_1) U_2 + V_1 (U_2 - V_2) || \ \
leq & ||( U_1 - V_1) U_2 || + ||V_1 (U_2 - V_2) ||.\
endarray
$$
(The last inequality is the triangle inequality.) Now, since $U_2$ is unitary, we have $||U_2|| = 1$, so
$$
|| ( U_1 - V_1) U_2 || leq || U_1 - V_1 ||.
$$
A similar bound obtains for $||V_1 (U_2 - V_2) ||$.
This should give you enough "building blocks".:)
answered 5 hours ago
avsavs
3,434513
$endgroup$
$begingroup$
Thank you so much!
$endgroup$
– bbw
5 hours ago
1
$begingroup$
You are welcome. I edited to remove the (unjustified) assumption that the matrices commute.:)
$endgroup$
– avs
4 hours ago
add a comment |
$begingroup$
For $k = 1$, the inequality becomes an identity. So, start with the special case $k = 2$:
$$
beginarrayll
& ||U_1 U_2 - V_1 V_2||\ \
= & ||U_1 U_2 - V_1 U_2 + V_1 U_2 - V_1 V_2||\ \
= &
|| ( U_1 - V_1) U_2 + V_1 (U_2 - V_2) || \ \
leq & ||( U_1 - V_1) U_2 || + ||V_1 (U_2 - V_2) ||.\
endarray
$$
(The last inequality is the triangle inequality.) Now, since $U_2$ is unitary, we have $||U_2|| = 1$, so
$$
|| ( U_1 - V_1) U_2 || leq || U_1 - V_1 ||.
$$
A similar bound obtains for $||V_1 (U_2 - V_2) ||$.
This should give you enough "building blocks".:)
answered 5 hours ago
avsavs
3,434513
$endgroup$
$begingroup$
Thank you so much!
$endgroup$
– bbw
5 hours ago
1
$begingroup$
You are welcome. I edited to remove the (unjustified) assumption that the matrices commute.:)
$endgroup$
– avs
4 hours ago
add a comment |
$begingroup$
For $k = 1$, the inequality becomes an identity. So, start with the special case $k = 2$:
$$
beginarrayll
& ||U_1 U_2 - V_1 V_2||\ \
= & ||U_1 U_2 - V_1 U_2 + V_1 U_2 - V_1 V_2||\ \
= &
|| ( U_1 - V_1) U_2 + V_1 (U_2 - V_2) || \ \
leq & ||( U_1 - V_1) U_2 || + ||V_1 (U_2 - V_2) ||.\
endarray
$$
(The last inequality is the triangle inequality.) Now, since $U_2$ is unitary, we have $||U_2|| = 1$, so
$$
|| ( U_1 - V_1) U_2 || leq || U_1 - V_1 ||.
$$
A similar bound obtains for $||V_1 (U_2 - V_2) ||$.
This should give you enough "building blocks".:)
answered 5 hours ago
avsavs
3,434513
$endgroup$
For $k = 1$, the inequality becomes an identity. So, start with the special case $k = 2$:
$$
beginarrayll
& ||U_1 U_2 - V_1 V_2||\ \
= & ||U_1 U_2 - V_1 U_2 + V_1 U_2 - V_1 V_2||\ \
= &
|| ( U_1 - V_1) U_2 + V_1 (U_2 - V_2) || \ \
leq & ||( U_1 - V_1) U_2 || + ||V_1 (U_2 - V_2) ||.\
endarray
$$
(The last inequality is the triangle inequality.) Now, since $U_2$ is unitary, we have $||U_2|| = 1$, so
$$
|| ( U_1 - V_1) U_2 || leq || U_1 - V_1 ||.
$$
A similar bound obtains for $||V_1 (U_2 - V_2) ||$.
This should give you enough "building blocks".:)
answered 5 hours ago
avsavs
3,434513
edited 4 hours ago
answered 5 hours ago
avsavs
3,434513
answered 5 hours ago
avsavs
3,434513
answered 5 hours ago
avsavs
3,434513
3,434513
$begingroup$
Thank you so much!
$endgroup$
– bbw
5 hours ago
1
$begingroup$
You are welcome. I edited to remove the (unjustified) assumption that the matrices commute.:)
$endgroup$
– avs
4 hours ago
add a comment |
$begingroup$
Thank you so much!
$endgroup$
– bbw
5 hours ago
1
$begingroup$
You are welcome. I edited to remove the (unjustified) assumption that the matrices commute.:)
$endgroup$
– avs
4 hours ago
$begingroup$
Thank you so much!
$endgroup$
– bbw
5 hours ago
$begingroup$
Thank you so much!
$endgroup$
– bbw
5 hours ago
1
1
$begingroup$
You are welcome. I edited to remove the (unjustified) assumption that the matrices commute.:)
$endgroup$
– avs
4 hours ago
$begingroup$
You are welcome. I edited to remove the (unjustified) assumption that the matrices commute.:)
$endgroup$
– avs
4 hours ago
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3149889%2fsuppose-u-1-dots-u-k-and-v-1-dots-v-k-are-n-times-n-unitary-matrices-sh%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
