How to Solve B^3 = A^2 Matrix 2x2 on C?

  • Context: Graduate 
  • Thread starter Thread starter maria papadakh
  • Start date Start date
  • Tags Tags
    Matrix
Click For Summary

Discussion Overview

The discussion revolves around solving the matrix equation \( B^3 = A^2 \) for \( 2 \times 2 \) matrices \( A \) and \( B \) within the context of linear algebra and matrix theory. Participants explore various mathematical approaches, including the Cayley-Hamilton theorem, Jordan normal form, spectral decomposition, and Hilbert's Nullstellensatz.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • Some participants suggest using the Cayley-Hamilton theorem but express uncertainty about its application.
  • Others propose that the Jordan normal form could be a viable method for solving the equation.
  • One participant argues that spectral decomposition might be effective, outlining a method involving eigenvectors and diagonal matrices.
  • A later reply challenges the assumption that the diagonal matrix \( X \) can be used in the context of Jordan normal form, emphasizing the need to consider the structure of Jordan blocks.
  • Another participant discusses the implications of having different eigenvalues versus repeated eigenvalues in the context of Jordan normal form.
  • Hilbert's Nullstellensatz is mentioned as a potential tool, with some participants seeking clarification on its application to the problem.
  • Concerns are raised about the nature of the ideal defined by the polynomial equations involved, questioning whether it is always proper.
  • Some participants express confusion regarding abstract algebra concepts related to the discussion.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the best approach to solve the matrix equation. Multiple competing views remain, with differing opinions on the applicability of various mathematical theorems and methods.

Contextual Notes

Limitations include the dependence on the definitions of matrix types and the unresolved nature of the ideal defined by the polynomial equations. The discussion reflects a range of assumptions about the properties of matrices and their eigenvalues.

Who May Find This Useful

Readers interested in linear algebra, matrix theory, or abstract algebra may find the discussion relevant, particularly those exploring the application of theorems like Cayley-Hamilton and Hilbert's Nullstellensatz in matrix equations.

maria papadakh
Messages
10
Reaction score
0
TL;DR
if A matrix 2x2 on C show that there is a 2x2 matrix B on C that B^3=A^2
i know that there is the Cayley -Hamilton theorem but i don't know if i can use it and how.Do you have any ideas about it?Please give me any help.
 
Physics news on Phys.org
My rifle would be Hilbert's Nullstellensatz but I assume that the canonical Jordan normal form will do.
 
  • Like
Likes   Reactions: maria papadakh
i will try with the jordan normal form.thank you!
 
could it be finished? btw, jordan normal form contains the hamilton-caley theorem. if you regard jordan normal as correct, then it's obvious that hamilton-caley holds.
 
  • Like
Likes   Reactions: maria papadakh
Spectral decomposition might work. Put ##A^2 = T^{-1}XT##, where ##T## is the matrix with column vectors as eigenvectors and ##X## is a diagonal matrix with eigenvalues on the diagonal. Pick ##Y^3=X##, then ##B := T^{-1}YT## should do the trick.
 
  • Like
Likes   Reactions: Paul Colby
nuuskur said:
Spectral decomposition might work. Put ##A^2 = T^{-1}XT##, where ##T## is the matrix with column vectors as eigenvectors and ##X## is a diagonal matrix with eigenvalues on the diagonal. Pick ##Y^3=X##, then ##B := T^{-1}YT## should do the trick.
NO. I have finish this... is simply a calculation question after using jordan normal form(maybe the "scary"(at least I am scared)hilbert nullspace theorem could work out easier ). And you said that X is diag, which is not ture because Jordan normal form include and must include sth like this:
1 1 0 0 0
0 1 1 0 0
0 0 1 1 0
0 0 0 1 1
0 0 0 0 1
 
sry I haven't come to PF for a long time. And sry for I have worked out it many weeks ago but I forget to reply to you guys. my 'general math' way:
if A got two different eigenvalue, of course A's jordan normal form is a diagnal matrix, then B choose to be its ^1/3 (also diagnal) could work. but sometimes A could got two same eigenvalue and only one eigenvector, in that case A could be regarded as :
lambda 1
0 lambda
though it seems tough, but in fact you can sinply asume B is in a form like:
x y
0 x
then B^3=(x*Id+y*J)^3, where the Id refers to identity matrix,J refers to
0 1
0 0
J^2, viewed as linear functions could easily seems to be zero.(sth more should be said about J but I don't have the time to type it, sry)
then B^3 immediately could be calculated:
x^3 3x^2y
0 x^3
so you could easily choose x,y to make B^3=A^2(A= its jordan normal form)
 
Last edited:
fresh_42 said:
My rifle would be Hilbert's Nullstellensatz but I assume that the canonical Jordan normal form will do.
I really admire your comment here. could you please give a good understanding of hilbert nullspace theorem?
I thought in matrix maybe we have over any algebraic closed field F, any polynomial k[x] where the coefficient is in F, x choose from M_n[F], has a zero point? like a general version of the foundamental theorem of algebra.
 
graphking said:
I really admire your comment here. could you please give a good understanding of hilbert nullspace theorem?
I thought in matrix maybe we have over any algebraic closed field F, any polynomial k[x] where the coefficient is in F, x choose from M_n[F], has a zero point? like a general version of the foundamental theorem of algebra.
Yes, that's what Hilbert's Nullstellensatz says. ##B^3-A^2=0## are four polynomial equations over ##\mathbb{C}[a_{ij},b_{kl}]## which define a proper ideal, hence there is a common zero.
 
  • #10
fresh_42 said:
Yes, that's what Hilbert's Nullstellensatz says. ##B^3-A^2=0## are four polynomial equations over ##\mathbb{C}[a_{ij},b_{kl}]## which define a proper ideal, hence there is a common zero.
ok, seems I can't understand it fully(crying face), but thanks! i didnt learn well on abstract algebra(crying)
 
  • #11
fresh_42 said:
Yes, that's what Hilbert's Nullstellensatz says. ##B^3-A^2=0## are four polynomial equations over ##\mathbb{C}[a_{ij},b_{kl}]## which define a proper ideal, hence there is a common zero.

I don't think this is a good argument. The matrix ##A## is fixed so it is really just a set of equations over the ##b_{kl}.## But anyway, how do you know that the ideal is proper? Showing this looks to be just as hard as the original problem. For example, it's not true that every matrix has a square root but how would you know that the ideal defined by ##B^3-A^2## is always proper but the ideal defined by ##B^2-A## might not be?

I think considering the Jordan type of ##A## is best way to go.
 
  • Like
Likes   Reactions: StoneTemplePython
  • #12
Maybe the Borel ( or otherwise) functional calculus?
 

Similar threads

  • · Replies 24 ·
Replies
24
Views
3K
  • · Replies 33 ·
2
Replies
33
Views
2K
  • · Replies 18 ·
Replies
18
Views
11K
  • · Replies 7 ·
Replies
7
Views
4K
  • · Replies 14 ·
Replies
14
Views
4K
  • · Replies 20 ·
Replies
20
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
13
Views
4K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K