Pj11 - Regions on the Argand diagram

Pj11 - Regions on the Argand diagram

Use complex inequalities to describe regions, including exactly which boundaries belong. You will combine circles, half-planes and angular sectors using intersections and unions, and check the result with particular points.

Inside, outside and the boundary

Does z=3z=3 belong to the region described by ∣z∣≤2|z|\le2 and Re⁡(z)≥1\operatorname{Re}(z)\ge1? What changes if “and” becomes “or”? One word changes the answer. First, we need to know what each inequality includes.

You already know

∣z−a∣=r|z-a|=r is a circle centred at aa, for r>0r>0. The expression ∣z−a∣|z-a| is a distance, so smaller values lie nearer the centre. ∣z−a∣=∣z−b∣|z-a|=|z-b| is a perpendicular bisector when a≠ba\ne b.

For example, ∣z−(1+i)∣<3|z-(1+i)|<3 includes the centre and every point less than 33 units away. It excludes the circumference, where the distance is exactly 33.

Distance inequalities

For fixed aa and r>0r>0,

∣z−a∣<rinside the circle, excluding its circumference∣z−a∣≤rinside the circle, including its circumference∣z−a∣>routside the circle, excluding its circumference∣z−a∣≥routside the circle, including its circumference\begin{array}{c|l} |z-a|<r & \text{inside the circle, excluding its circumference} \\ |z-a|\le r & \text{inside the circle, including its circumference} \\ |z-a|>r & \text{outside the circle, excluding its circumference} \\ |z-a|\ge r & \text{outside the circle, including its circumference} \end{array}

Not in the formula booklet: learn it.

In these diagrams, solid curves are included and dashed curves are excluded. Always state the inclusion in words as well; a shading convention alone should not carry the meaning.

[DIAGRAM: asset_name: Strict and inclusive circular boundaries; asset_slug: b003_007_circle_regions; caption: A strict inequality excludes the circumference; replacing it by less than or equal includes the circumference; description: Two Argand panels shade the same disc centred at (1,1) with radius 3. The first has a dashed boundary and is labelled distance less than 3, circumference excluded. The second has a solid boundary and is labelled distance at most 3, circumference included.]
A strict inequality excludes the circumference

Worked example 1: an open disc

Question. Describe ∣z−1−i∣<3|z-1-i|<3, giving a Cartesian inequality and stating whether the boundary is included.

Plan. Identify the centre and radius, then square the non-negative distance.

∣z−(1+i)∣<3distance from (1,1)(x−1)2+(y−1)2<3coordinate distance(x−1)2+(y−1)2<9square both non-negative sides\begin{aligned} |z-(1+i)| &<3 &&\text{distance from }(1,1) \\ \sqrt{(x-1)^2+(y-1)^2} &<3 &&\text{coordinate distance} \\ (x-1)^2+(y-1)^2 &<9 &&\text{square both non-negative sides} \end{aligned}

Why this step? Squaring preserves the comparison because both sides are non-negative; it does not change a strict sign into an inclusive one.

Answer. The interior of the circle with centre (1,1)(1,1) and radius 33, excluding its circumference; (x−1)2+(y−1)2<9(x-1)^2+(y-1)^2<9.

Check. The centre satisfies 0<90<9, but (4,1)(4,1) gives 9<99<9, which is false.

Change only << to ≤\le. The region's interior stays the same; the boundary changes.

Worked example 2: including the circumference

Question. Describe ∣z−1−i∣≤3|z-1-i|\le3, giving a Cartesian inequality and stating whether the boundary is included.

Plan. Keep the same centre and radius, and retain the inclusive sign when squaring.

∣z−(1+i)∣≤3distance at most 3(x−1)2+(y−1)2≤9square non-negative sides\begin{aligned} |z-(1+i)| &\le3 &&\text{distance at most }3 \\ (x-1)^2+(y-1)^2 &\le9 &&\text{square non-negative sides} \end{aligned}

Why this step? Equality now satisfies the condition, so every point at distance exactly 33 must be included.

Answer. The closed disc with centre (1,1)(1,1) and radius 33, including the circumference.

Check. (4,1)(4,1) now gives 9≤99\le9, which is true; (5,1)(5,1) still fails since 16>916>9.

