Show that if $H$ is an Hermitian matrix, then $U=(iI-H)(iI+H)^{-1}$ is unitary
$begingroup$
How would you prove, that when $H$ is a hermitian matrix, then:
$$U=(iI-H)(iI+H)^{-1},$$
where $U$ is unitary, assuming that $(iI+H)$ is invertible.
I thought that because $U$ is unitary, $UU^*=U^*U=I$.
So I tried to take the conjugate transpose of $U$ where:
$$U^*=(-iI-H)(H-iI)^{-1}.$$
Essentially this is where I am stuck:
1) How do I take the transpose of $U$, so I don't just have the conjugate -- or does it not matter?
2) How do I get rid of the inverse because I don't know what to do with it and how to eventually prove $UU^*=I$?
Thank you!
linear-algebra matrices
$endgroup$
add a comment |
$begingroup$
How would you prove, that when $H$ is a hermitian matrix, then:
$$U=(iI-H)(iI+H)^{-1},$$
where $U$ is unitary, assuming that $(iI+H)$ is invertible.
I thought that because $U$ is unitary, $UU^*=U^*U=I$.
So I tried to take the conjugate transpose of $U$ where:
$$U^*=(-iI-H)(H-iI)^{-1}.$$
Essentially this is where I am stuck:
1) How do I take the transpose of $U$, so I don't just have the conjugate -- or does it not matter?
2) How do I get rid of the inverse because I don't know what to do with it and how to eventually prove $UU^*=I$?
Thank you!
linear-algebra matrices
$endgroup$
1
$begingroup$
Take a look at the Cayley transform en.wikipedia.org/wiki/Cayley_transform which is a cousin of the transform you are interested in.
$endgroup$
– Jean Marie
Dec 6 '18 at 23:04
add a comment |
$begingroup$
How would you prove, that when $H$ is a hermitian matrix, then:
$$U=(iI-H)(iI+H)^{-1},$$
where $U$ is unitary, assuming that $(iI+H)$ is invertible.
I thought that because $U$ is unitary, $UU^*=U^*U=I$.
So I tried to take the conjugate transpose of $U$ where:
$$U^*=(-iI-H)(H-iI)^{-1}.$$
Essentially this is where I am stuck:
1) How do I take the transpose of $U$, so I don't just have the conjugate -- or does it not matter?
2) How do I get rid of the inverse because I don't know what to do with it and how to eventually prove $UU^*=I$?
Thank you!
linear-algebra matrices
$endgroup$
How would you prove, that when $H$ is a hermitian matrix, then:
$$U=(iI-H)(iI+H)^{-1},$$
where $U$ is unitary, assuming that $(iI+H)$ is invertible.
I thought that because $U$ is unitary, $UU^*=U^*U=I$.
So I tried to take the conjugate transpose of $U$ where:
$$U^*=(-iI-H)(H-iI)^{-1}.$$
Essentially this is where I am stuck:
1) How do I take the transpose of $U$, so I don't just have the conjugate -- or does it not matter?
2) How do I get rid of the inverse because I don't know what to do with it and how to eventually prove $UU^*=I$?
Thank you!
linear-algebra matrices
linear-algebra matrices
edited Dec 6 '18 at 22:57
Jean Marie
30.5k42153
30.5k42153
asked Dec 5 '18 at 19:06
user623276user623276
162
162
1
$begingroup$
Take a look at the Cayley transform en.wikipedia.org/wiki/Cayley_transform which is a cousin of the transform you are interested in.
$endgroup$
– Jean Marie
Dec 6 '18 at 23:04
add a comment |
1
$begingroup$
Take a look at the Cayley transform en.wikipedia.org/wiki/Cayley_transform which is a cousin of the transform you are interested in.
$endgroup$
– Jean Marie
Dec 6 '18 at 23:04
1
1
$begingroup$
Take a look at the Cayley transform en.wikipedia.org/wiki/Cayley_transform which is a cousin of the transform you are interested in.
$endgroup$
– Jean Marie
Dec 6 '18 at 23:04
$begingroup$
Take a look at the Cayley transform en.wikipedia.org/wiki/Cayley_transform which is a cousin of the transform you are interested in.
$endgroup$
– Jean Marie
Dec 6 '18 at 23:04
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
Let $H$ be Hermitian and $U=(iI-H)(iI+H)^{-1}$. Then
$$
U^*=(-iI+H)^{-1}(-iI-H) = (iI-H)^{-1}(iI+H) .
$$
Therefore
$$
begin{split}
UU^*
&= (iI-H)(iI+H)^{-1}(iI-H)^{-1}(iI+H) \
&= (iI-H)(iI+H)^{-1}(iI+H)(iI-H)^{-1} \
&=(iI-H)(iI-H)^{-1} \
&= I.
end{split}
$$
They key fact is that for every $x,yinmathbb C$ and every matrix $A$ you have
$$
(xI+A)(yI+A)=(yI+A)(xI+A).
$$
Multiplying by $(yI+A)^{-1}$ both on the left and the right, you get also
$$
(yI+A)^{-1}(xI+A) = (xI+A)(yI+A)^{-1}.
$$
$endgroup$
1
$begingroup$
The OP can be said that in general two polynomials in the same matrix commute : $p(A)q(A)=q(A)p(A)$ where $p$ and $q$ are any polynomials.
$endgroup$
– Jean Marie
Dec 6 '18 at 23:00
$begingroup$
Yes, of course, it follows either by a direct computation or from what I stated, once you factorize the polynomials. And then you get also $p(A)q(A)^{-1} = q(A)^{-1}p(A)$, meaning that you can evaluate the rational function $p/q$ however you prefer
$endgroup$
– Federico
Dec 7 '18 at 14:05
add a comment |
$begingroup$
The point is that $(AB)^* = B^* A^*$, which implies $(A^{-1})^* = (A^*)^{-1}$.
Thus if $U = (iI-H)(iI+H)^{-1}$, $$U^* = ((iI + H)^{-1})^* (iI - H)^* =
(-iI+H)^{-1} (-iI-H) = (iI-H)^{-1}(iI+H)$$
and $U U^* = U^* U = I$ (note that $iI+H$ and $iI-H$ and their inverses commute).
$endgroup$
$begingroup$
I think that the point that he missed was that the matrices commute. I wrote that in my answer
$endgroup$
– Federico
Dec 5 '18 at 19:24
add a comment |
$begingroup$
The matrices $iI+H$ and $iI-H$ are invertible, because $H$ only has real eigenvalues, being Hermitian.
Your equality can also be written as $U(iI-H)=(iI+H)$. Taking the Hermitian transpose,
$$
(iI-H)^*U^*=(iI+H)^*
$$
so that
$$
(-iI-H)U^*=-iI+H
$$
which is equivalent to $(iI+H)U^*=iI-H$. Multiply the left-hand side by $U(iI-H)$ and the right hand side by $(iI+H)$:
$$
(iI+H)U^*U(iI-H)=(iI-H)(iI+H)
$$
However, $(iI-H)(iI+H)=(iI+H)(iI-H)$ by direct computation, so
$$
(iI+H)U^*U(iI-H)=(iI+H)(iI-H)
$$
and we can cancel on both sides the invertible matrices, leaving $UU^*=I$.
$endgroup$
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');
});
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%2f3027503%2fshow-that-if-h-is-an-hermitian-matrix-then-u-ii-hiih-1-is-unitary%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Let $H$ be Hermitian and $U=(iI-H)(iI+H)^{-1}$. Then
$$
U^*=(-iI+H)^{-1}(-iI-H) = (iI-H)^{-1}(iI+H) .
$$
Therefore
$$
begin{split}
UU^*
&= (iI-H)(iI+H)^{-1}(iI-H)^{-1}(iI+H) \
&= (iI-H)(iI+H)^{-1}(iI+H)(iI-H)^{-1} \
&=(iI-H)(iI-H)^{-1} \
&= I.
end{split}
$$
They key fact is that for every $x,yinmathbb C$ and every matrix $A$ you have
$$
(xI+A)(yI+A)=(yI+A)(xI+A).
$$
Multiplying by $(yI+A)^{-1}$ both on the left and the right, you get also
$$
(yI+A)^{-1}(xI+A) = (xI+A)(yI+A)^{-1}.
$$
$endgroup$
1
$begingroup$
The OP can be said that in general two polynomials in the same matrix commute : $p(A)q(A)=q(A)p(A)$ where $p$ and $q$ are any polynomials.
$endgroup$
– Jean Marie
Dec 6 '18 at 23:00
$begingroup$
Yes, of course, it follows either by a direct computation or from what I stated, once you factorize the polynomials. And then you get also $p(A)q(A)^{-1} = q(A)^{-1}p(A)$, meaning that you can evaluate the rational function $p/q$ however you prefer
$endgroup$
– Federico
Dec 7 '18 at 14:05
add a comment |
$begingroup$
Let $H$ be Hermitian and $U=(iI-H)(iI+H)^{-1}$. Then
$$
U^*=(-iI+H)^{-1}(-iI-H) = (iI-H)^{-1}(iI+H) .
$$
Therefore
$$
begin{split}
UU^*
&= (iI-H)(iI+H)^{-1}(iI-H)^{-1}(iI+H) \
&= (iI-H)(iI+H)^{-1}(iI+H)(iI-H)^{-1} \
&=(iI-H)(iI-H)^{-1} \
&= I.
end{split}
$$
They key fact is that for every $x,yinmathbb C$ and every matrix $A$ you have
$$
(xI+A)(yI+A)=(yI+A)(xI+A).
$$
Multiplying by $(yI+A)^{-1}$ both on the left and the right, you get also
$$
(yI+A)^{-1}(xI+A) = (xI+A)(yI+A)^{-1}.
$$
$endgroup$
1
$begingroup$
The OP can be said that in general two polynomials in the same matrix commute : $p(A)q(A)=q(A)p(A)$ where $p$ and $q$ are any polynomials.
$endgroup$
– Jean Marie
Dec 6 '18 at 23:00
$begingroup$
Yes, of course, it follows either by a direct computation or from what I stated, once you factorize the polynomials. And then you get also $p(A)q(A)^{-1} = q(A)^{-1}p(A)$, meaning that you can evaluate the rational function $p/q$ however you prefer
$endgroup$
– Federico
Dec 7 '18 at 14:05
add a comment |
$begingroup$
Let $H$ be Hermitian and $U=(iI-H)(iI+H)^{-1}$. Then
$$
U^*=(-iI+H)^{-1}(-iI-H) = (iI-H)^{-1}(iI+H) .
$$
Therefore
$$
begin{split}
UU^*
&= (iI-H)(iI+H)^{-1}(iI-H)^{-1}(iI+H) \
&= (iI-H)(iI+H)^{-1}(iI+H)(iI-H)^{-1} \
&=(iI-H)(iI-H)^{-1} \
&= I.
end{split}
$$
They key fact is that for every $x,yinmathbb C$ and every matrix $A$ you have
$$
(xI+A)(yI+A)=(yI+A)(xI+A).
$$
Multiplying by $(yI+A)^{-1}$ both on the left and the right, you get also
$$
(yI+A)^{-1}(xI+A) = (xI+A)(yI+A)^{-1}.
$$
$endgroup$
Let $H$ be Hermitian and $U=(iI-H)(iI+H)^{-1}$. Then
$$
U^*=(-iI+H)^{-1}(-iI-H) = (iI-H)^{-1}(iI+H) .
$$
Therefore
$$
begin{split}
UU^*
&= (iI-H)(iI+H)^{-1}(iI-H)^{-1}(iI+H) \
&= (iI-H)(iI+H)^{-1}(iI+H)(iI-H)^{-1} \
&=(iI-H)(iI-H)^{-1} \
&= I.
end{split}
$$
They key fact is that for every $x,yinmathbb C$ and every matrix $A$ you have
$$
(xI+A)(yI+A)=(yI+A)(xI+A).
$$
Multiplying by $(yI+A)^{-1}$ both on the left and the right, you get also
$$
(yI+A)^{-1}(xI+A) = (xI+A)(yI+A)^{-1}.
$$
answered Dec 5 '18 at 19:23
FedericoFederico
5,134514
5,134514
1
$begingroup$
The OP can be said that in general two polynomials in the same matrix commute : $p(A)q(A)=q(A)p(A)$ where $p$ and $q$ are any polynomials.
$endgroup$
– Jean Marie
Dec 6 '18 at 23:00
$begingroup$
Yes, of course, it follows either by a direct computation or from what I stated, once you factorize the polynomials. And then you get also $p(A)q(A)^{-1} = q(A)^{-1}p(A)$, meaning that you can evaluate the rational function $p/q$ however you prefer
$endgroup$
– Federico
Dec 7 '18 at 14:05
add a comment |
1
$begingroup$
The OP can be said that in general two polynomials in the same matrix commute : $p(A)q(A)=q(A)p(A)$ where $p$ and $q$ are any polynomials.
$endgroup$
– Jean Marie
Dec 6 '18 at 23:00
$begingroup$
Yes, of course, it follows either by a direct computation or from what I stated, once you factorize the polynomials. And then you get also $p(A)q(A)^{-1} = q(A)^{-1}p(A)$, meaning that you can evaluate the rational function $p/q$ however you prefer
$endgroup$
– Federico
Dec 7 '18 at 14:05
1
1
$begingroup$
The OP can be said that in general two polynomials in the same matrix commute : $p(A)q(A)=q(A)p(A)$ where $p$ and $q$ are any polynomials.
$endgroup$
– Jean Marie
Dec 6 '18 at 23:00
$begingroup$
The OP can be said that in general two polynomials in the same matrix commute : $p(A)q(A)=q(A)p(A)$ where $p$ and $q$ are any polynomials.
$endgroup$
– Jean Marie
Dec 6 '18 at 23:00
$begingroup$
Yes, of course, it follows either by a direct computation or from what I stated, once you factorize the polynomials. And then you get also $p(A)q(A)^{-1} = q(A)^{-1}p(A)$, meaning that you can evaluate the rational function $p/q$ however you prefer
$endgroup$
– Federico
Dec 7 '18 at 14:05
$begingroup$
Yes, of course, it follows either by a direct computation or from what I stated, once you factorize the polynomials. And then you get also $p(A)q(A)^{-1} = q(A)^{-1}p(A)$, meaning that you can evaluate the rational function $p/q$ however you prefer
$endgroup$
– Federico
Dec 7 '18 at 14:05
add a comment |
$begingroup$
The point is that $(AB)^* = B^* A^*$, which implies $(A^{-1})^* = (A^*)^{-1}$.
Thus if $U = (iI-H)(iI+H)^{-1}$, $$U^* = ((iI + H)^{-1})^* (iI - H)^* =
(-iI+H)^{-1} (-iI-H) = (iI-H)^{-1}(iI+H)$$
and $U U^* = U^* U = I$ (note that $iI+H$ and $iI-H$ and their inverses commute).
$endgroup$
$begingroup$
I think that the point that he missed was that the matrices commute. I wrote that in my answer
$endgroup$
– Federico
Dec 5 '18 at 19:24
add a comment |
$begingroup$
The point is that $(AB)^* = B^* A^*$, which implies $(A^{-1})^* = (A^*)^{-1}$.
Thus if $U = (iI-H)(iI+H)^{-1}$, $$U^* = ((iI + H)^{-1})^* (iI - H)^* =
(-iI+H)^{-1} (-iI-H) = (iI-H)^{-1}(iI+H)$$
and $U U^* = U^* U = I$ (note that $iI+H$ and $iI-H$ and their inverses commute).
$endgroup$
$begingroup$
I think that the point that he missed was that the matrices commute. I wrote that in my answer
$endgroup$
– Federico
Dec 5 '18 at 19:24
add a comment |
$begingroup$
The point is that $(AB)^* = B^* A^*$, which implies $(A^{-1})^* = (A^*)^{-1}$.
Thus if $U = (iI-H)(iI+H)^{-1}$, $$U^* = ((iI + H)^{-1})^* (iI - H)^* =
(-iI+H)^{-1} (-iI-H) = (iI-H)^{-1}(iI+H)$$
and $U U^* = U^* U = I$ (note that $iI+H$ and $iI-H$ and their inverses commute).
$endgroup$
The point is that $(AB)^* = B^* A^*$, which implies $(A^{-1})^* = (A^*)^{-1}$.
Thus if $U = (iI-H)(iI+H)^{-1}$, $$U^* = ((iI + H)^{-1})^* (iI - H)^* =
(-iI+H)^{-1} (-iI-H) = (iI-H)^{-1}(iI+H)$$
and $U U^* = U^* U = I$ (note that $iI+H$ and $iI-H$ and their inverses commute).
answered Dec 5 '18 at 19:23
Robert IsraelRobert Israel
326k23215469
326k23215469
$begingroup$
I think that the point that he missed was that the matrices commute. I wrote that in my answer
$endgroup$
– Federico
Dec 5 '18 at 19:24
add a comment |
$begingroup$
I think that the point that he missed was that the matrices commute. I wrote that in my answer
$endgroup$
– Federico
Dec 5 '18 at 19:24
$begingroup$
I think that the point that he missed was that the matrices commute. I wrote that in my answer
$endgroup$
– Federico
Dec 5 '18 at 19:24
$begingroup$
I think that the point that he missed was that the matrices commute. I wrote that in my answer
$endgroup$
– Federico
Dec 5 '18 at 19:24
add a comment |
$begingroup$
The matrices $iI+H$ and $iI-H$ are invertible, because $H$ only has real eigenvalues, being Hermitian.
Your equality can also be written as $U(iI-H)=(iI+H)$. Taking the Hermitian transpose,
$$
(iI-H)^*U^*=(iI+H)^*
$$
so that
$$
(-iI-H)U^*=-iI+H
$$
which is equivalent to $(iI+H)U^*=iI-H$. Multiply the left-hand side by $U(iI-H)$ and the right hand side by $(iI+H)$:
$$
(iI+H)U^*U(iI-H)=(iI-H)(iI+H)
$$
However, $(iI-H)(iI+H)=(iI+H)(iI-H)$ by direct computation, so
$$
(iI+H)U^*U(iI-H)=(iI+H)(iI-H)
$$
and we can cancel on both sides the invertible matrices, leaving $UU^*=I$.
$endgroup$
add a comment |
$begingroup$
The matrices $iI+H$ and $iI-H$ are invertible, because $H$ only has real eigenvalues, being Hermitian.
Your equality can also be written as $U(iI-H)=(iI+H)$. Taking the Hermitian transpose,
$$
(iI-H)^*U^*=(iI+H)^*
$$
so that
$$
(-iI-H)U^*=-iI+H
$$
which is equivalent to $(iI+H)U^*=iI-H$. Multiply the left-hand side by $U(iI-H)$ and the right hand side by $(iI+H)$:
$$
(iI+H)U^*U(iI-H)=(iI-H)(iI+H)
$$
However, $(iI-H)(iI+H)=(iI+H)(iI-H)$ by direct computation, so
$$
(iI+H)U^*U(iI-H)=(iI+H)(iI-H)
$$
and we can cancel on both sides the invertible matrices, leaving $UU^*=I$.
$endgroup$
add a comment |
$begingroup$
The matrices $iI+H$ and $iI-H$ are invertible, because $H$ only has real eigenvalues, being Hermitian.
Your equality can also be written as $U(iI-H)=(iI+H)$. Taking the Hermitian transpose,
$$
(iI-H)^*U^*=(iI+H)^*
$$
so that
$$
(-iI-H)U^*=-iI+H
$$
which is equivalent to $(iI+H)U^*=iI-H$. Multiply the left-hand side by $U(iI-H)$ and the right hand side by $(iI+H)$:
$$
(iI+H)U^*U(iI-H)=(iI-H)(iI+H)
$$
However, $(iI-H)(iI+H)=(iI+H)(iI-H)$ by direct computation, so
$$
(iI+H)U^*U(iI-H)=(iI+H)(iI-H)
$$
and we can cancel on both sides the invertible matrices, leaving $UU^*=I$.
$endgroup$
The matrices $iI+H$ and $iI-H$ are invertible, because $H$ only has real eigenvalues, being Hermitian.
Your equality can also be written as $U(iI-H)=(iI+H)$. Taking the Hermitian transpose,
$$
(iI-H)^*U^*=(iI+H)^*
$$
so that
$$
(-iI-H)U^*=-iI+H
$$
which is equivalent to $(iI+H)U^*=iI-H$. Multiply the left-hand side by $U(iI-H)$ and the right hand side by $(iI+H)$:
$$
(iI+H)U^*U(iI-H)=(iI-H)(iI+H)
$$
However, $(iI-H)(iI+H)=(iI+H)(iI-H)$ by direct computation, so
$$
(iI+H)U^*U(iI-H)=(iI+H)(iI-H)
$$
and we can cancel on both sides the invertible matrices, leaving $UU^*=I$.
answered Dec 7 '18 at 0:21
egregegreg
183k1486205
183k1486205
add a comment |
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');
});
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%2f3027503%2fshow-that-if-h-is-an-hermitian-matrix-then-u-ii-hiih-1-is-unitary%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');
});
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');
});
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');
});
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
1
$begingroup$
Take a look at the Cayley transform en.wikipedia.org/wiki/Cayley_transform which is a cousin of the transform you are interested in.
$endgroup$
– Jean Marie
Dec 6 '18 at 23:04