Question: Find an example to show that the convexity of S necessary in Exercise 19.

Short Answer

Expert verified

For \(c = 1\), \(d = 1\) and \(S = \left\{ {0,1} \right\} \subset \mathbb{R}\), the identity \(cS + dS = \left( {c + d} \right)S\) is not true as S is not convex.

Step by step solution

01

Consider the values of constants

Let \(c = 1\), \(d = 1\) and \(S = \left\{ {0,1} \right\} \subset \mathbb{R}\) (not a convex set).

Check for the expression \(cS + dS\) as shown below:

\(\begin{array}{c}cS + dS = S + S\\ = \left\{ {0 + 0,\,0 + 1,\,1 + 1} \right\}\\ = \left\{ {0,\,1,\,\,2} \right\}\end{array}\)

02

Find the value for \(\left( {c + d} \right)S\)

Obtain the value of \(\left( {c + d} \right)S\) as shown below:

\(\begin{array}{c}\left( {c + d} \right)S = \left( {1 + 1} \right)S\\ = 2S\\ = \left\{ {0,2} \right\}\end{array}\)

As it can be observed, that \(cS + dS \ne \left( {c + d} \right)S\).

So, S should be convex to hold the relation \(cS + dS \ne \left( {c + d} \right)S\).

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Question: In Exercises 21 and 22, mark each statement True or False. Justify each answer.

22 a. If \(d\)is a real number and \(f\) is a nonzero linear functional defined on \({\mathbb{R}^n}\) , then \(f:d\)is a hyperplane in \({\mathbb{R}^n}\) .

b. Given any vector n and any real number \(d\), the set \(\left\{ {x:n \cdot x = d} \right\}\) is a hyperplane.

c. If \(A\) and \(B\) are nonempty disjoint sets such that \(A\) is compact and \(B\) is closed, then there exists a hyperplane that strictly separates \(A\) and \(B\).

d. If there exists a hyperplane \(H\) such that \(H\) does not strictly separate two sets \(A\) and \(B\), then \(\left( {{\rm{conv}}\,A} \right) \cap \left( {{\rm{conv}}\,B} \right) \ne \emptyset \) and \(B\).

Explain why any set of five or more points in \({\mathbb{R}^3}\) must be affinely dependent.

Let\(\left\{ {{p_1},{p_2},{p_3}} \right\}\)be an affinely dependent set of points in\({\mathbb{R}^{\bf{n}}}\)and let\(f:{\mathbb{R}^{\bf{n}}} \to {\mathbb{R}^{\bf{m}}}\)be a linear transformation. Show that\(\left\{ {f\left( {{{\bf{p}}_1}} \right),f\left( {{{\bf{p}}_2}} \right),f\left( {{{\bf{p}}_3}} \right)} \right\}\)is affinely dependent in\({\mathbb{R}^{\bf{m}}}\).

Let\({v_1} = \left[ {\begin{array}{*{20}{c}}1\\3\\{ - 6}\end{array}} \right]\),\({v_{\bf{2}}} = \left[ {\begin{array}{*{20}{c}}{\bf{7}}\\3\\{ - {\bf{5}}}\end{array}} \right]\), \({v_{\bf{3}}} = \left[ {\begin{array}{*{20}{c}}{\bf{3}}\\{\bf{9}}\\{ - {\bf{2}}}\end{array}} \right]\), \({\bf{a}} = \left[ {\begin{array}{*{20}{c}}{\bf{0}}\\{\bf{0}}\\{\bf{9}}\end{array}} \right]\), \({\bf{b}} = \left[ {\begin{array}{*{20}{c}}{1.4}\\{{\bf{1}}.{\bf{5}}}\\{ - {\bf{3}}.{\bf{1}}}\end{array}} \right]\), and \({\bf{x}}\left( t \right) = {\bf{a}} + t{\bf{b}}\)for \(t \ge {\bf{0}}\).Find the point where the ray\({\bf{x}}\left( t \right)\)intersects the plane that contains the triangle with vertices\({v_1}\),\({v_{\bf{2}}}\), and\({v_{\bf{3}}}\). Is this point inside the triangle?

Question: 25. Let \(p = \left( \begin{array}{l}1\\1\end{array} \right)\). Find a hyperplane \(\left( {f:d} \right)\) that strictly separates \(B\left( {0,3} \right)\) and \(B\left( {p,1} \right)\). (Hint: After finding \(f\), show that the point \(v = \left( {1 - .75} \right)0 + .75p\) is neither in \(B\left( {0,3} \right)\) nor in \(B\left( {p,1} \right)\)).

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free