Axioms for Vector Spaces: Consistency, Categoricality, and Parsimony, Assignments of Linear Algebra

The consistency, categoricality, and parsimony of the axioms for a vector space over a field. Four problems that require explanatory answers to determine if certain sets of entities satisfy all or some of the vector space axioms.

Typology: Assignments

Pre 2010

Uploaded on 10/01/2009

koofers-user-2kc
koofers-user-2kc 🇺🇸

3

(1)

7 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math. H110
Solutions to Problems about Axioms
September 16, 1998
Prof. W. Kahan Page 1
Problem Set 1 : Problems about our Axioms for a Vector Space
Three questions deserve to be asked about any axiom system:
Are they consistent? They are worse than useless if they are mutually contradictory. Consistency is proved, if it can
be proved, by exhibiting a
model
, a set that satisfies the axioms.
Are they categorical? If the axioms admit different models that are too different, not much can be inferred from the
axioms.
Are they parsimonious? If some axioms can be inferred from others, perhaps redundant axioms should be renamed
as lemmas or theorems to enhance the ostensible elegance of the axioms that are left.
Questions like these three inspired the following four problems. Though posed as questions that could be answered
“Yes” or “No”, they require explanatory answers.
1. Can the set of all rows of six positive real numbers be a vector space over the reals?
Yes; it is the image of a space of real 6-vectors under the map
= log and its inverse ƒ = exp .
For any two of these rows x and y define x
+
y := x·y elementwise, so x
y = x/y
elementwise, and ß
·
x := x
ß
elementwise for every row x and scalar ß .
2. Is there a set of entities
x
,
y
,
z
, … that satisfies all but one of our axioms specified for a vector
space over a field, that one being the axiom “ (–1)
·
x
= –
x
” ?
No; the assertion “ (–1)
·
x
= –
x
” is redundant among our axioms because it can be inferred
from –
x
+
o
= –
x
+
0
·
x
= –
x
+
(1 + (–1))
·
x
= –
x
+
x
+
(–1)
·
x
=
o
+
(–1)
·
x
.
3. Is there a set of entities
x
,
y
,
z
, … that satisfies all but two of our axioms specified for a vector
space over a field, those two being the axioms “ 1
·
x
=
x
” and “ (–1)
·
x
= –
x
” ?
Yes; start with a subset of vectors from a vector space but redefine ß
·
x
=
o
for every scalar ß .
The resulting set is a kind of lattice containing only linear combinations of integer multiples of the
vectors in the subset; for instance,
x
+
x
+
x
+
y
+
y
= 3
x
+ 2
y
but 3
·
x
+ 2
·
y
=
o
.
4. Is there a set of entities
x
,
y
,
z
, … that satisfies all but one of our axioms specified for a vector
space over a field, that one being the axiom “
x
+
y
=
y
+
x
” for commutative vector addition ?
No;
(
x
+
y
)
(
y
+
x
) = (
x
+
y
)
+
(–1)
·
(
y
+
x
) = (
x
+
y
)
+
((–
y
)
+
(–
x
)) =
x
+
(
y
+
(–
y
))
+
(–
x
) =
o
.
This document was created with FrameMaker404

Partial preview of the text

Download Axioms for Vector Spaces: Consistency, Categoricality, and Parsimony and more Assignments Linear Algebra in PDF only on Docsity!

Math. H110 Solutions to Problems about Axioms September 16, 1998

Prof. W. Kahan Page 1

Problem Set 1 : Problems about our Axioms for a Vector Space

Three questions deserve to be asked about any axiom system:

Are they consistent? They are worse than useless if they are mutually contradictory. Consistency is proved, if it can be proved, by exhibiting a model , a set that satisfies the axioms.

Are they categorical? If the axioms admit different models that are too different, not much can be inferred from the axioms.

Are they parsimonious? If some axioms can be inferred from others, perhaps redundant axioms should be renamed as lemmas or theorems to enhance the ostensible elegance of the axioms that are left.

Questions like these three inspired the following four problems. Though posed as questions that could be answered “Yes” or “No”, they require explanatory answers.

  1. Can the set of all rows of six positive real numbers be a vector space over the reals?

Yes; it is the image of a space of real 6-vectors under the map Ω = log and its inverse ƒ = exp. For any two of these rows x and y define x + y := x·y elementwise, so x y = x/y

elementwise, and ß· x := xß^ elementwise for every row x and scalar ß.

  1. Is there a set of entities x , y , z , … that satisfies all but one of our axioms specified for a vector space over a field, that one being the axiom “ (–1)· x = – x ”?

No; the assertion “ (–1)· x = – x ” is redundant among our axioms because it can be inferred from – x + o = – x + 0 · x = – x + (1 + (–1))· x = – x + x + (–1)· x = o + (–1)· x.

  1. Is there a set of entities x , y , z , … that satisfies all but two of our axioms specified for a vector space over a field, those two being the axioms “ 1· x = x ” and “ (–1)· x = – x ”?

Yes; start with a subset of vectors from a vector space but redefine ß· x = o for every scalar ß. The resulting set is a kind of lattice containing only linear combinations of integer multiples of the vectors in the subset; for instance, x + x + x + y + y = 3 x + 2 y but 3· x + 2 · y = o.

  1. Is there a set of entities x , y , z , … that satisfies all but one of our axioms specified for a vector space over a field, that one being the axiom “ x + y = y + x ” for commutative vector addition?

No; ( x + y ) ( y + x ) = ( x + y ) + (–1)· ( y + x ) = ( x + y ) + ((– y ) + (– x )) = x + ( y + (– y )) + (– x ) = o.

This document was created with FrameMaker 4 0 4