Rank of a Differential$(n - 1)$-dimensional submanifold of the manifold $mathbb R^n$What is the codimension of matrices of rank $r$ as a manifold?Find an atlas for $M=(x,y,z)inmathbbR^3:x^2+y^2=1+z^2$Expression for derivative of cross product of two vectors in $S^2$Tangent Space of matrices with same rankProve that M is a submanifold of $mathbbC^2$Find Jacobian and rank of differential. Inverse function theorem.Vector as whole differentiated has different result compared to element-wiseDifferential Forms and Applications by do Carmo - Divergence theoremSubmersions in differential topology
Physical Interpretation of an Overdamped Pendulum
What is the spellcasting ability of a Barbarian Totem Warrior?
The space of cusp forms for GL_2 over F_q(T)
Airline power sockets shut down when I plug my computer in. How can I avoid that?
Is there a word for returning to unpreparedness?
Can anyone help me what's wrong here as i can prove 0 = 1?
Can anybody tell me who this Pokemon is?
How do ultra-stable oscillators for spacecraft work?
How can I enter recovery mode (for Mac OS, on an iMac) remotely?
Are there any cons in using rounded corners for bar graphs?
What if a restaurant suddenly cannot accept credit cards, and the customer has no cash?
Typesetting "hollow slash"
A Magic Diamond
What allows us to use imaginary numbers?
A+ rating still unsecure by Google Chrome's opinion
100 Years of GCHQ - A quick afternoon puzzle!
Set theory with antielements?
Why does "auf der Strecke bleiben" mean "to fall by the wayside"?
Why do we use low resistance cables to minimize power losses?
What was the intention with the Commodore 128?
Why don't modern jet engines use forced exhaust mixing?
Scam? Phone call from "Department of Social Security" asking me to call back
What exactly happened to the 18 crew members who were reported as "missing" in "Q Who"?
Eric Andre had a dream
Rank of a Differential
$(n - 1)$-dimensional submanifold of the manifold $mathbb R^n$What is the codimension of matrices of rank $r$ as a manifold?Find an atlas for $M=(x,y,z)inmathbbR^3:x^2+y^2=1+z^2$Expression for derivative of cross product of two vectors in $S^2$Tangent Space of matrices with same rankProve that M is a submanifold of $mathbbC^2$Find Jacobian and rank of differential. Inverse function theorem.Vector as whole differentiated has different result compared to element-wiseDifferential Forms and Applications by do Carmo - Divergence theoremSubmersions in differential topology
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;
$begingroup$
This a mostly a sanity check sort of thing. I am working with the map given by
$$F:M_2times 2(mathbbR)rightarrow S_2times 2(mathbbR):Amapsto A^t J A$$
where J is the matrix
$$J = beginpmatrix 1 & 0 \ 0 & -1endpmatrix.$$
I am trying to show that the set $S = A : F(A) = J$ is a smooth submanifold of $M$. I know that I need to use the Regular Level Set Theorem to do this, but I am having trouble showing $DF$ will have maximal rank for that the matrices in $S$ (which I have already shown contains only invertible matrices). Using the canonical isomorphism on $M_2times 2(mathbbR)cong mathbbR^4$ described by $beginpmatrixa_1 & a_2\ a_3 & a_4endpmatrixmapsto (a_1,a_2,a_3,a_4)$ and the similar one on $S_2times 2(mathbbR)cong mathbbR^3$, I computed
$$F(a_1,a_2,a_3,a_4) = (a_1^2 - a_3^2, a_1a_2 - a_3a_4, a_2^2 - a_4^2)$$
which gives us that
$$DF = beginpmatrix 2a_1 & 0 & -2a_3 & 0\
a_1 & a_2 & -a_3 & -a_4\
0 & 2a_2 & 0 & -2a_4endpmatrix.$$
My problem is that I think that this matrix can never be full rank since the center row can always be eliminated. Have I done something wrong here? Can anyone verify for me under what conditions $DF$ would be surjective?
differential-geometry jacobian submanifold
$endgroup$
|
show 1 more comment
$begingroup$
This a mostly a sanity check sort of thing. I am working with the map given by
$$F:M_2times 2(mathbbR)rightarrow S_2times 2(mathbbR):Amapsto A^t J A$$
where J is the matrix
$$J = beginpmatrix 1 & 0 \ 0 & -1endpmatrix.$$
I am trying to show that the set $S = A : F(A) = J$ is a smooth submanifold of $M$. I know that I need to use the Regular Level Set Theorem to do this, but I am having trouble showing $DF$ will have maximal rank for that the matrices in $S$ (which I have already shown contains only invertible matrices). Using the canonical isomorphism on $M_2times 2(mathbbR)cong mathbbR^4$ described by $beginpmatrixa_1 & a_2\ a_3 & a_4endpmatrixmapsto (a_1,a_2,a_3,a_4)$ and the similar one on $S_2times 2(mathbbR)cong mathbbR^3$, I computed
$$F(a_1,a_2,a_3,a_4) = (a_1^2 - a_3^2, a_1a_2 - a_3a_4, a_2^2 - a_4^2)$$
which gives us that
$$DF = beginpmatrix 2a_1 & 0 & -2a_3 & 0\
a_1 & a_2 & -a_3 & -a_4\
0 & 2a_2 & 0 & -2a_4endpmatrix.$$
My problem is that I think that this matrix can never be full rank since the center row can always be eliminated. Have I done something wrong here? Can anyone verify for me under what conditions $DF$ would be surjective?
differential-geometry jacobian submanifold
$endgroup$
$begingroup$
No, double-check your arithmetic. The minus signs don't allow you to eliminate the second row.
$endgroup$
– Ted Shifrin
Aug 5 at 0:58
$begingroup$
Ah, I made a typo. It should be fixed now.
$endgroup$
– peabody
Aug 5 at 1:02
$begingroup$
Well, OK, your second row needs to have columns swapped.
$endgroup$
– Ted Shifrin
Aug 5 at 1:05
$begingroup$
I'm terribly sorry, I don't see what you mean. The differential is computed using $$DF = left(fracpartial F^ipartial a^jright),$$ correct?
$endgroup$
– peabody
Aug 5 at 1:09
$begingroup$
The second row should be $a_2 a_1 -a_4 -a_3$.
$endgroup$
– Ted Shifrin
Aug 5 at 1:11
|
show 1 more comment
$begingroup$
This a mostly a sanity check sort of thing. I am working with the map given by
$$F:M_2times 2(mathbbR)rightarrow S_2times 2(mathbbR):Amapsto A^t J A$$
where J is the matrix
$$J = beginpmatrix 1 & 0 \ 0 & -1endpmatrix.$$
I am trying to show that the set $S = A : F(A) = J$ is a smooth submanifold of $M$. I know that I need to use the Regular Level Set Theorem to do this, but I am having trouble showing $DF$ will have maximal rank for that the matrices in $S$ (which I have already shown contains only invertible matrices). Using the canonical isomorphism on $M_2times 2(mathbbR)cong mathbbR^4$ described by $beginpmatrixa_1 & a_2\ a_3 & a_4endpmatrixmapsto (a_1,a_2,a_3,a_4)$ and the similar one on $S_2times 2(mathbbR)cong mathbbR^3$, I computed
$$F(a_1,a_2,a_3,a_4) = (a_1^2 - a_3^2, a_1a_2 - a_3a_4, a_2^2 - a_4^2)$$
which gives us that
$$DF = beginpmatrix 2a_1 & 0 & -2a_3 & 0\
a_1 & a_2 & -a_3 & -a_4\
0 & 2a_2 & 0 & -2a_4endpmatrix.$$
My problem is that I think that this matrix can never be full rank since the center row can always be eliminated. Have I done something wrong here? Can anyone verify for me under what conditions $DF$ would be surjective?
differential-geometry jacobian submanifold
$endgroup$
This a mostly a sanity check sort of thing. I am working with the map given by
$$F:M_2times 2(mathbbR)rightarrow S_2times 2(mathbbR):Amapsto A^t J A$$
where J is the matrix
$$J = beginpmatrix 1 & 0 \ 0 & -1endpmatrix.$$
I am trying to show that the set $S = A : F(A) = J$ is a smooth submanifold of $M$. I know that I need to use the Regular Level Set Theorem to do this, but I am having trouble showing $DF$ will have maximal rank for that the matrices in $S$ (which I have already shown contains only invertible matrices). Using the canonical isomorphism on $M_2times 2(mathbbR)cong mathbbR^4$ described by $beginpmatrixa_1 & a_2\ a_3 & a_4endpmatrixmapsto (a_1,a_2,a_3,a_4)$ and the similar one on $S_2times 2(mathbbR)cong mathbbR^3$, I computed
$$F(a_1,a_2,a_3,a_4) = (a_1^2 - a_3^2, a_1a_2 - a_3a_4, a_2^2 - a_4^2)$$
which gives us that
$$DF = beginpmatrix 2a_1 & 0 & -2a_3 & 0\
a_1 & a_2 & -a_3 & -a_4\
0 & 2a_2 & 0 & -2a_4endpmatrix.$$
My problem is that I think that this matrix can never be full rank since the center row can always be eliminated. Have I done something wrong here? Can anyone verify for me under what conditions $DF$ would be surjective?
differential-geometry jacobian submanifold
differential-geometry jacobian submanifold
edited Aug 5 at 1:01
peabody
asked Aug 5 at 0:47
peabodypeabody
748 bronze badges
748 bronze badges
$begingroup$
No, double-check your arithmetic. The minus signs don't allow you to eliminate the second row.
$endgroup$
– Ted Shifrin
Aug 5 at 0:58
$begingroup$
Ah, I made a typo. It should be fixed now.
$endgroup$
– peabody
Aug 5 at 1:02
$begingroup$
Well, OK, your second row needs to have columns swapped.
$endgroup$
– Ted Shifrin
Aug 5 at 1:05
$begingroup$
I'm terribly sorry, I don't see what you mean. The differential is computed using $$DF = left(fracpartial F^ipartial a^jright),$$ correct?
$endgroup$
– peabody
Aug 5 at 1:09
$begingroup$
The second row should be $a_2 a_1 -a_4 -a_3$.
$endgroup$
– Ted Shifrin
Aug 5 at 1:11
|
show 1 more comment
$begingroup$
No, double-check your arithmetic. The minus signs don't allow you to eliminate the second row.
$endgroup$
– Ted Shifrin
Aug 5 at 0:58
$begingroup$
Ah, I made a typo. It should be fixed now.
$endgroup$
– peabody
Aug 5 at 1:02
$begingroup$
Well, OK, your second row needs to have columns swapped.
$endgroup$
– Ted Shifrin
Aug 5 at 1:05
$begingroup$
I'm terribly sorry, I don't see what you mean. The differential is computed using $$DF = left(fracpartial F^ipartial a^jright),$$ correct?
$endgroup$
– peabody
Aug 5 at 1:09
$begingroup$
The second row should be $a_2 a_1 -a_4 -a_3$.
$endgroup$
– Ted Shifrin
Aug 5 at 1:11
$begingroup$
No, double-check your arithmetic. The minus signs don't allow you to eliminate the second row.
$endgroup$
– Ted Shifrin
Aug 5 at 0:58
$begingroup$
No, double-check your arithmetic. The minus signs don't allow you to eliminate the second row.
$endgroup$
– Ted Shifrin
Aug 5 at 0:58
$begingroup$
Ah, I made a typo. It should be fixed now.
$endgroup$
– peabody
Aug 5 at 1:02
$begingroup$
Ah, I made a typo. It should be fixed now.
$endgroup$
– peabody
Aug 5 at 1:02
$begingroup$
Well, OK, your second row needs to have columns swapped.
$endgroup$
– Ted Shifrin
Aug 5 at 1:05
$begingroup$
Well, OK, your second row needs to have columns swapped.
$endgroup$
– Ted Shifrin
Aug 5 at 1:05
$begingroup$
I'm terribly sorry, I don't see what you mean. The differential is computed using $$DF = left(fracpartial F^ipartial a^jright),$$ correct?
$endgroup$
– peabody
Aug 5 at 1:09
$begingroup$
I'm terribly sorry, I don't see what you mean. The differential is computed using $$DF = left(fracpartial F^ipartial a^jright),$$ correct?
$endgroup$
– peabody
Aug 5 at 1:09
$begingroup$
The second row should be $a_2 a_1 -a_4 -a_3$.
$endgroup$
– Ted Shifrin
Aug 5 at 1:11
$begingroup$
The second row should be $a_2 a_1 -a_4 -a_3$.
$endgroup$
– Ted Shifrin
Aug 5 at 1:11
|
show 1 more comment
2 Answers
2
active
oldest
votes
$begingroup$
Slightly more abstractly (rather than resorting to coordinates):
Note that $df_A(B) = B^top JA + A^top JB$. Given a arbitrary symmetric matrix $C$, we wish to find $B$ so that $df_A(B) = C$. Since you already observed that any $Ain f^-1(J)$ must be invertible, take
$$B = tfrac12 J(A^-1)^top C,$$
and check that $df_A(B) = C$, as desired.
The advantage of this sort of approach is that it will work nicely in higher dimensions, whereas the coordinate approach is very awkward.
$endgroup$
$begingroup$
Oh, this is a very nice way of approaching it. Thank you!
$endgroup$
– peabody
Aug 5 at 1:10
add a comment |
$begingroup$
Ok, I just wanted to add a post showing another way of answering this question that is more in line with the structure posted in the question itself. This is NOT an elegant solution like the one provided above by Ted Shifrin (Thank you again!), but I think it might be useful for some people seeing this later to have both methods available to them.
Anyway, the matrix for $DF$ that is provided above is wrong. The correct matrix for the differential is given by
$$DF = beginpmatrix
2a_1 & 0 & -2a_3 & 0\
a_2 & a_1 & -a_4 & -a_3\
0 & 2a_2 & 0 & -2a_4
endpmatrix,$$
and to use the Regular Level Set Theorem, we need the map $DF$ to be surjective which is equivalent to the matrix representation of $DF$ having maximal rank (3 in this case). There are two ways for the above matrix to drop rank: either we eliminate the middle row, or we eliminate the right two columns. Using row operations we can see that an attempt to reduce the middle row would result in the matrix
$$beginpmatrix
2a_1 & 0 & -2a_3 & 0\
2(a_1 + a_2) & 2(a_1 + a_2) & -2(a_3 + a_4) & -2(a_3 + a_4)\
0 & 2a_2 & 0 & -2a_4
endpmatrix$$
which will drop rank precicely when $a_1 = -a_2$ and $a_3 = -a_4$ $(*)$. Similarly, an attempt to reduce the right two columns will result in the matrix
$$beginpmatrix
2a_1 & 0 & 2(a_1 - a_3) & 0\
a_2 & a_1 & a_2-a_4 & a_1-a_3\
0 & 2a_2 & 0 & 2(a_2 - a_4)
endpmatrix$$
which will drop rank when $a_1 = a_3$ and $a_2 = a_4$ $(**)$. If a matrix $A$ satisfies $(*)$ or $(**)$, we will have that $det(A) = 0$, so, as long as all of the matrices $A$ that satisfy the condition $A^tJA = J$ do not have determinant 0, we will have that $J$ is a regular value and the set $S = A : A^tJA = J = F^-1(J)$ is a regular level set. This does turn out to be the case, as can be verified using properties of the determinant, so $S$ is a smooth submanifold by the Regular Level Set Theorem as desired.
$endgroup$
add a comment |
Your Answer
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%2f3313769%2frank-of-a-differential%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$
Slightly more abstractly (rather than resorting to coordinates):
Note that $df_A(B) = B^top JA + A^top JB$. Given a arbitrary symmetric matrix $C$, we wish to find $B$ so that $df_A(B) = C$. Since you already observed that any $Ain f^-1(J)$ must be invertible, take
$$B = tfrac12 J(A^-1)^top C,$$
and check that $df_A(B) = C$, as desired.
The advantage of this sort of approach is that it will work nicely in higher dimensions, whereas the coordinate approach is very awkward.
$endgroup$
$begingroup$
Oh, this is a very nice way of approaching it. Thank you!
$endgroup$
– peabody
Aug 5 at 1:10
add a comment |
$begingroup$
Slightly more abstractly (rather than resorting to coordinates):
Note that $df_A(B) = B^top JA + A^top JB$. Given a arbitrary symmetric matrix $C$, we wish to find $B$ so that $df_A(B) = C$. Since you already observed that any $Ain f^-1(J)$ must be invertible, take
$$B = tfrac12 J(A^-1)^top C,$$
and check that $df_A(B) = C$, as desired.
The advantage of this sort of approach is that it will work nicely in higher dimensions, whereas the coordinate approach is very awkward.
$endgroup$
$begingroup$
Oh, this is a very nice way of approaching it. Thank you!
$endgroup$
– peabody
Aug 5 at 1:10
add a comment |
$begingroup$
Slightly more abstractly (rather than resorting to coordinates):
Note that $df_A(B) = B^top JA + A^top JB$. Given a arbitrary symmetric matrix $C$, we wish to find $B$ so that $df_A(B) = C$. Since you already observed that any $Ain f^-1(J)$ must be invertible, take
$$B = tfrac12 J(A^-1)^top C,$$
and check that $df_A(B) = C$, as desired.
The advantage of this sort of approach is that it will work nicely in higher dimensions, whereas the coordinate approach is very awkward.
$endgroup$
Slightly more abstractly (rather than resorting to coordinates):
Note that $df_A(B) = B^top JA + A^top JB$. Given a arbitrary symmetric matrix $C$, we wish to find $B$ so that $df_A(B) = C$. Since you already observed that any $Ain f^-1(J)$ must be invertible, take
$$B = tfrac12 J(A^-1)^top C,$$
and check that $df_A(B) = C$, as desired.
The advantage of this sort of approach is that it will work nicely in higher dimensions, whereas the coordinate approach is very awkward.
answered Aug 5 at 1:04
Ted ShifrinTed Shifrin
68.6k4 gold badges48 silver badges94 bronze badges
68.6k4 gold badges48 silver badges94 bronze badges
$begingroup$
Oh, this is a very nice way of approaching it. Thank you!
$endgroup$
– peabody
Aug 5 at 1:10
add a comment |
$begingroup$
Oh, this is a very nice way of approaching it. Thank you!
$endgroup$
– peabody
Aug 5 at 1:10
$begingroup$
Oh, this is a very nice way of approaching it. Thank you!
$endgroup$
– peabody
Aug 5 at 1:10
$begingroup$
Oh, this is a very nice way of approaching it. Thank you!
$endgroup$
– peabody
Aug 5 at 1:10
add a comment |
$begingroup$
Ok, I just wanted to add a post showing another way of answering this question that is more in line with the structure posted in the question itself. This is NOT an elegant solution like the one provided above by Ted Shifrin (Thank you again!), but I think it might be useful for some people seeing this later to have both methods available to them.
Anyway, the matrix for $DF$ that is provided above is wrong. The correct matrix for the differential is given by
$$DF = beginpmatrix
2a_1 & 0 & -2a_3 & 0\
a_2 & a_1 & -a_4 & -a_3\
0 & 2a_2 & 0 & -2a_4
endpmatrix,$$
and to use the Regular Level Set Theorem, we need the map $DF$ to be surjective which is equivalent to the matrix representation of $DF$ having maximal rank (3 in this case). There are two ways for the above matrix to drop rank: either we eliminate the middle row, or we eliminate the right two columns. Using row operations we can see that an attempt to reduce the middle row would result in the matrix
$$beginpmatrix
2a_1 & 0 & -2a_3 & 0\
2(a_1 + a_2) & 2(a_1 + a_2) & -2(a_3 + a_4) & -2(a_3 + a_4)\
0 & 2a_2 & 0 & -2a_4
endpmatrix$$
which will drop rank precicely when $a_1 = -a_2$ and $a_3 = -a_4$ $(*)$. Similarly, an attempt to reduce the right two columns will result in the matrix
$$beginpmatrix
2a_1 & 0 & 2(a_1 - a_3) & 0\
a_2 & a_1 & a_2-a_4 & a_1-a_3\
0 & 2a_2 & 0 & 2(a_2 - a_4)
endpmatrix$$
which will drop rank when $a_1 = a_3$ and $a_2 = a_4$ $(**)$. If a matrix $A$ satisfies $(*)$ or $(**)$, we will have that $det(A) = 0$, so, as long as all of the matrices $A$ that satisfy the condition $A^tJA = J$ do not have determinant 0, we will have that $J$ is a regular value and the set $S = A : A^tJA = J = F^-1(J)$ is a regular level set. This does turn out to be the case, as can be verified using properties of the determinant, so $S$ is a smooth submanifold by the Regular Level Set Theorem as desired.
$endgroup$
add a comment |
$begingroup$
Ok, I just wanted to add a post showing another way of answering this question that is more in line with the structure posted in the question itself. This is NOT an elegant solution like the one provided above by Ted Shifrin (Thank you again!), but I think it might be useful for some people seeing this later to have both methods available to them.
Anyway, the matrix for $DF$ that is provided above is wrong. The correct matrix for the differential is given by
$$DF = beginpmatrix
2a_1 & 0 & -2a_3 & 0\
a_2 & a_1 & -a_4 & -a_3\
0 & 2a_2 & 0 & -2a_4
endpmatrix,$$
and to use the Regular Level Set Theorem, we need the map $DF$ to be surjective which is equivalent to the matrix representation of $DF$ having maximal rank (3 in this case). There are two ways for the above matrix to drop rank: either we eliminate the middle row, or we eliminate the right two columns. Using row operations we can see that an attempt to reduce the middle row would result in the matrix
$$beginpmatrix
2a_1 & 0 & -2a_3 & 0\
2(a_1 + a_2) & 2(a_1 + a_2) & -2(a_3 + a_4) & -2(a_3 + a_4)\
0 & 2a_2 & 0 & -2a_4
endpmatrix$$
which will drop rank precicely when $a_1 = -a_2$ and $a_3 = -a_4$ $(*)$. Similarly, an attempt to reduce the right two columns will result in the matrix
$$beginpmatrix
2a_1 & 0 & 2(a_1 - a_3) & 0\
a_2 & a_1 & a_2-a_4 & a_1-a_3\
0 & 2a_2 & 0 & 2(a_2 - a_4)
endpmatrix$$
which will drop rank when $a_1 = a_3$ and $a_2 = a_4$ $(**)$. If a matrix $A$ satisfies $(*)$ or $(**)$, we will have that $det(A) = 0$, so, as long as all of the matrices $A$ that satisfy the condition $A^tJA = J$ do not have determinant 0, we will have that $J$ is a regular value and the set $S = A : A^tJA = J = F^-1(J)$ is a regular level set. This does turn out to be the case, as can be verified using properties of the determinant, so $S$ is a smooth submanifold by the Regular Level Set Theorem as desired.
$endgroup$
add a comment |
$begingroup$
Ok, I just wanted to add a post showing another way of answering this question that is more in line with the structure posted in the question itself. This is NOT an elegant solution like the one provided above by Ted Shifrin (Thank you again!), but I think it might be useful for some people seeing this later to have both methods available to them.
Anyway, the matrix for $DF$ that is provided above is wrong. The correct matrix for the differential is given by
$$DF = beginpmatrix
2a_1 & 0 & -2a_3 & 0\
a_2 & a_1 & -a_4 & -a_3\
0 & 2a_2 & 0 & -2a_4
endpmatrix,$$
and to use the Regular Level Set Theorem, we need the map $DF$ to be surjective which is equivalent to the matrix representation of $DF$ having maximal rank (3 in this case). There are two ways for the above matrix to drop rank: either we eliminate the middle row, or we eliminate the right two columns. Using row operations we can see that an attempt to reduce the middle row would result in the matrix
$$beginpmatrix
2a_1 & 0 & -2a_3 & 0\
2(a_1 + a_2) & 2(a_1 + a_2) & -2(a_3 + a_4) & -2(a_3 + a_4)\
0 & 2a_2 & 0 & -2a_4
endpmatrix$$
which will drop rank precicely when $a_1 = -a_2$ and $a_3 = -a_4$ $(*)$. Similarly, an attempt to reduce the right two columns will result in the matrix
$$beginpmatrix
2a_1 & 0 & 2(a_1 - a_3) & 0\
a_2 & a_1 & a_2-a_4 & a_1-a_3\
0 & 2a_2 & 0 & 2(a_2 - a_4)
endpmatrix$$
which will drop rank when $a_1 = a_3$ and $a_2 = a_4$ $(**)$. If a matrix $A$ satisfies $(*)$ or $(**)$, we will have that $det(A) = 0$, so, as long as all of the matrices $A$ that satisfy the condition $A^tJA = J$ do not have determinant 0, we will have that $J$ is a regular value and the set $S = A : A^tJA = J = F^-1(J)$ is a regular level set. This does turn out to be the case, as can be verified using properties of the determinant, so $S$ is a smooth submanifold by the Regular Level Set Theorem as desired.
$endgroup$
Ok, I just wanted to add a post showing another way of answering this question that is more in line with the structure posted in the question itself. This is NOT an elegant solution like the one provided above by Ted Shifrin (Thank you again!), but I think it might be useful for some people seeing this later to have both methods available to them.
Anyway, the matrix for $DF$ that is provided above is wrong. The correct matrix for the differential is given by
$$DF = beginpmatrix
2a_1 & 0 & -2a_3 & 0\
a_2 & a_1 & -a_4 & -a_3\
0 & 2a_2 & 0 & -2a_4
endpmatrix,$$
and to use the Regular Level Set Theorem, we need the map $DF$ to be surjective which is equivalent to the matrix representation of $DF$ having maximal rank (3 in this case). There are two ways for the above matrix to drop rank: either we eliminate the middle row, or we eliminate the right two columns. Using row operations we can see that an attempt to reduce the middle row would result in the matrix
$$beginpmatrix
2a_1 & 0 & -2a_3 & 0\
2(a_1 + a_2) & 2(a_1 + a_2) & -2(a_3 + a_4) & -2(a_3 + a_4)\
0 & 2a_2 & 0 & -2a_4
endpmatrix$$
which will drop rank precicely when $a_1 = -a_2$ and $a_3 = -a_4$ $(*)$. Similarly, an attempt to reduce the right two columns will result in the matrix
$$beginpmatrix
2a_1 & 0 & 2(a_1 - a_3) & 0\
a_2 & a_1 & a_2-a_4 & a_1-a_3\
0 & 2a_2 & 0 & 2(a_2 - a_4)
endpmatrix$$
which will drop rank when $a_1 = a_3$ and $a_2 = a_4$ $(**)$. If a matrix $A$ satisfies $(*)$ or $(**)$, we will have that $det(A) = 0$, so, as long as all of the matrices $A$ that satisfy the condition $A^tJA = J$ do not have determinant 0, we will have that $J$ is a regular value and the set $S = A : A^tJA = J = F^-1(J)$ is a regular level set. This does turn out to be the case, as can be verified using properties of the determinant, so $S$ is a smooth submanifold by the Regular Level Set Theorem as desired.
answered Aug 5 at 21:50
peabodypeabody
748 bronze badges
748 bronze badges
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%2f3313769%2frank-of-a-differential%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
$begingroup$
No, double-check your arithmetic. The minus signs don't allow you to eliminate the second row.
$endgroup$
– Ted Shifrin
Aug 5 at 0:58
$begingroup$
Ah, I made a typo. It should be fixed now.
$endgroup$
– peabody
Aug 5 at 1:02
$begingroup$
Well, OK, your second row needs to have columns swapped.
$endgroup$
– Ted Shifrin
Aug 5 at 1:05
$begingroup$
I'm terribly sorry, I don't see what you mean. The differential is computed using $$DF = left(fracpartial F^ipartial a^jright),$$ correct?
$endgroup$
– peabody
Aug 5 at 1:09
$begingroup$
The second row should be $a_2 a_1 -a_4 -a_3$.
$endgroup$
– Ted Shifrin
Aug 5 at 1:11