What is the solvability condition for the matrix equation A_1x_2 = A_2x_1?

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

Discussion Overview

The discussion revolves around the solvability condition for the matrix equation A_1x_2 = A_2x_1, where A_1 and A_2 are n×n matrices and x_1, x_2 are vectors in ℝ^n. Participants explore the implications of the matrices being singular and the conditions under which the equation can be solved.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested

Main Points Raised

  • One participant questions the solvability condition, suggesting that x_1^TA_2x_1 = 0 might be relevant but feels uncertain about the reasoning behind it.
  • Another participant inquires about the invertibility of the matrices A_i and the vectors x_i, noting that A_i are generally singular.
  • A later reply discusses the condition for solvability, stating that A_2x_1 must belong to the image of A_1, and relates this to the kernel of A_1^T.
  • It is mentioned that the condition x_1^TA_1x_1 = 0 is necessary but may not be sufficient in general.
  • One participant expresses frustration about the lack of symmetry conditions on the matrices A_i, which complicates the discussion.
  • Another participant indicates they have found a solution but does not share it with the group.

Areas of Agreement / Disagreement

Participants express uncertainty regarding the conditions for solvability, with multiple competing views on the implications of matrix properties and the relationships between the vectors and matrices involved. The discussion remains unresolved as no consensus is reached on the solvability condition.

Contextual Notes

Participants note the singular nature of the matrices and the implications of this on the solvability condition, but do not resolve the mathematical steps or assumptions involved.

Hootenanny
Staff Emeritus
Science Advisor
Gold Member
Messages
9,621
Reaction score
9
I have a quick question regarding matrix equations. Usually, I would look this up but unfortunately I'm away from the office and library and it can't wait until I get back.

Let [itex]A_1[/itex] and [itex]A_2[/itex] be [itex]n\times n[/itex] square matrices with real elements and let [itex]\boldsymbol{x}_1\;,\boldsymbol{x}_2\in\mathbb{R}^n[/itex]. Further, let [itex]A_1 \boldsymbol{x}_1 = \boldsymbol{0}[/itex]. What is the solvability condition for the following system?

[tex]A_1\boldsymbol{x}_2 = A_2\boldsymbol{x}_1[/tex]

The result would suggest [itex]\boldsymbol{x}_1^\text{T}A_2\boldsymbol{x}_1 = 0[/itex], but I'm clearly missing something. I fairly certain its something minor that I just can't see.

Any help would be very much appreciated.
 
Physics news on Phys.org
Can any of the x_{i} or A_{i} be inverted? (i.e., do you know anything about their determinants?)
 
kdbnlin78 said:
Can any of the x_{i} or A_{i} be inverted? (i.e., do you know anything about their determinants?)
[itex]\boldsymbol{x}_i[/itex] are vectors in [itex]\mathbb{R}^n[/itex], and [itex]A_i[/itex] are singular in general.
 
Apologies, can now see the x_{i} are vectors. I'm at work and scanning articles when no-one is looking.

I your reasoning has lead to to conclude that /boldsymbol{x_{1}^T}A_{1} = /boldsymbol{0} - How do you know this?
 
kdbnlin78 said:
Apologies, can now see the x_{i} are vectors. I'm at work and scanning articles when no-one is looking.

I your reasoning has lead to to conclude that /boldsymbol{x_{1}^T}A_{1} = /boldsymbol{0} - How do you know this?
No problem :)

I'm tracing back a result and I've found that the result would only hold if the above relation is true.

I only asked because I assumed that solvability condition for an equation of the forum that I posted in my original post would be fairly well known, or at least established.
 
Is your matrix symmetric by any chance?? In that case we have that

The thing is that

[tex]A_1x_2=A_2x_1[/tex]

has a solution if and only if [itex]A_2x_1\in im(A_1)[/tex].<br /> But we know that [itex]im(A_1)=ker(A_1^T)^\bot[/itex].<br /> So the system has a solution if and only if [itex]A_2x_1\in ker(A_1^T)^\bot=ker(A_1)^\bot[/itex].<br /> <br /> So it must hold that [itex]x_1^TA_1x_1=0[/itex]. I fear that this is not a sufficient condition in general...[/itex]
 
micromass said:
Is your matrix symmetric by any chance?? In that case we have that

The thing is that

[tex]A_1x_2=A_2x_1[/tex]

has a solution if and only if [itex]A_2x_1\in im(A_1)[/tex].<br /> But we know that [itex]im(A_1)=ker(A_1^T)^\bot[/itex].<br /> So the system has a solution if and only if [itex]A_2x_1\in ker(A_1^T)^\bot=ker(A_1)^\bot[/itex].<br /> <br /> So it must hold that [itex]x_1^TA_1x_1=0[/itex]. I fear that this is not a sufficient condition in general...[/itex]
[itex] That was my first thought as well. Alas, there are no symmetry conditions on the matrices [itex]A_i[/itex].[/itex]
 
Nevermind - I've figure it out :D
 
Hootenanny said:
Nevermind - I've figure it out :D

Can you tell us the solution?? :smile:
 

Similar threads

  • · Replies 0 ·
Replies
0
Views
610
Replies
15
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 34 ·
2
Replies
34
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K