Skip to content
NCERT Exemplar · Q47

Q.For any complex number zz the minimum value of ∣z∣+∣z−1∣|z|+|z-1| is 1.

Yanam BieapShort· 1mImportance★★★★★est
94% · 83/88 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

The expression ∣z∣+∣z−1∣|z| + |z-1| represents the sum of distances from a complex number zz to the points 00 and 11 in the complex plane. By the triangle inequality, this sum is always greater than or equal to the distance between 00 and 11, which is 11. This minimum value of 11 is achieved when zz lies on the line segment connecting 00 and 11. Therefore, the minimum value is 1\boxed{1}.

The problem asks us to find the minimum value of the expression ∣z∣+∣z−1∣|z| + |z-1| for any complex number zz. This is a classic application of the geometric interpretation of complex numbers and the triangle inequality.

Concept and Intuition: Complex Number Geometry

A complex number z=x+iyz = x + iy can be visualized as a point (x,y)(x, y) in the complex plane.

The modulus ∣z∣|z| represents the distance of the point zz from the origin (0,0)(0,0).

Similarly, ∣z−w∣|z-w| represents the distance between the complex numbers zz and ww.

In our problem:

  • ∣z∣|z| is the distance from zz to the origin (the point 00).
  • ∣z−1∣|z-1| is the distance from zz to the point 11 (which is (1,0)(1,0) on the real axis).

So, the expression ∣z∣+∣z−1∣|z| + |z-1| represents the sum of the distances from a point zz to two fixed points: 00 and 11.

Consider three points in the complex plane: AA, BB, and CC. The distance between AA and CC is ∣A−C∣|A-C|. The distance between AA and BB is ∣A−B∣|A-B|, and between BB and CC is ∣B−C∣|B-C|. The triangle inequality states that the sum of the lengths of any two sides of a triangle must be greater than or equal to the length of the third side. In terms of complex numbers, this means:

For any complex numbers z1z_1 and z2z_2:

∣z1+z2∣≤∣z1∣+∣z2∣|z_1 + z_2| \le |z_1| + |z_2|

Equality holds if and only if z1z_1 and z2z_2 have the same argument, meaning they lie on the same ray from the origin (i.e., z1=kz2z_1 = k z_2 for some non-negative real number kk). Geometrically, this means the three points are collinear, with BB lying on the line segment ACAC.

Let's apply this understanding to our problem.

Step-by-step Solution:

  1. Identify the fixed points and the expression:

    We are looking for the minimum value of ∣z∣+∣z−1∣|z| + |z-1|.

    Let PP be the point representing zz.

    Let AA be the point representing 00.

    Let BB be the point representing 11.

    Then ∣z∣|z| is the distance PAPA, and ∣z−1∣|z-1| is the distance PBPB. We want to minimize PA+PBPA + PB.

  2. Apply the Triangle Inequality to establish a lower bound:

    We can rewrite the expression to fit the triangle inequality form.

    Consider the complex numbers z1=zz_1 = z and z2=−(z−1)=1−zz_2 = -(z-1) = 1-z.

    Using the triangle inequality ∣z1+z2∣≤∣z1∣+∣z2∣|z_1 + z_2| \le |z_1| + |z_2|:

∣z+(1−z)∣≤∣z∣+∣1−z∣|z + (1-z)| \le |z| + |1-z|

∣1∣≤∣z∣+∣1−z∣|1| \le |z| + |1-z|

Since $|1| = 1$ and $|1-z| = |-(z-1)| = |z-1|$, we get:

1≤∣z∣+∣z−1∣1 \le |z| + |z-1|

This inequality tells us that the sum of the distances $|z| + |z-1|$ is always greater than or equal to $1$. Therefore, the minimum value cannot be less than $1$. …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.