Can Algebraic Calculations Alone Determine Vector Set Constraints Accurately?

Click For Summary
SUMMARY

The forum discussion centers on the accuracy of algebraic calculations in determining vector set constraints. Participants analyze the equations ##c\cdot \vec{u}+(1-c)\cdot \vec{v}## and ##a\vec{u}+b\vec{v}##, concluding that while algebraic methods are valid, they may not capture all constraints visually. Specifically, the constraints ##x \leq 2, y \geq 1## and ##a + b \leq 1## do not encompass all possible vectors, necessitating graphical representation for clarity. The discussion emphasizes the importance of visualizing algebraic relationships to fully understand the constraints involved.

PREREQUISITES
  • Understanding of vector algebra and linear combinations
  • Familiarity with inequalities and their geometric interpretations
  • Knowledge of optimization problems in two-dimensional space
  • Ability to graphically represent equations and inequalities
NEXT STEPS
  • Explore graphical methods for visualizing vector constraints
  • Study the geometric interpretation of inequalities in two-dimensional space
  • Learn about optimization techniques in linear programming
  • Investigate the implications of varying parameters in vector equations
USEFUL FOR

Mathematicians, students of linear algebra, optimization analysts, and anyone interested in the geometric interpretation of algebraic equations.

christang_1023
Messages
27
Reaction score
3
Homework Statement
Let##\vec{u} = (1, 2)## and ##\vec{v} = (2, 1)## .
Relevant Equations
Draw the following sets of vectors:
1. ##{c\cdot \vec{u}+(1-c)\cdot \vec{v}:c\in R, c\geq0}.##
2. ##{a\vec{u}+b\vec{v}:a+b\leq 1}##
1. I consider this problem algebraically, ##c\cdot \vec{u}+(1-c)\cdot \vec{v}=c(1,2)+(1-c)(2,1)=(c,2c)+(2-2c,1-c)=(2-c,1+c)##; since the constraint I know is ##c\geq 0##, I can conclude the expected vectors##(x,y)## must have ##x\leq2, y\geq 1##.

2. Similarly, I get ##a\vec{u}+b\vec{v}=(a+2b,2a+b)##. With the constraint ## a+b\leq 1##, since ##a,b\in R##, the expected vectors ##(x,y)## should have ##x,y\in R##, which means all two-dimensional vectors satisfy the condition.

Am I correct?
 
Last edited by a moderator:
Physics news on Phys.org
1. Yes, in a way. You do not get all vectors with ##x\leq 2 \, , \,y\geq 1##.
You should definitely draw ##c\vec{u}+(1-c)\vec{v}##. Insert some values for ##c##, e.g. ##c\in \{\,0,\frac{1}{4},\frac{1}{2},\frac{3}{4},1,2,3,4,5\,\}## and observe what these points have in common.

2. No, not all vectors satisfy the condition. Again, draw the picture for ##a+b=1##, then check where ##(0,0) ## is, since it is part of the solution set: ##a=b=0##. But ##(4,5)## is not.
 
fresh_42 said:
1. Yes, in a way. You do not get all vectors with ##x\leq 2 \, , \,y\geq 1##.
You should definitely draw ##c\vec{u}+(1-c)\vec{v}##. Insert some values for ##c##, e.g. ##c\in \{\,0,\frac{1}{4},\frac{1}{2},\frac{3}{4},1,2,3,4,5\,\}## and observe what these points have in common.

2. No, not all vectors satisfy the condition. Again, draw the picture for ##a+b=1##, then check where ##(0,0) ## is, since it is part of the solution set: ##a=b=0##. But ##(4,5)## is not.
Thank you for your answer. I do observe my answers are not accurate; however, what is wrong with my method, or if there is any modification to make it right?
 
christang_1023 said:
Thank you for your answer. I do observe my answers are not accurate; however, what is wrong with my method, or if there is any modification to make it right?
There is nothing wrong doing it algebraically, besides that a) the problem said "draw it", b) you have the wrong description in case 1 and twice as much points as the solution in case 2, and c) that you miss the insights.

Case 1 is a standard construction which is very often used and the clue is, that seeing the equation and having the picture in mind is one and the same thing. It is even worth considering the cases ##0\leq c\leq 1## and the others: ##c>1## or ##c<0## separately.

Case 2 is a region of the plane which often occurs in optimization problems. It is also helpful to see the inequality and automatically associate a geometric object with it. Imagine you had ##x \leq 1##. Would this be
christang_1023 said:
... all two-dimensional vectors satisfy the condition
?
 
  • Like
Likes christang_1023, YoungPhysicist and SammyS
fresh_42 said:
There is nothing wrong doing it algebraically, besides that a) the problem said "draw it", b) you have the wrong description in case 1 and twice as much points as the solution in case 2, and c) that you miss the insights.

Case 1 is a standard construction which is very often used and the clue is, that seeing the equation and having the picture in mind is one and the same thing. It is even worth considering the cases ##0\leq c\leq 1## and the others: ##c>1## or ##c<0## separately.

Case 2 is a region of the plane which often occurs in optimization problems. It is also helpful to see the inequality and automatically associate a geometric object with it. Imagine you had ##x \leq 1##. Would this be

?
You are totally right. I made a mistake that the inequality mentioned above cannot express the relationship between ##x## and ##y##, which is a significant constraint of ##y##.
 
  • Like
Likes FactChecker

Similar threads

Replies
18
Views
2K
Replies
11
Views
2K
Replies
56
Views
6K
  • · Replies 23 ·
Replies
23
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K