Number of independent components of a unitary matrix
$begingroup$
By definition, a $n$ dimensional unitary matrix $U$ satisfies the condition
$U^{dagger}U=I$,
and
$UU^{dagger}=I$.
I'd like to ask if these two equations are independent. If so, there will be $n^2$ independent equations of constrain, which is equal to the number of independent components of a general $n$ dimensional matrix. This is obviously impossible. If not, how to prove it?
linear-algebra
$endgroup$
migrated from physics.stackexchange.com Aug 16 '15 at 3:02
This question came from our site for active researchers, academics and students of physics.
add a comment |
$begingroup$
By definition, a $n$ dimensional unitary matrix $U$ satisfies the condition
$U^{dagger}U=I$,
and
$UU^{dagger}=I$.
I'd like to ask if these two equations are independent. If so, there will be $n^2$ independent equations of constrain, which is equal to the number of independent components of a general $n$ dimensional matrix. This is obviously impossible. If not, how to prove it?
linear-algebra
$endgroup$
migrated from physics.stackexchange.com Aug 16 '15 at 3:02
This question came from our site for active researchers, academics and students of physics.
7
$begingroup$
Quite generally, for square matrices, $AB=I$ implies $BA=I$.
$endgroup$
– WillO
Aug 14 '15 at 2:18
5
$begingroup$
Both equations are necessary if $U$ is infinite dimensional. Consider a Hilbert space with orthonormal basis labelled by the natural numbers, and let $U$ be the shift operator that maps the $n$-th basis vector to the $n+1$-th; the adjoint of $U$ is noninvertible. Hence, $U^dagger U=I$, but $UU^dagger neq I$.
$endgroup$
– Couchyam
Aug 14 '15 at 2:28
5
$begingroup$
That's not a physics question. (If it was phrased as one, it'd still be off-topic as homework-like)
$endgroup$
– ACuriousMind
Aug 14 '15 at 2:43
2
$begingroup$
Hint: An complex $ntimes n$ matrix contains $2n^2$ real d.o.f.
$endgroup$
– Qmechanic
Aug 14 '15 at 10:02
add a comment |
$begingroup$
By definition, a $n$ dimensional unitary matrix $U$ satisfies the condition
$U^{dagger}U=I$,
and
$UU^{dagger}=I$.
I'd like to ask if these two equations are independent. If so, there will be $n^2$ independent equations of constrain, which is equal to the number of independent components of a general $n$ dimensional matrix. This is obviously impossible. If not, how to prove it?
linear-algebra
$endgroup$
By definition, a $n$ dimensional unitary matrix $U$ satisfies the condition
$U^{dagger}U=I$,
and
$UU^{dagger}=I$.
I'd like to ask if these two equations are independent. If so, there will be $n^2$ independent equations of constrain, which is equal to the number of independent components of a general $n$ dimensional matrix. This is obviously impossible. If not, how to prove it?
linear-algebra
linear-algebra
asked Aug 14 '15 at 2:15
Wen ChernWen Chern
12613
12613
migrated from physics.stackexchange.com Aug 16 '15 at 3:02
This question came from our site for active researchers, academics and students of physics.
migrated from physics.stackexchange.com Aug 16 '15 at 3:02
This question came from our site for active researchers, academics and students of physics.
7
$begingroup$
Quite generally, for square matrices, $AB=I$ implies $BA=I$.
$endgroup$
– WillO
Aug 14 '15 at 2:18
5
$begingroup$
Both equations are necessary if $U$ is infinite dimensional. Consider a Hilbert space with orthonormal basis labelled by the natural numbers, and let $U$ be the shift operator that maps the $n$-th basis vector to the $n+1$-th; the adjoint of $U$ is noninvertible. Hence, $U^dagger U=I$, but $UU^dagger neq I$.
$endgroup$
– Couchyam
Aug 14 '15 at 2:28
5
$begingroup$
That's not a physics question. (If it was phrased as one, it'd still be off-topic as homework-like)
$endgroup$
– ACuriousMind
Aug 14 '15 at 2:43
2
$begingroup$
Hint: An complex $ntimes n$ matrix contains $2n^2$ real d.o.f.
$endgroup$
– Qmechanic
Aug 14 '15 at 10:02
add a comment |
7
$begingroup$
Quite generally, for square matrices, $AB=I$ implies $BA=I$.
$endgroup$
– WillO
Aug 14 '15 at 2:18
5
$begingroup$
Both equations are necessary if $U$ is infinite dimensional. Consider a Hilbert space with orthonormal basis labelled by the natural numbers, and let $U$ be the shift operator that maps the $n$-th basis vector to the $n+1$-th; the adjoint of $U$ is noninvertible. Hence, $U^dagger U=I$, but $UU^dagger neq I$.
$endgroup$
– Couchyam
Aug 14 '15 at 2:28
5
$begingroup$
That's not a physics question. (If it was phrased as one, it'd still be off-topic as homework-like)
$endgroup$
– ACuriousMind
Aug 14 '15 at 2:43
2
$begingroup$
Hint: An complex $ntimes n$ matrix contains $2n^2$ real d.o.f.
$endgroup$
– Qmechanic
Aug 14 '15 at 10:02
7
7
$begingroup$
Quite generally, for square matrices, $AB=I$ implies $BA=I$.
$endgroup$
– WillO
Aug 14 '15 at 2:18
$begingroup$
Quite generally, for square matrices, $AB=I$ implies $BA=I$.
$endgroup$
– WillO
Aug 14 '15 at 2:18
5
5
$begingroup$
Both equations are necessary if $U$ is infinite dimensional. Consider a Hilbert space with orthonormal basis labelled by the natural numbers, and let $U$ be the shift operator that maps the $n$-th basis vector to the $n+1$-th; the adjoint of $U$ is noninvertible. Hence, $U^dagger U=I$, but $UU^dagger neq I$.
$endgroup$
– Couchyam
Aug 14 '15 at 2:28
$begingroup$
Both equations are necessary if $U$ is infinite dimensional. Consider a Hilbert space with orthonormal basis labelled by the natural numbers, and let $U$ be the shift operator that maps the $n$-th basis vector to the $n+1$-th; the adjoint of $U$ is noninvertible. Hence, $U^dagger U=I$, but $UU^dagger neq I$.
$endgroup$
– Couchyam
Aug 14 '15 at 2:28
5
5
$begingroup$
That's not a physics question. (If it was phrased as one, it'd still be off-topic as homework-like)
$endgroup$
– ACuriousMind
Aug 14 '15 at 2:43
$begingroup$
That's not a physics question. (If it was phrased as one, it'd still be off-topic as homework-like)
$endgroup$
– ACuriousMind
Aug 14 '15 at 2:43
2
2
$begingroup$
Hint: An complex $ntimes n$ matrix contains $2n^2$ real d.o.f.
$endgroup$
– Qmechanic
Aug 14 '15 at 10:02
$begingroup$
Hint: An complex $ntimes n$ matrix contains $2n^2$ real d.o.f.
$endgroup$
– Qmechanic
Aug 14 '15 at 10:02
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
@ Wen Chern , since you do not know that $U^*U=I$ implies that $UU^*=I$, I think that you are not an eagle in the mathematical field. Since I have no response to my answer, I think that you did not understand one word of it. You can remember that follows: the $n^2$ complex relations $U^*U=I$ are not algebraically independent because both matrices $U^*U$ and $I$ are hermitian. If we consider the upper triangular parts of these matrices (included diagonals), then we obtain $n^2$ real equalities (write them for $n=2$). The previous equalities are algebraically independent; that implies that a unitary matrix depends on $n^2$ real parameters.
In the body of text, I change the notation $SU_n$ with the standard one $U_n$.
Let $U_n={U=[u_{i,j}]in M_n(mathbb{C})|UU^*=I_n}$ (the other equality $U^*U=I_n$ is useless). $f:Urightarrow UU^*-I$ is not an algebraic function in the $(u_{i,j})$; yet, it is an algebraic function in the $2n^2$ real variables $Re(u_{i,j}),Im(u_{i,j})$. Then $U_n$ is a real algebraic set defined by $f(U)=0$; note that $U_n$ is a group; then it suffices to study $U_n$ in a neighborhood of $I_n$. One has $Df_I:Hrightarrow H+H^*$; then the tangent space of $U_n$ in $I_n$ is ${H|Df_i(H)=H+H^*=0}$, that is the vector space $SH$ of skew-hermitian matrices. The number of real independent parameters defining $U_n$ is the dimension over $mathbb{R}$ of $SH$, that is $2dfrac{n(n-1)}{2}+n=n^2$.
Note that $f(U)=0$ is equivalent to $n^2$ real relations; that shows that $U_n$ depends at least on $2n^2-n^2=n^2$ parameters. That is above shows that theses $n^2$ relations are algebraically independent.
$endgroup$
add a comment |
$begingroup$
Let us assume that $U$ is an $ntimes n$ unitary matrix, i.e.,
begin{equation}
U^dagger U=I~~~~~~~~~~~~~~~~~~~~~~~~~~~~(1)
end{equation}
The total number of entries in a unitary matrix is $n^2$ and the total number of real parameters is $2n^2$.
Let us further assume that $z_{pq}=a_{pq}+ib_{pq}$ where $a_{pq},~b_{pq}inmathbb{R}$.
From the equation (1), one can write
begin{eqnarray}
sum_{k=1}^n z_{ik}^dagger z_{kj}&=&delta_{ij}\
sum_{k=1}^n bar z_{ki} z_{kj}&=&delta_{ij}~~~~~~~~~~~~~~~~(2)
end{eqnarray}
For $i=j$, the eq. (2) reduces to
begin{equation}
sum_{k=1}^n |z_{ki}|^2=1~~~~~~~~~~~~~~~~~~~~~(3)
end{equation}
Therefore, for $i=1,2,...,n$, eq.(3) represents $n$ independent real conditions.
For if $ine j$, $i leftrightarrow j$, the eq. (2) remains the same. This gives $binom{n}{2}$ independent equations, therefore, $2timesbinom{n}{2}$ real conditions:
begin{eqnarray}
sum_{k=1}^n (a_{ki}a_{kj}+b_{ki}b_{kj})&=&0\
sum_{k=1}^n (a_{ki}b_{kj}+a_{kj}b_{ki})&=&0.
end{eqnarray}
Total number of independent real conditions is $n+2timesbinom{n}{2}=n^2$.
Therefore, the total number of independent real parameters (components) $=$ Total number of real parameters $-$ total number of independent real conditions.
begin{equation}
N=2n^2-n^2=n^2.
end{equation}
$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%2f1398789%2fnumber-of-independent-components-of-a-unitary-matrix%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
@ Wen Chern , since you do not know that $U^*U=I$ implies that $UU^*=I$, I think that you are not an eagle in the mathematical field. Since I have no response to my answer, I think that you did not understand one word of it. You can remember that follows: the $n^2$ complex relations $U^*U=I$ are not algebraically independent because both matrices $U^*U$ and $I$ are hermitian. If we consider the upper triangular parts of these matrices (included diagonals), then we obtain $n^2$ real equalities (write them for $n=2$). The previous equalities are algebraically independent; that implies that a unitary matrix depends on $n^2$ real parameters.
In the body of text, I change the notation $SU_n$ with the standard one $U_n$.
Let $U_n={U=[u_{i,j}]in M_n(mathbb{C})|UU^*=I_n}$ (the other equality $U^*U=I_n$ is useless). $f:Urightarrow UU^*-I$ is not an algebraic function in the $(u_{i,j})$; yet, it is an algebraic function in the $2n^2$ real variables $Re(u_{i,j}),Im(u_{i,j})$. Then $U_n$ is a real algebraic set defined by $f(U)=0$; note that $U_n$ is a group; then it suffices to study $U_n$ in a neighborhood of $I_n$. One has $Df_I:Hrightarrow H+H^*$; then the tangent space of $U_n$ in $I_n$ is ${H|Df_i(H)=H+H^*=0}$, that is the vector space $SH$ of skew-hermitian matrices. The number of real independent parameters defining $U_n$ is the dimension over $mathbb{R}$ of $SH$, that is $2dfrac{n(n-1)}{2}+n=n^2$.
Note that $f(U)=0$ is equivalent to $n^2$ real relations; that shows that $U_n$ depends at least on $2n^2-n^2=n^2$ parameters. That is above shows that theses $n^2$ relations are algebraically independent.
$endgroup$
add a comment |
$begingroup$
@ Wen Chern , since you do not know that $U^*U=I$ implies that $UU^*=I$, I think that you are not an eagle in the mathematical field. Since I have no response to my answer, I think that you did not understand one word of it. You can remember that follows: the $n^2$ complex relations $U^*U=I$ are not algebraically independent because both matrices $U^*U$ and $I$ are hermitian. If we consider the upper triangular parts of these matrices (included diagonals), then we obtain $n^2$ real equalities (write them for $n=2$). The previous equalities are algebraically independent; that implies that a unitary matrix depends on $n^2$ real parameters.
In the body of text, I change the notation $SU_n$ with the standard one $U_n$.
Let $U_n={U=[u_{i,j}]in M_n(mathbb{C})|UU^*=I_n}$ (the other equality $U^*U=I_n$ is useless). $f:Urightarrow UU^*-I$ is not an algebraic function in the $(u_{i,j})$; yet, it is an algebraic function in the $2n^2$ real variables $Re(u_{i,j}),Im(u_{i,j})$. Then $U_n$ is a real algebraic set defined by $f(U)=0$; note that $U_n$ is a group; then it suffices to study $U_n$ in a neighborhood of $I_n$. One has $Df_I:Hrightarrow H+H^*$; then the tangent space of $U_n$ in $I_n$ is ${H|Df_i(H)=H+H^*=0}$, that is the vector space $SH$ of skew-hermitian matrices. The number of real independent parameters defining $U_n$ is the dimension over $mathbb{R}$ of $SH$, that is $2dfrac{n(n-1)}{2}+n=n^2$.
Note that $f(U)=0$ is equivalent to $n^2$ real relations; that shows that $U_n$ depends at least on $2n^2-n^2=n^2$ parameters. That is above shows that theses $n^2$ relations are algebraically independent.
$endgroup$
add a comment |
$begingroup$
@ Wen Chern , since you do not know that $U^*U=I$ implies that $UU^*=I$, I think that you are not an eagle in the mathematical field. Since I have no response to my answer, I think that you did not understand one word of it. You can remember that follows: the $n^2$ complex relations $U^*U=I$ are not algebraically independent because both matrices $U^*U$ and $I$ are hermitian. If we consider the upper triangular parts of these matrices (included diagonals), then we obtain $n^2$ real equalities (write them for $n=2$). The previous equalities are algebraically independent; that implies that a unitary matrix depends on $n^2$ real parameters.
In the body of text, I change the notation $SU_n$ with the standard one $U_n$.
Let $U_n={U=[u_{i,j}]in M_n(mathbb{C})|UU^*=I_n}$ (the other equality $U^*U=I_n$ is useless). $f:Urightarrow UU^*-I$ is not an algebraic function in the $(u_{i,j})$; yet, it is an algebraic function in the $2n^2$ real variables $Re(u_{i,j}),Im(u_{i,j})$. Then $U_n$ is a real algebraic set defined by $f(U)=0$; note that $U_n$ is a group; then it suffices to study $U_n$ in a neighborhood of $I_n$. One has $Df_I:Hrightarrow H+H^*$; then the tangent space of $U_n$ in $I_n$ is ${H|Df_i(H)=H+H^*=0}$, that is the vector space $SH$ of skew-hermitian matrices. The number of real independent parameters defining $U_n$ is the dimension over $mathbb{R}$ of $SH$, that is $2dfrac{n(n-1)}{2}+n=n^2$.
Note that $f(U)=0$ is equivalent to $n^2$ real relations; that shows that $U_n$ depends at least on $2n^2-n^2=n^2$ parameters. That is above shows that theses $n^2$ relations are algebraically independent.
$endgroup$
@ Wen Chern , since you do not know that $U^*U=I$ implies that $UU^*=I$, I think that you are not an eagle in the mathematical field. Since I have no response to my answer, I think that you did not understand one word of it. You can remember that follows: the $n^2$ complex relations $U^*U=I$ are not algebraically independent because both matrices $U^*U$ and $I$ are hermitian. If we consider the upper triangular parts of these matrices (included diagonals), then we obtain $n^2$ real equalities (write them for $n=2$). The previous equalities are algebraically independent; that implies that a unitary matrix depends on $n^2$ real parameters.
In the body of text, I change the notation $SU_n$ with the standard one $U_n$.
Let $U_n={U=[u_{i,j}]in M_n(mathbb{C})|UU^*=I_n}$ (the other equality $U^*U=I_n$ is useless). $f:Urightarrow UU^*-I$ is not an algebraic function in the $(u_{i,j})$; yet, it is an algebraic function in the $2n^2$ real variables $Re(u_{i,j}),Im(u_{i,j})$. Then $U_n$ is a real algebraic set defined by $f(U)=0$; note that $U_n$ is a group; then it suffices to study $U_n$ in a neighborhood of $I_n$. One has $Df_I:Hrightarrow H+H^*$; then the tangent space of $U_n$ in $I_n$ is ${H|Df_i(H)=H+H^*=0}$, that is the vector space $SH$ of skew-hermitian matrices. The number of real independent parameters defining $U_n$ is the dimension over $mathbb{R}$ of $SH$, that is $2dfrac{n(n-1)}{2}+n=n^2$.
Note that $f(U)=0$ is equivalent to $n^2$ real relations; that shows that $U_n$ depends at least on $2n^2-n^2=n^2$ parameters. That is above shows that theses $n^2$ relations are algebraically independent.
edited Aug 21 '15 at 18:54
answered Aug 16 '15 at 20:25
loup blancloup blanc
22.6k21850
22.6k21850
add a comment |
add a comment |
$begingroup$
Let us assume that $U$ is an $ntimes n$ unitary matrix, i.e.,
begin{equation}
U^dagger U=I~~~~~~~~~~~~~~~~~~~~~~~~~~~~(1)
end{equation}
The total number of entries in a unitary matrix is $n^2$ and the total number of real parameters is $2n^2$.
Let us further assume that $z_{pq}=a_{pq}+ib_{pq}$ where $a_{pq},~b_{pq}inmathbb{R}$.
From the equation (1), one can write
begin{eqnarray}
sum_{k=1}^n z_{ik}^dagger z_{kj}&=&delta_{ij}\
sum_{k=1}^n bar z_{ki} z_{kj}&=&delta_{ij}~~~~~~~~~~~~~~~~(2)
end{eqnarray}
For $i=j$, the eq. (2) reduces to
begin{equation}
sum_{k=1}^n |z_{ki}|^2=1~~~~~~~~~~~~~~~~~~~~~(3)
end{equation}
Therefore, for $i=1,2,...,n$, eq.(3) represents $n$ independent real conditions.
For if $ine j$, $i leftrightarrow j$, the eq. (2) remains the same. This gives $binom{n}{2}$ independent equations, therefore, $2timesbinom{n}{2}$ real conditions:
begin{eqnarray}
sum_{k=1}^n (a_{ki}a_{kj}+b_{ki}b_{kj})&=&0\
sum_{k=1}^n (a_{ki}b_{kj}+a_{kj}b_{ki})&=&0.
end{eqnarray}
Total number of independent real conditions is $n+2timesbinom{n}{2}=n^2$.
Therefore, the total number of independent real parameters (components) $=$ Total number of real parameters $-$ total number of independent real conditions.
begin{equation}
N=2n^2-n^2=n^2.
end{equation}
$endgroup$
add a comment |
$begingroup$
Let us assume that $U$ is an $ntimes n$ unitary matrix, i.e.,
begin{equation}
U^dagger U=I~~~~~~~~~~~~~~~~~~~~~~~~~~~~(1)
end{equation}
The total number of entries in a unitary matrix is $n^2$ and the total number of real parameters is $2n^2$.
Let us further assume that $z_{pq}=a_{pq}+ib_{pq}$ where $a_{pq},~b_{pq}inmathbb{R}$.
From the equation (1), one can write
begin{eqnarray}
sum_{k=1}^n z_{ik}^dagger z_{kj}&=&delta_{ij}\
sum_{k=1}^n bar z_{ki} z_{kj}&=&delta_{ij}~~~~~~~~~~~~~~~~(2)
end{eqnarray}
For $i=j$, the eq. (2) reduces to
begin{equation}
sum_{k=1}^n |z_{ki}|^2=1~~~~~~~~~~~~~~~~~~~~~(3)
end{equation}
Therefore, for $i=1,2,...,n$, eq.(3) represents $n$ independent real conditions.
For if $ine j$, $i leftrightarrow j$, the eq. (2) remains the same. This gives $binom{n}{2}$ independent equations, therefore, $2timesbinom{n}{2}$ real conditions:
begin{eqnarray}
sum_{k=1}^n (a_{ki}a_{kj}+b_{ki}b_{kj})&=&0\
sum_{k=1}^n (a_{ki}b_{kj}+a_{kj}b_{ki})&=&0.
end{eqnarray}
Total number of independent real conditions is $n+2timesbinom{n}{2}=n^2$.
Therefore, the total number of independent real parameters (components) $=$ Total number of real parameters $-$ total number of independent real conditions.
begin{equation}
N=2n^2-n^2=n^2.
end{equation}
$endgroup$
add a comment |
$begingroup$
Let us assume that $U$ is an $ntimes n$ unitary matrix, i.e.,
begin{equation}
U^dagger U=I~~~~~~~~~~~~~~~~~~~~~~~~~~~~(1)
end{equation}
The total number of entries in a unitary matrix is $n^2$ and the total number of real parameters is $2n^2$.
Let us further assume that $z_{pq}=a_{pq}+ib_{pq}$ where $a_{pq},~b_{pq}inmathbb{R}$.
From the equation (1), one can write
begin{eqnarray}
sum_{k=1}^n z_{ik}^dagger z_{kj}&=&delta_{ij}\
sum_{k=1}^n bar z_{ki} z_{kj}&=&delta_{ij}~~~~~~~~~~~~~~~~(2)
end{eqnarray}
For $i=j$, the eq. (2) reduces to
begin{equation}
sum_{k=1}^n |z_{ki}|^2=1~~~~~~~~~~~~~~~~~~~~~(3)
end{equation}
Therefore, for $i=1,2,...,n$, eq.(3) represents $n$ independent real conditions.
For if $ine j$, $i leftrightarrow j$, the eq. (2) remains the same. This gives $binom{n}{2}$ independent equations, therefore, $2timesbinom{n}{2}$ real conditions:
begin{eqnarray}
sum_{k=1}^n (a_{ki}a_{kj}+b_{ki}b_{kj})&=&0\
sum_{k=1}^n (a_{ki}b_{kj}+a_{kj}b_{ki})&=&0.
end{eqnarray}
Total number of independent real conditions is $n+2timesbinom{n}{2}=n^2$.
Therefore, the total number of independent real parameters (components) $=$ Total number of real parameters $-$ total number of independent real conditions.
begin{equation}
N=2n^2-n^2=n^2.
end{equation}
$endgroup$
Let us assume that $U$ is an $ntimes n$ unitary matrix, i.e.,
begin{equation}
U^dagger U=I~~~~~~~~~~~~~~~~~~~~~~~~~~~~(1)
end{equation}
The total number of entries in a unitary matrix is $n^2$ and the total number of real parameters is $2n^2$.
Let us further assume that $z_{pq}=a_{pq}+ib_{pq}$ where $a_{pq},~b_{pq}inmathbb{R}$.
From the equation (1), one can write
begin{eqnarray}
sum_{k=1}^n z_{ik}^dagger z_{kj}&=&delta_{ij}\
sum_{k=1}^n bar z_{ki} z_{kj}&=&delta_{ij}~~~~~~~~~~~~~~~~(2)
end{eqnarray}
For $i=j$, the eq. (2) reduces to
begin{equation}
sum_{k=1}^n |z_{ki}|^2=1~~~~~~~~~~~~~~~~~~~~~(3)
end{equation}
Therefore, for $i=1,2,...,n$, eq.(3) represents $n$ independent real conditions.
For if $ine j$, $i leftrightarrow j$, the eq. (2) remains the same. This gives $binom{n}{2}$ independent equations, therefore, $2timesbinom{n}{2}$ real conditions:
begin{eqnarray}
sum_{k=1}^n (a_{ki}a_{kj}+b_{ki}b_{kj})&=&0\
sum_{k=1}^n (a_{ki}b_{kj}+a_{kj}b_{ki})&=&0.
end{eqnarray}
Total number of independent real conditions is $n+2timesbinom{n}{2}=n^2$.
Therefore, the total number of independent real parameters (components) $=$ Total number of real parameters $-$ total number of independent real conditions.
begin{equation}
N=2n^2-n^2=n^2.
end{equation}
answered Sep 23 '18 at 5:43
mhmuradmhmurad
212
212
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%2f1398789%2fnumber-of-independent-components-of-a-unitary-matrix%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
7
$begingroup$
Quite generally, for square matrices, $AB=I$ implies $BA=I$.
$endgroup$
– WillO
Aug 14 '15 at 2:18
5
$begingroup$
Both equations are necessary if $U$ is infinite dimensional. Consider a Hilbert space with orthonormal basis labelled by the natural numbers, and let $U$ be the shift operator that maps the $n$-th basis vector to the $n+1$-th; the adjoint of $U$ is noninvertible. Hence, $U^dagger U=I$, but $UU^dagger neq I$.
$endgroup$
– Couchyam
Aug 14 '15 at 2:28
5
$begingroup$
That's not a physics question. (If it was phrased as one, it'd still be off-topic as homework-like)
$endgroup$
– ACuriousMind
Aug 14 '15 at 2:43
2
$begingroup$
Hint: An complex $ntimes n$ matrix contains $2n^2$ real d.o.f.
$endgroup$
– Qmechanic
Aug 14 '15 at 10:02