Distance inequalities can describe an exterior as well as an interior. The centre itself is a quick test of which side you need.

Watch out

Wrong: shade only the circumference for ∣z−a∣≤r|z-a|\le r. Right: include all points inside it as well. Conversely, ∣z−a∣≥r|z-a|\ge r describes the exterior and circumference, not a larger disc with an unspecified radius.

The next inequality reverses the side and changes the centre. State both effects.

Nearer one point gives a half-plane

A perpendicular bisector divides the plane into points nearer aa and points nearer bb. Thus ∣z−a∣<∣z−b∣|z-a|<|z-b| selects the side containing aa, with the equal-distance line excluded. Replace << by ≤\le to include that line. These interpretations are not in the formula booklet: learn them.

You can choose the side with a test point, or simplify the inequality algebraically. A test point on the boundary is unhelpful because its two distances are equal.

Worked example 3: nearer the first point

Question. Describe ∣z−1∣<∣z−5∣|z-1|<|z-5|, and give its Cartesian inequality.

Plan. Square the distances and simplify, then check the side using the point z=1z=1.

(x−1)2+y2<(x−5)2+y2square non-negative distances−2x+1<−10x+25cancel common terms8x<24collect x termsx<3divide by a positive number\begin{aligned} (x-1)^2+y^2 &<(x-5)^2+y^2 &&\text{square non-negative distances} \\ -2x+1 &<-10x+25 &&\text{cancel common terms} \\ 8x &<24 &&\text{collect }x\text{ terms} \\ x &<3 &&\text{divide by a positive number} \end{aligned}

Why this step? The same cancellation that gave a perpendicular bisector now gives one side of that line.

Answer. The half-plane left of x=3x=3, excluding the line itself.

Check. At z=1z=1, the distances are 00 and 44, so the side containing (1,0)(1,0) is included.

Change only the inequality sign from << to >>. This exchanges which fixed point the region is nearer.

Worked example 4: nearer the second point

Question. Describe ∣z−1∣>∣z−5∣|z-1|>|z-5|, and give its Cartesian inequality.

Plan. Repeat the distance comparison with its reversed sign, then test z=5z=5.

(x−1)2+y2>(x−5)2+y2square the distances−2x+1>−10x+25cancel the squares8x>24⟹x>3simplify\begin{aligned} (x-1)^2+y^2 &>(x-5)^2+y^2 &&\text{square the distances} \\ -2x+1 &>-10x+25 &&\text{cancel the squares} \\ 8x &>24 \quad\Longrightarrow\quad x>3 &&\text{simplify} \end{aligned}

Why this step? Being farther from 11 than from 55 means being nearer 55, so the selected side must switch.

Answer. The half-plane right of x=3x=3, excluding the line itself.

Check. At z=5z=5, 4>04>0 is true; at z=3z=3, 2>22>2 is false.

The test points identify the sides without any dependence on a particular shading convention.

[DIAGRAM: asset_name: Which point is nearer; asset_slug: b003_007_half_plane_regions; caption: The perpendicular bisector separates points nearer 1 from points nearer 5; description: Two Argand panels mark the fixed points (1,0) and (5,0) and the excluded dashed bisector x equals 3. The left panel shades x less than 3; the right shades x greater than 3. Labels state which fixed point is nearer.]
The perpendicular bisector separates points nearer 1 from points nearer 5

Problem-solving

First find the equality boundary. Then choose a simple point off it, substitute into the original inequality, and include the side containing that point if it works. This also catches a sign reversal in your algebra.

For an oblique boundary, the same method works. The next check includes its equal-distance line.

Watch out

Wrong: ∣z−1∣>∣z−5∣|z-1|>|z-5| selects x<3x<3. The left distance is larger, so the point is nearer 55. The correct inequality is x>3x>3, as the test point z=5z=5 confirms. No point on x=3x=3 satisfies the strict inequality.

Test a point away from the boundary when choosing the next half-plane.

Between two directions gives a sector

An inequality for arg⁡(z−a)\arg(z-a) selects directions from the point aa. Each limiting direction gives a half-line boundary. A strict inequality excludes that ray; an inclusive inequality includes it. The vertex aa itself is always excluded, because arg⁡0\arg0 is undefined, even when both angle inequalities are inclusive.

