Analyzing the Setup
We are presented with a system of three linear equations representing planes in three-dimensional space:
x+2y+3z=1
3x+4y+5z=μ
4x+4y+4z=δ
Our objective is to identify the pair (μ,δ) that renders this system inconsistent, meaning the planes do not share a common point of intersection.
The Gatekeeper
The Determinant
For a system to be inconsistent, the determinant of the coefficient matrix D must be zero. Let us construct and evaluate this determinant:
Expanding along the first row:
D=1(16−20)−2(12−20)+3(12−16)
D=−4+16−12=0
Since D=0, the system is either inconsistent or possesses infinitely many solutions.
The Hidden Geometry
Row Dependence
To determine the nature of the system, we examine the relationship between the rows of the coefficient matrix. Let us test a linear combination of the first two rows:
2R2−2R1=2(3,4,5)−2(1,2,3)
2R2−2R1=(6,8,10)−(2,4,6)=(4,4,4)
This result is exactly the third row of our matrix. This confirms that the third row is linearly dependent on the first two, implying the third plane is geometrically constrained by the others.
The Broken Pattern
The Condition for Inconsistency
For the system to be consistent, the constants on the right-hand side must satisfy the same linear relationship derived from the rows:
Conversely, for the system to be inconsistent, this pattern must be broken. Therefore, the condition for inconsistency is:
The Final Verdict
We evaluate the potential pairs (μ,δ) against the consistency condition δ=2μ−2:
1. For (4,6): 2(4)−2=6. Since 6=6, the system is consistent.
2. For (3,4): 2(3)−2=4. Since 4=4, the system is consistent.
3. For (1,0): 2(1)−2=0. Since 0=0, the system is consistent.
4. For (4,3): 2(4)−2=6. Since $6
eq 3$, the pattern is broken.
The pair (4,3) makes the system inconsistent.