• Nem Talált Eredményt

Exercise-set 7.

N/A
N/A
Protected

Academic year: 2022

Ossza meg "Exercise-set 7."

Copied!
1
0
0

Teljes szövegt

(1)

Introduction to the Theory of Computing 1.

Exercise-set 7.

Solutions

1. a) No (lin. dependent).

b) Yes,[a]B= (1,−1,2,0)T.

2. a) Basis e.g.: u1= (3,1,−1)T, u2= (6,−1,−4)T (two vectors in the plane),dimV = 2.

b) Basis e.g.: u1= (1,0,0,−4)T, u2= (0,1,0,−3)T, u3= (0,0,1,−2)T,dimV = 3.

3. a) E.g.: u1=v, u2= (0,1,0,1)T, u3= (0,0,1,−1)T,dimV = 3.

b)u1=v,dimV = 1.

4. Fourth vector e.g.: z= (0,0,0,1)T, [a]B= (4,−3,1,0)T. 5. E.g.: u1== (1,1,0,0)T, u2= (0,0,3,1)T, (dimV = 2).

6. dimV = 2.

7. dimV = 2, a basis e.g.: u1= (1,0,−1,−3)T, u2= (0,1,1,−2)T.

8. V is a subspace,dimV = 2, a basis e.g. u1= (1,1,1,1,1)T, u2= (1,2,4,8,16)T. 9. E.g.: v2== (0,1,0,2)T, v3= (0,0,1,−3)T, (dimV = 3).

10. No. The vectors are linearly dependent,dimV can be 3 or 4.

11. dimW = 2

12. p=−1, [v]B = (7,−4)T. 13. Linearly dependent,dimV = 3.

14. 99 (the first 99 vectors are linearly independent, and the last one is a linear combination of these).

15. No such value (4 vectors in a subspace of dimension 3 are always linearly dependent).

16. p6= 1.

17. a) Yes, they are linearly independent.

b) Yes, they are linearly independent.

18. Yes, they must be linearly independent.

19. Any 4 non-parallel vectors in a 2-dimensional subspace, e.g.u1= (1,0,0,0)T, u2= (0,1,0,0)T, u3= (1,1,0,0)T, u4= (−1,1,0,0)T.

20. 5 linearly dependent vectors in a 3-dimensional subspace, e.g. u1= (1,0,0,0,1)T, u2= (0,1,0,0,0)T, u3= (0,0,1,0,0)T, u4= (1,1,1,0,0)T, u5= (1,2,3,0,0)T.

21. No, we can always select a basis (of 4 vectors) from a generating system.

22. By contradiction: otherwise two bases from the subspaces would give 100 linearly independent vectors inR99, a contradiction.

Hivatkozások

KAPCSOLÓDÓ DOKUMENTUMOK

The objective set for Business Environment Simplification Task Force was to prepare an independent report which would make proposals for concrete measures to be taken by the

(g) If a homogeneous linear system of n equations in n unknowns has a corresponding augmented matrix with a reduced row echelon form containing n leading 1’s, then the linear system

(MT++’19) From a complete graph on 10 vertices we delete the edges of two such cycles on 3 vertices which have exactly one vertex in common.. Determine the chromatic number of the

Proof The first observation is that R violates the first requirement of weak separability in Lemma 2.2. Otherwise R would be satisfied by every assignment that has value 1 only

The graph determined by the knights and attacks is bipartite (the two classes are to the white and black squares), and each of its degrees is at least 2 = ⇒ ∃ a degree ≥

(The algo- rithm in [22] is for Dominating Set in unit disk graphs.) Finally, we give robust algorithms for Steiner Tree, r -Dominating Set, Connected Vertex Cover, Connected

(See Figs. Consequently it is reasonable to distinguish the ordinary linear trans- formations, where the vectors Vl and V2 are linearly independent from the special ones

Hence, the model differs from the classic (MCLP) in two main issues: first, the set of feasible locations is not a discrete set, but (a set of) the edges of a network; moreover,