Use principal arguments in (−π,π](-\pi,\pi]. For instance, points just below the negative real axis have arguments near −π-\pi, rather than slightly greater than π\pi. Mark the stated angular interval before shading; do not silently replace it by the smaller angle between two rays. These argument-region rules are not in the formula booklet: learn them.

Worked example 5: one ray included

Question. Describe 0<arg⁡(z−1−i)≤π20<\arg(z-1-i)\le\frac{\pi}{2}, including its boundaries.

Plan. Take directions from (1,1)(1,1) between the rightward and upward rays, applying each inequality separately.

0<arg⁡(z−(1+i))≤π2directions in the upper-right sectorx≥1,y>1include upward ray, exclude rightward ray\begin{aligned} 0<\arg(z-(1+i)) &\le\frac{\pi}{2} &&\text{directions in the upper-right sector} \\ x &\ge1,\qquad y>1 &&\text{include upward ray, exclude rightward ray} \end{aligned}

Why this step? The upper angle π/2\pi/2 is allowed, so x=1x=1, y>1y>1 belongs. The angle 00 is forbidden, so y=1y=1, x>1x>1 does not.

Answer. The infinite sector above and right of (1,1)(1,1), including the upward boundary ray but excluding the rightward ray and the vertex. In coordinates: x≥1x\ge1, y>1y>1.

Check. z=1+2iz=1+2i has displacement ii and is included; z=2+iz=2+i has displacement 11 and is excluded.

Change only the lower sign to ≤\le. The rightward ray is now included, but the vertex still has no argument.

Worked example 6: both rays included, vertex excluded

Question. Describe 0≤arg⁡(z−1−i)≤π20\le\arg(z-1-i)\le\frac{\pi}{2}, including its boundaries.

Plan. Include both limiting directions while excluding the zero displacement.

0≤arg⁡(z−(1+i))≤π2allow both bounding directionsx≥1,y≥1,(x,y)≠(1,1)exclude the undefined argument\begin{aligned} 0\le\arg(z-(1+i)) &\le\frac{\pi}{2} &&\text{allow both bounding directions} \\ x &\ge1,\qquad y\ge1,\qquad (x,y)\ne(1,1) &&\text{exclude the undefined argument} \end{aligned}

Why this step? Inclusive angle signs allow rays made of positive-length displacements; they cannot assign a direction to a displacement of length 00.

Answer. The upper-right infinite sector, with both rays included and the vertex (1,1)(1,1) excluded.

Check. 2+i2+i and 1+2i1+2i now both satisfy the condition. Substituting 1+i1+i would require arg⁡0\arg0, so that point still fails.

This gives a small but important surprise: a region can include both of its straight edges while excluding the point where they meet.

[DIAGRAM: asset_name: Angular boundaries and an excluded vertex; asset_slug: b003_007_sector_regions; caption: Inclusive angle signs include rays, but the vertex is always excluded; description: Two Argand panels shade the upper-right sector based at (1,1), with an open circle at the vertex. The first has a dashed horizontal rightward boundary and solid vertical upward boundary. The second has both rays solid but retains the open vertex. Labels state the relevant angle intervals.]
Inclusive angle signs include rays, but the vertex is always excluded

Watch out

Wrong: include z=az=a because 0≤arg⁡(z−a)0\le\arg(z-a). Right: test whether the argument exists first. The complex number 00 is a point; it is not an angle, and arg⁡0\arg0 is undefined.

The next sector moves left and swaps which ray is excluded.

Intersections and unions

An intersection contains points satisfying both conditions: “and”. A union contains points satisfying at least one condition: “or”, including points satisfying both. For a union, a point excluded by one condition can still be admitted by the other.

Draw each boundary first, identify each individual region, then combine them. State boundary inclusion for the combined region, rather than assuming that every original boundary remains an edge of the final shape. These set interpretations are not in the formula booklet: learn them.

Worked example 7: an intersection

Question. Describe ∣z∣≤2|z|\le2 and Re⁡(z)≥1\operatorname{Re}(z)\ge1. Find where the two boundaries meet and state whether those points belong.

