Let P={z∈C:∣z+2−3i∣≤1} and Q={z∈C:z(1+i)+zˉ(1−i)≤−8}. Let in P∩Q, ∣z−3+2i∣ be maximum and minimum at z1 and z2 respectively. If ∣z1∣2+2∣z2∣2=α+β2, where α,β are integers, then α+β equals _____________.
Answer: 1
Solution
Key Concepts and Formulas
Complex Numbers as Points: Representing z=x+iy as a point (x,y) in the Cartesian plane.
Modulus and Distance:∣z−z0∣ represents the distance between complex numbers z and z0.
Regions in the Complex Plane:
∣z−z0∣≤r represents a closed disk centered at z0 with radius r.
az+aˉzˉ≤c represents a half-plane.
Step-by-Step Solution
Step 1: Analyze Region P
We are given P={z∈C:∣z+2−3i∣≤1}. We want to convert this complex inequality into a Cartesian one to understand the region geometrically. Let z=x+iy. Then:
∣(x+iy)+2−3i∣≤1∣(x+2)+i(y−3)∣≤1
Using the definition of modulus:
(x+2)2+(y−3)2≤1
Squaring both sides:
(x+2)2+(y−3)2≤1
This represents a closed disk centered at (−2,3) with radius 1. We denote the center as CP=(−2,3) and the radius as rP=1.
Step 2: Analyze Region Q
We are given Q={z∈C:z(1+i)+zˉ(1−i)≤−8}. Again, let z=x+iy, so zˉ=x−iy. We want to convert this into a Cartesian inequality.
This represents a half-plane bounded by the line x−y+4=0. We denote this line as L2:x−y+4=0. The region Q consists of all points (x,y) on or to the left of this line.
Step 3: Verify Intersection of P and Q
To ensure that the intersection P∩Q is non-empty, we calculate the perpendicular distance from the center of the disk CP(−2,3) to the line L2:x−y+4=0. The formula for the distance from a point (x0,y0) to a line Ax+By+C=0 is d=A2+B2∣Ax0+By0+C∣.
Since d=21<1=rP, the line L2 intersects the disk P. Therefore, P∩Q is non-empty.
Step 4: Identify the Target Function for Maximization/Minimization
We need to find z1,z2∈P∩Q such that ∣z−3+2i∣ is maximum and minimum, respectively. Let A be the point (3,−2) in the complex plane (corresponding to 3−2i). The expression ∣z−(3−2i)∣ represents the distance from any point z(x,y) to the fixed point A(3,−2). We want to find the points in P∩Q farthest from and closest to A(3,−2).
Step 5: Finding z1 (Maximum Distance)
The point farthest from A(3,−2) will lie on the boundary of P∩Q. It is likely to be on the circle boundary along the line connecting A and the center of the circle CP. Let's call this line L1. The slope of L1 is m=−2−33−(−2)=−55=−1. Using the point-slope form with A(3,−2):
y−(−2)=−1(x−3)y+2=−x+3L1:x+y−1=0
Now we find the intersection points of L1 and the circle (x+2)2+(y−3)2=1. From L1, y=1−x. Substitute into the circle equation:
For each x value, find the corresponding y using y=1−x:
If x=−2+21, then y=1−(−2+21)=3−21. Point ZA=(−2+21,3−21).
If x=−2−21, then y=1−(−2−21)=3+21. Point ZB=(−2−21,3+21).
Check which points lie in region Q (i.e., satisfy x−y+4≤0):
For ZA: x−y+4=(−2+21)−(3−21)+4=−1+2>0. So ZA is not in Q.
For ZB: x−y+4=(−2−21)−(3+21)+4=−1−2<0. So ZB is in Q.
Since ZB is farther from A and is in P∩Q, z1=(−2−21)+i(3+21).
Step 6: Finding z2 (Minimum Distance)
The minimum distance from A(3,−2) to P∩Q occurs on the boundary. The closest point on the circle to A is ZA, but it's not in Q. Therefore, the minimum distance must occur on the line L2. The closest point on L2 to A is the foot of the perpendicular from A to L2. The line through A perpendicular to L2 has slope −1 and equation x+y−1=0, which is L1. So we find the intersection of L1 and L2:
x+y−1=0x−y+4=0
Adding the equations: 2x+3=0⟹x=−23. Substituting into L1: −23+y−1=0⟹y=25. So the intersection point is ZC=(−23,25).
Verify that ZC is within the disk P:
(−23+2)2+(25−3)2=(21)2+(−21)2=41+41=21≤1
Since ZC is in P and on L2, it's in P∩Q. Therefore, z2=−23+i25.
Comparing with α+β2, we have α=31 and β=5. Therefore, α+β=31+5=36.
Common Mistakes & Tips
Incorrectly Assuming Extrema on the Circle: The minimum distance point isn't necessarily on the circle if the closest point on the unconstrained circle is outside the feasible region.
Not Checking Intersection: Always verify that the regions intersect before proceeding.
Careless Calculation: Be extra careful with signs and fractions when expanding and simplifying.
Summary
By converting the complex inequalities to Cartesian coordinates, we identified the feasible region as the intersection of a disk and a half-plane. We found the points in this region that maximized and minimized the distance to a given point by considering the geometry and the boundaries of the region. Finally, we calculated the requested expression, obtaining α+β=36.