Question
Question: If $\vec{a}$, $\vec{b}$, $\vec{c}$ are three non-zero, non-coplanar vectors and $\vec{b_1} = \vec{b}...
If a, b, c are three non-zero, non-coplanar vectors and b1=b−∣a∣2b.aa, b2=b+∣a∣2b.aa and
c1=c−∣a∣2c.aa−∣b∣2c.bb, c2=c−∣a∣2c.aa−∣b1∣2c.b1b1, c3=c−∣a∣2c.aa−∣b2∣2c.b2b2, c4=a−∣a∣2c.aa
Then which of the following is a set of mutually orthogonal vectors?

{a,b1,c1}
{a,b1,c2}
{a,b2,c3}
{a,b2,c4}
{a,b1,c2}
Solution
The problem asks us to identify a set of mutually orthogonal vectors from the given options. We are given three non-zero, non-coplanar vectors a, b, c and several derived vectors.
Let's analyze the definitions of the derived vectors:
-
b1=b−∣a∣2b.aa
This expression represents the component of b that is orthogonal to a. This is a standard step in the Gram-Schmidt orthogonalization process. To verify orthogonality: b1.a=(b−∣a∣2b.aa).a=b.a−∣a∣2b.a(a.a)=b.a−b.a=0. So, a and b1 are orthogonal.
-
b2=b+∣a∣2b.aa
Let's check the dot product with a: b2.a=(b+∣a∣2b.aa).a=b.a+∣a∣2b.a(a.a)=b.a+b.a=2(b.a). Since a and b are general non-zero vectors, b.a is generally not zero. Therefore, a and b2 are generally not orthogonal. This immediately rules out options (C) and (D).
Now let's examine the remaining options, (A) and (B). Both include a and b1, which we've established are orthogonal. We need to check the third vector in each set.
Option (A): {a,b1,c1} c1=c−∣a∣2c.aa−∣b∣2c.bb Let's check c1.a: c1.a=(c−∣a∣2c.aa−∣b∣2c.bb).a =c.a−∣a∣2c.a(a.a)−∣b∣2c.b(b.a) =c.a−c.a−∣b∣2(c.b)(b.a) =−∣b∣2(c.b)(b.a). For this to be zero, either c.b=0 or b.a=0. These conditions are not generally true for arbitrary non-zero, non-coplanar vectors. Thus, option (A) is generally not a set of mutually orthogonal vectors.
Option (B): {a,b1,c2} We already know a⊥b1. Now let's check c2: c2=c−∣a∣2c.aa−∣b1∣2c.b1b1 This expression for c2 is precisely the Gram-Schmidt orthogonalization step to make c orthogonal to both a and b1. Let's verify:
-
c2.a: c2.a=(c−∣a∣2c.aa−∣b1∣2c.b1b1).a =c.a−∣a∣2c.a(a.a)−∣b1∣2c.b1(b1.a) Since b1.a=0: =c.a−c.a−∣b1∣2c.b1(0)=0. So, a⊥c2.
-
c2.b1: c2.b1=(c−∣a∣2c.aa−∣b1∣2c.b1b1).b1 =c.b1−∣a∣2c.a(a.b1)−∣b1∣2c.b1(b1.b1) Since a.b1=0: =c.b1−∣a∣2c.a(0)−∣b1∣2c.b1∣b1∣2 =c.b1−c.b1=0. So, b1⊥c2.
Since a⊥b1, a⊥c2, and b1⊥c2, the set {a,b1,c2} is a set of mutually orthogonal vectors. This is the result of applying the Gram-Schmidt orthogonalization process to the vectors a,b,c. The condition that a,b,c are non-zero and non-coplanar ensures that b1 and c2 are also non-zero vectors.
The final answer is B.
Explanation of the solution:
The problem asks for a set of mutually orthogonal vectors. This means the dot product of any two distinct vectors in the set must be zero.
-
Analyze b1 and b2 with respect to a:
- b1=b−∣a∣2b.aa. Calculating b1.a=(b−∣a∣2b.aa).a=b.a−∣a∣2b.a∣a∣2=b.a−b.a=0. Thus, a⊥b1.
- b2=b+∣a∣2b.aa. Calculating b2.a=(b+∣a∣2b.aa).a=b.a+∣a∣2b.a∣a∣2=b.a+b.a=2(b.a). This is generally not zero. Therefore, options (C) and (D) are incorrect as they include a and b2.
-
Analyze c1 with respect to a (for option A):
- c1=c−∣a∣2c.aa−∣b∣2c.bb. Calculating c1.a=(c−∣a∣2c.aa−∣b∣2c.bb).a=c.a−c.a−∣b∣2c.b(b.a)=−∣b∣2(c.b)(b.a). This is generally not zero. Therefore, option (A) is incorrect.
-
Analyze c2 with respect to a and b1 (for option B):
- c2=c−∣a∣2c.aa−∣b1∣2c.b1b1.
- c2.a=(c−∣a∣2c.aa−∣b1∣2c.b1b1).a=c.a−c.a−∣b1∣2c.b1(b1.a). Since b1.a=0, this simplifies to 0. Thus, a⊥c2.
- c2.b1=(c−∣a∣2c.aa−∣b1∣2c.b1b1).b1=c.b1−∣a∣2c.a(a.b1)−∣b1∣2c.b1∣b1∣2. Since a.b1=0, this simplifies to c.b1−c.b1=0. Thus, b1⊥c2.
Since a⊥b1, a⊥c2, and b1⊥c2, the set {a,b1,c2} is a set of mutually orthogonal vectors. This construction is exactly the Gram-Schmidt orthogonalization process.
The final answer is (B)