Plan. Intersect the closed disc with the closed half-plane, then substitute x=1x=1 into the circle equation.

x2+y2≤4,x≥1both conditions required1+y2=4boundary intersections have x=1y=±3solve for the endpoints\begin{aligned} x^2+y^2 &\le4,\qquad x\ge1 &&\text{both conditions required} \\ 1+y^2 &=4 &&\text{boundary intersections have }x=1 \\ y &=\pm\sqrt3 &&\text{solve for the endpoints} \end{aligned}

Why this step? Solving the boundary equations locates the two corners of the common region; it does not replace checking the inequalities.

Answer. The part of the closed disc x2+y2≤4x^2+y^2\le4 to the right of x=1x=1. Its edge is the circle arc with x≥1x\ge1 and the segment x=1x=1, −3≤y≤3-\sqrt3\le y\le\sqrt3, all included. The meeting points are (1,±3)(1,\pm\sqrt3), both included.

Check. z=3z=3 fails ∣z∣≤2|z|\le2, so it is excluded even though its real part is at least 11.

Change only “and” to “or”. The individual regions stay the same, but keeping either one is now enough.

Worked example 8: a union

Question. Describe ∣z∣≤2|z|\le2 or Re⁡(z)≥1\operatorname{Re}(z)\ge1, including its boundary.

Plan. Keep the entire disc and the entire right half-plane, then identify their exposed edges.

x2+y2≤4orx≥1either condition is enough1+y2=4the boundaries still meet at x=1y=±3the same meeting points\begin{aligned} x^2+y^2\le4 &\quad\text{or}\quad x\ge1 &&\text{either condition is enough} \\ 1+y^2 &=4 &&\text{the boundaries still meet at }x=1 \\ y &=\pm\sqrt3 &&\text{the same meeting points} \end{aligned}

The circle arc with x>1x>1 is now inside the half-plane, and the segment x=1x=1, ∣y∣<3|y|<\sqrt3 is inside the disc.

Why this step? A boundary of one original region can lie inside the other, so it need not be an outer edge of their union.

Answer. The whole closed disc together with the closed half-plane x≥1x\ge1. The exposed boundary is the circle arc with x≤1x\le1 and the two parts of x=1x=1 with ∣y∣≥3|y|\ge\sqrt3. All these boundary points are included.

Check. z=3z=3 now belongs through the half-plane condition. z=−3z=-3 satisfies neither condition and is excluded.

The two diagrams answer the opening puzzle: 33 is outside the intersection but inside the union.

[DIAGRAM: asset_name: Intersection and union of the same regions; asset_slug: b003_007_intersection_union; caption: And keeps only the overlap; or keeps either region, including their overlap; description: Two Argand panels use the closed disc centred at the origin with radius 2 and the half-plane x at least 1. The intersection panel shades only the right circular cap. The union panel shades the full disc and the whole right half-plane. The points (1, square root 3) and (1, minus square root 3) are marked, and the point z equals 3 is shown excluded from the intersection but included in the union.]
And keeps only the overlap

Exam tip

For a region sketch, label the centre and radius of a circular boundary, locate any straight boundary, and state which side and boundary points are included. Drawing the correct circle alone does not answer an inequality question.

Translate the circle upwards for the final check. The combination is again an intersection.

Watch out

Wrong: z=3z=3 is excluded from ∣z∣≤2|z|\le2 or Re⁡(z)≥1\operatorname{Re}(z)\ge1 because ∣3∣>2|3|>2. A union requires only one condition. The correct conclusion is that 33 belongs, since Re⁡(3)≥1\operatorname{Re}(3)\ge1; it fails the corresponding intersection.

Decide whether both conditions or either condition must hold before shading.

Quick Recap

  • A distance inequality selects the interior or exterior of a circle; equality in the sign decides whether its circumference belongs.
  • Comparing two distances selects a half-plane. Find its perpendicular-bisector boundary and test a point to choose the side.
  • An argument interval selects directions from its vertex. Check each ray separately, and always exclude the vertex.
  • An intersection requires both conditions; a union requires at least one. Check the combined region's actual boundary.

For the opening conditions, z=3z=3 fails the circle condition and passes the half-plane condition: “and” excludes it, while “or” includes it.