5 ms·
Part I I don't believe that an introduction to math has to be long, and here I will try to give an introduction, and overview, just as blog posts. That is thi
by graycat 5y ago
Part I
I don't believe that an introduction to
math has to be long, and here I will try
to give an introduction, and overview,
just as blog posts. That is this
introduction is much shorter than a book.
So I introduce the main topics.
Throughout, nearly always you can get a
lot more from a simple Google search or
Wikipedia article.
By far the most important topics are
calculus and linear algebra. My view is
that a 12 year old with good interest and
some okay or better teaching and some good
texts and access to Google and Wikipedia
can do well with both calculus and linear
algebra.
Both calculus and linear algebra have
enough so that a person can spend their
life in research, maybe in applications,
in advanced parts. This is especially the
case for calculus. E.g., calculus can
include calculus on manifords, partial
differential equations, differential
geometry, and numercial and algorithmic
topics for all of these.
What is described here could be covered in
a good undergraduate math major. Such a
student would have all or nearly all of a
good math background for graduate work in
math, physics, or other STEM fields.
None of this math is nearly new. So, for
good texts, I recommend ones that have
been regarded as among the best for at
least 20 years. For some texts, 60 years
is not too old. E.g., my favorite text in
linear algebra was first published in
1942. So, look for old texts. Usually
can buy used copies in good condition for
less than $10.
How to use the texts: (1) Get a stack of
blank paper, a sharp pencil, a big eraser,
a comfortable chair, a good light, and a
quiet room. (2) Read a section of the
text, try to understand all or nearly all
the section, when time is available try to
get a first cut intuitive understanding
good enough to explain to someone who
knows no math at all, and then do the
exercises. If your text proves theorems
and is short on good exercises, then prove
the theorems yourself as a good source of
exercises. (3) For the more important
topics, especially calculus and linear
algebra, get 3-4 well recommended texts,
pick one as your main text, and use the
others for alternative explanations and
more exercises. (4) Occasionally look
back at what you have learned and find a
good, intuitive view of what is going on.
Qualifications: I hold a Ph.D. in
pure/applied math from a world class
research university. While I've published
peer-reviewed orginal research in
pure/applied math, mathematical
statistics, and artificial intelligence,
my interests in math are mostly for
applications; I've applied math for US
national security, in business, and in
computer science research. I've been
programming for decades, and now I'm doing
a startup, a novel Web site, that has some
old pure and new applied math at its core
(that users won't see) and have written
and run the software for the Web site.
The software is almost entirely in
Microsoft's .NET and consists of 24,000
statements, in 100,000 lines of typing.
Currently I'm collecting initial data
before going live on the Internet.
Below are 17 numbered sections. Calculus
is in section 11, and linear algebra,
section 12. For sections 1-10, plane
geometry in section 8 deserves careful
study, e.g., as in a good high school
course, but for most students for the
other sections of 1-10 just the material
here may be enough.
(1) Sets
A set is a collection, aggregation, box
of, etc. of elements -- we're supposed
to already know what the elements are.
In math, sets are useful in much the same
way as little covered plastic containers
are in cooking, say to store some left
over peas, cookies, pizza sauce, etc.
So, a set is a way to identify, keep track
of what we are talking about.
Given a set A and some element x, the x is
either in the set A or it is not -- there
are no other alternatives. If element x
is in set A, then it is in set A exactly
once. e.g., never 2 or 3 times.
The elements in a set are not in any
particular order. E.g.,
{1, 3, -4} = {3, -4, 1}
Given two sets A and B, an element x might
be in both A and B, might be in many sets.
We also permit a special set, the empty
set that has no elements. The empty set
is curiously useful, plays a role roughly
like 0 does for numbers.
We can define sets with notation, e.g.,
A = {x| x > 7}
We read this as "A is the set of all
elements x such that x > 7."
(2) Foundations
Near 1900 a lot of math was known. A
nagging question was, what are the
foundations that let us be confident
that what we are talking about makes
sense?
B. Russell noticed we could write
A = {x| x is not a element of x}
Then A is an element of A if and only if
it is not an element of A. So, we have a
contradiction, angst, tummy aches, heart
burn, head aches, etc. This is the
Russell Paradox.
The problem was solved by first deciding
what the elements were and then making
sets out of just those elements. Net, we
rule out asking of set A is an element of
set A. Of course this work was all just
conceptual.
Also there was work to set up some
axioms (properties) to be assumed for
sets; this was axiomatic set theory.
Then there was an effort, successful, to
use axiomatic set theory to define
everything else in math. So, roughly, if
the axioms are solid, so is the rest of
math.
Some deep, difficult, and profound
questions were found and some answers were
found for some of these.
In the end, except for people specializing
in foundations, the approach taken for set
theory is Zermelo–Fraenkel set theory
usually assuming also the axiom of
choice. I know that that work is solid
way down in the basement, foundations,
of math, but not many people go down there
very often. I've been there for a good
tour and have no intention of going back.
Roughly, axiomatic set theory is to add
credibility to the math you already knew
in the 8th grade.
It may be that this material gets taught
to give a deeper understanding to people
who intend to teach in K-12. E.g., Newton
invented calculus, and I doubt that he
knew about the Russell Paradox or the
Axiom of Choice.
(3) Numbers
The most important concept in math is
numbers, and the most important numbers
are the real numbers. To understand
these numbers it is nearly always enough
to visualize them as just the points on a
line. That is essentially the same as
using a yard stick. No biggie.
We can talk about the set of real
numbers; maybe we let R denote the set of
real numbers.
We can also consider the whole or
natural numbers -- 1, 2, 3, .... We
might agree that N is the set of natural
numbers.
We might define the set N of natural
number by: 1 is in N and, for each n in
N, n+1 is also in N. We will use this in
proofs by mathematical induction.
By including 0 and the negatives
of the whole numbers we get the integers
... -3, -2, -1, 0, 1, 2, ...
Maybe we say that Z is the set of
integers.
The rational numbers are all the p/q
where p and q are integers and q is not
zero. We can say that Q is the set of
rational numbers.
If we let i be or act something like the
square root of -1 all the complex
numbers are all the x + iy for reals x and
y. We can let C denote the set of all the
complex numbers.
Of course, there is no square root of -1.
But we can regard the complex numbers as a
clever bookkeeping trick that at times is
curiously useful in defining the sine and
cosine in trigonometry, electrical circuit
theory, analysis of wave motion, quantum
mechanics, etc.
This use of R, N, Z, Q, and C is common,
but there is no rule that says we could
not use other notation.
The most important properties of these
numbers you learned by the 9th grade and
learned most of those in grade school. No
biggies.
There is one more property
that is crucial in
calculus:
The set of real numbers R is
complete.
There are several equivalent
definitions of complete.
Here is maybe the simplest
definition:
Given a subset S of R and some x
in R, if for all a in S
we have that a <= x, then
x is an upper bound of set S.
The completeness property is that
each non-empty subset S of R with an upper
bound has a least upper bound.
E.g., let
S = {x| x in R and x < 2}
Then 3 is an upper bound of S and 2 is the
least upper bound.
Perhaps a better way to
explain completeness is to
say, intuitively,
that
whenever we move
in steps to be as close
as we please to some point
on the line, there is a
real number there we are
getting close to.
A big point is that
the rational numbers
are not complete.
E.g., let
S = {a | a rational and a < square root of 2}
Then the square root of 2 would
be the least upper bound but is
not rational.
So, the rational numbers are not complete.
The concept of completeness,
especially viewing it as
converging to something,
is a major concept in
advanced
work in math analysis.
There is something of a
joke that "Calculus is
the elementary consequences
of the completeness property of the
real number system."
- graycat 5y agoPart II (4) Infinity During the days near 1900 struggling with axiomatic set theory, there was also struggling with the concept of infinity or infinite. We say that two sets A and B have the same cardinality, essentially are the same size, if they can be put into 1-1 correspondence. Okay, set B is a subset of set A provided each element of B is an element of A. B is a proper subset of A if A contains some elements not in B, that is, if B is not all of A. Then a set is infinite if it can be put into 1-1 correspondence with a proper subset of itself. A common example is to let A be the set of natural numbers and B be the set of even (can be divided by 2 with no remainder -- 4th grade math) natural numbers. Then B is a proper subset of A, and, for each natural number n in A, let it correspond to the natural number 2n in B. Presto, bingo, we have put A and B into 1-1 correspondence. So, set A is infinite. A set that is not infinite is finite. Similarly sets of integers, rationals, reals, and complex numbers are all infinite. Not very difficult to see. the set of natural numbers has the same cardinality as the set of integers, that is, the natural numbers and the integers can be put into 1-1 correspondence. Any set that can be put into 1-1 correspondence with the natural numbers, has the same cardinality as the natural numbers, is said to be countably infinite. Curiously, the rationals are countably infinite. To show this, use the clever Cantor diagonal process (lots of hits at Google). Is the set of reals countably infinite? No, and there is a short, clever argument that shows this. So, the cardinality of the set of reals is larger (after we handle some details) than the set of natural numbers. Is there a set D with cardinality greater than the natural numbers but smaller than the cardinality of the set of real numbers? Difficult question. That there cannot be such a set D is the continuum hypothesis (CH). As can see at Wikipedia, this question was settled by work of Kurt Gödel in 1940 and Paul Cohen in 1963: The result is that the CH is independent of Zermelo–Fraenkel set theory with the axiom of choice. By independent we mean that we can assume that the CH is true or false and cannot get a contradiction. This work has been a bit amazing, even philosophical. Understanding infinity is important, and we have done a good job at that. Unless we are down in the basement of foundations, we at most rarely consider the continuum hypothesis. There is a theorem that for any natural number n, we have 1^3 + 2^3 + ... + n^3 = n^2(n + 1)^2 / 4 We can prove this by mathematical induction. We want a proof that works for any natural number n, and for this we use the definition (above) of the natural numbers. So, first we check if the equation is true for n = 1: 1^3 = 1 and when n = 1 n^2(n + 1)^2 / 4 = 1 (2)^2 / 4 = 1 So, the equation holds for n = 1. Suppose the equation holds for some n and check the equation for n + 1: 1^3 + 2^3 + ... + n^3 + (n + 1)^3 = n^2(n + 1)^2 / 4 + (n + 1)^3 = n^2(n + 1)^2 / 4 + 4(n + 1)(n + 1)^2 / 4 = (n^2 + 4(n + 1))(n + 1)^2 / 4 = (n + 1)^2 (n^2 + 4(n + 1)) / 4 = But n^2 + 4(n + 1) = n^2 + 2n + 1 + 2(n + 1) + 1 = ((n + 1) + 1)^2 So (n + 1)^2 (n^2 + 4(n + 1)) / 4 = (n + 1)^2((n + 1) + 1)^2 / 4 and the equation also holds for n + 1. Then by the definition of the natural numbers, the equation holds for all natural numbers. Done. So, that's an example of proof by mathematical induction. (5) Fundamental Theorem of Arithmetic A prime number is a natural number like 1, 3, 5, 7, 11, 13, 17, 19, 23, ..., that is, evenly divisible by only itself and 1. Prime numbers have been studied since the ancient Greeks, and there are many difficult questions easy to state; now we have answers to some of the questions. Consider 45: 45 = 3 * 3 * 5 So, we have written 45 as a product of prime numbers. It is easy enough to see that any natural number can be written as a product of prime numbers. The Fundamental Theorem of Arithmetic is that each natural number can be written as a product of prime numbers in just one way, e.g., where we neglect the order of the prime numbers in the product. So, 45 = 3 * 3 * 5 is the only way to write 45 as a product of prime numbers. (6) High School Algebra A quadratic is an algebraic expression of the form ax^2 + bx + c A polynomial is the same except can have higher natural number powers of x, e.g., 7x^5 - 4x^3 + 2x - 1 Polynomials play an important role in linear algebra -- e.g., via determinants and eigenvalues. Polynomials are also used in error correcting codes and related work. There have been attempts to use polynomials in curve fitting, but for large natural numbers n the x^n term means that as go on the real line a long way from 0, commonly the value of the polynomial goes a very long way from 0, so far from 0 that it is usually unrealistic for applications. That is, polynomials don't provide good, versatile means of curve fitting. Also interesting and useful is the binomial, for natural number n and numbers x and y (x + y)^n Presumably the name binomial is from having the two numbers, x and y. Curiously, surprisingly, this binomial is important in various approximations and in combinations, permutations, probability, and statistics. (7) Second Year High School Algebra A root of a polynomial is a value of x that makes the value of the polynomial 0. The fundamental theorem of algebra is that each polynomial can be written as (ax + p)(bx + q) ... (cx + r) where the p, q, ... r are roots of the polynomial. The theorem holds for polynomials with either real or complex coefficients. The roots, even with only real coefficients, can be complex. I've omitted some details due to the challenge of typing math. Mathematicians worked for centuries to get good proofs of this result. Also might be covered are the algorithms for least common multiple and greatest common divisor. These were known to the ancient Greeks and get used currently. We can define a function f by, for any number x, f(x) = ax^2 + bx + c So, function f is a look-up table -- plug in a value for x and get back the value of ax^2 + bx + c Since the x is a number, we say that the domain of the function f is the set of numbers, usually the set of real numbers. In this case, the range of function f is also the set of real numbers. We can have look-up tables for telephone numbers -- the domain a set of names of people and the range a set of telephone numbers. We can have a function for Internet addresses, domain URLs and range, say, the 64 bit internet addresses. So, functions have enormous generality -- given any two non-empty sets A and B, we can have a function with domain A and range B and to indicate that f is a function with domain A and range B write f: A --> B