notes
notes
Mathematics
provides a way to represent relationships that is
concise
precise
well suited to manipulations (_ to create 'child' representations)
that reveal insights about the objects being modeled.
Mary has twice as many apples as John. Mary throws half her apples away because
they are rotten. John eats one of his. Mary still has twice as many apples as John.
How many apples did Mary and John have initially?
we use (_ the variables) m and j to (KEY) denote the number of apples Mary and John
have (_ note: what is actually happening is abstraction - we throw away all
attributes of 'apples' except number)
(_ then we re express the conditions in the question we write the two formulas
below to) build a (KEY) model of the problem
m = 2j ---(1)
m/2 = j -1 --(2)
Note: the mathematical model is much more succinct than the English description of
the problem.
here
precondition = 0 <= n. -- n is a positive integer
postcondition - think carefully about what approximations for sqrt(n) would be
accetptable. Three choices are given, where the variable b contains the
approximation to sqrt(n)
teasing out
let b = 1
1^2 <= 10 AND 10 < (1+1)^2 no the second condition fails
likewise 2 fails but 3^2 <= 10 and 10 < (3 + 1)^2
the actual sqrt is 3.16 so 3 is the integer nearest to it,
choice 3
(b-1)*2 < n <= b^2
let b = 1
0 < 10 <= 1 the right condition fails
so this is b such that b^2 is at *least* sqrt(n)
choice 2:
abs(b^2 - n) <= abs( ( b + 1)^2 - n ) AND
abs(b^2 - n) <= abs ( ( b - 1)^2 - n)
which is computing the integer closest to sqrt (n) _from both directions?
Key Question would seem to be: without the model, to base computation on, how would
you discover the planet - verify a conjecture?
_ note: two uses of the model. Initial model sets a baseline, and then deviations
from this model lead to a conjecture(d new model) then these two models somehow
guide computation - here by hand - which in turn optimized the real world search
area TBD: Follow up on the details of this story.
)
the third (_yet another!) advantage in using mathematical models (_ KEY: This
seems to be the real focus of this book)
i.e there are (KEY) rules for performing syntactic manipulations - _ iow once we
have a mathematical expression, part of a 'model' *or whatever else*, we can
manipulate symbols through these rules and (KEY) by such *syntactic*/_symbolic
manipulation_ we can learn more about the model (of which the expressions are a
part) and most importantly (KEY) only the initial and final formulations need be
interpreted in terms of the original problem.
If we were to list out the steps of the manipulation of symbols and list therules,
we'd get
(_ start with)
e = mc^2
== divide both sides with c^2 which is non zero
e/c^2 = (m.c^2)/(c^2)
== associativity
e/c^2 = m(c^2/c^2)
== any non zero number / itself = 1
e/c^2 = m . 1
== x . 1 = x
e/c^2 = m
In this calculation (KEY) between each pair of exrpessions appears a line with
ahint
the equals sign indicates that the expressions are equal
the hint explains why
(KEY) since equality is transitive (m = n and n = p we can conclude m = p)
we conclude that e = m c^2 (KEY) is equivalent (_ by transitivity) to
e/c^2 == m
(step)
KEY
we can understand each ofthe above manipulations *without* knowing what m,
e and n denote, i.e we can manipulate the expression to obtain a new expression
*without* knowing that the equations being manipulated are models of the relatoin
between energy and matter.
The text introduces you to a number of useful abstractions and their properties.
- integers
- set - allow us to model and reason about collections of objects
- relation - model and reason about relationships between objects in sets
- various types of infinites - abstractions which may not have a counterpart in
reality, but neverthelessa re useful in understanding questions that arise wrt the
foundations of mathematics.
- there are many styles of proof, but underlying them all are as (KEY) small
number of (KEY) domain independent methods.
- mathematical induction
- proof by contradiction
- the pigeonhole principle
we discuss various styles and formats for proofs.
The basis of discussions is Formal Logic