Difference between revisions of "MAT3013"
Line 446: | Line 446: | ||
* Overview of the course and its goals | * Overview of the course and its goals | ||
* Ideas of proofs and logic | * Ideas of proofs and logic | ||
− | * | + | * Logical statements |
− | || 1.1 | + | || 1.1-1.2 |
|| | || | ||
Line 462: | Line 462: | ||
|- | |- | ||
|2 | |2 | ||
− | || | + | || Informal logic |
|| | || | ||
− | * | + | * Statements |
− | * | + | * Relation between statements |
− | * | + | * Valid Arguments |
* Quantifiers | * Quantifiers | ||
− | || 1. | + | || 1.1-1.5 |
|| | || | ||
|| Gain the prerequisites for | || Gain the prerequisites for | ||
Line 481: | Line 481: | ||
|- | |- | ||
|3 | |3 | ||
− | || | + | || Strategies for proofs |
− | || | + | || |
− | || | + | * Why we need proofs |
− | || | + | * Direct proofs |
+ | * Proofs by contrapositive and contradiction | ||
+ | * Cases and If and Only If | ||
+ | || 2.2-2.4 | ||
+ | || informal logic | ||
|| Start proving elementary results. | || Start proving elementary results. | ||
|| | || | ||
Line 493: | Line 497: | ||
|- | |- | ||
|4 | |4 | ||
− | || Set theory | + | || Writing Mathematics/Set theory I |
|| | || | ||
* Basic concepts | * Basic concepts | ||
* Operations and constructions with sets | * Operations and constructions with sets | ||
− | || 2.1-3 | + | || 2.6, 3.1-3.3 |
− | || Basic concepts of set theory | + | || |
+ | *Writing math | ||
+ | *Basic concepts of set theory | ||
+ | *Set operations | ||
|| How to start working with sets | || How to start working with sets | ||
|| | || | ||
Line 508: | Line 515: | ||
|- | |- | ||
|5 | |5 | ||
− | || | + | || Set theory II |
|| | || | ||
− | * | + | * Family of sets |
− | * | + | * Axioms of set theory |
− | || | + | ||3.4-3.5 |
||Natural numbers | ||Natural numbers | ||
|| | || | ||
* Learn constructive proofs and reasoning. | * Learn constructive proofs and reasoning. | ||
− | * Learn basic | + | * Learn basic axiom of set theory |
|| | || | ||
− | |||
− | |||
* well ordering principle | * well ordering principle | ||
* inclusion-exclusion principle | * inclusion-exclusion principle | ||
Line 530: | Line 535: | ||
|- | |- | ||
|7 | |7 | ||
− | || | + | ||Functions I |
|| | || | ||
− | * | + | * Definition of functions |
− | * | + | * Image and inverse image |
− | || | + | * Composition and inverse functions |
+ | ||4.1-4.3 | ||
||Set theory | ||Set theory | ||
− | ||Gain basic concepts about | + | ||Gain basic concepts about functions. |
|| | || | ||
− | * | + | * |
− | * | + | * |
+ | |||
|- | |- | ||
|8 | |8 | ||
− | || | + | ||Functions II |
|| | || | ||
− | * | + | * Injectivity, surjectivity and bijectivity |
− | * | + | * Sets of functions |
− | || | + | ||4.4-4.5 |
− | |||
|| | || | ||
− | * | + | || |
− | * | + | * |
− | || | + | * |
+ | |||
+ | |||
+ | || Examples | ||
|- | |- | ||
|9 | |9 | ||
− | || | + | ||Relations I |
|| | || | ||
− | * | + | * Relations |
− | * | + | * Congruence |
− | || | + | ||5.1-5.2 |
|| | || | ||
* Relations | * Relations | ||
* Function sense (precalculus) | * Function sense (precalculus) | ||
− | || Gain basic rigorous knowledge of | + | || Gain basic rigorous knowledge of relations. |
|| | || | ||
− | + | ||
|- | |- | ||
|10 | |10 | ||
− | || | + | ||Relations II |
|| | || | ||
− | * | + | * Equivalence relations |
− | |||
− | |||
||4.3-4 | ||4.3-4 | ||
||Functions 1 | ||Functions 1 | ||
|| | || | ||
− | * | + | * |
− | |||
|| | || | ||
− | * | + | * |
− | |||
|- | |- | ||
|11 | |11 | ||
− | || | + | ||Finite and infinite sets II |
|| | || | ||
− | * | + | * Introduction |
− | * | + | * Properties of natural numbers |
− | + | ||6.1-6.2 | |
− | || | ||
||Functions 2 | ||Functions 2 | ||
||Find images and preimages of subsets under functions, with proofs. | ||Find images and preimages of subsets under functions, with proofs. | ||
Line 594: | Line 598: | ||
* examples with finite sets | * examples with finite sets | ||
* many precalculus examples | * many precalculus examples | ||
+ | |||
|- | |- | ||
Line 600: | Line 605: | ||
* Catch up and review | * Catch up and review | ||
* Midterm 2 | * Midterm 2 | ||
+ | |||
+ | |||
|- | |- | ||
|13 | |13 | ||
− | || | + | || Finite and infinite sets II |
|| | || | ||
− | * | + | * Mathematical induction |
− | * | + | * Recursion |
− | || | + | ||6.2-6.3 |
||Sets and functions | ||Sets and functions | ||
|| | || | ||
Line 615: | Line 622: | ||
|- | |- | ||
|14 | |14 | ||
− | || | + | || Finite and infinite sets III |
− | || | + | || |
− | || | + | *Cardinality of sets |
− | ||Cardinality 1 | + | * Finite sets and countable sets |
+ | *Cardinality of number systems | ||
+ | || 6.4 - 6.7 | ||
+ | || Cardinality 1 | ||
||Learn properties of countable sets. | ||Learn properties of countable sets. | ||
|| | || |
Revision as of 07:23, 27 July 2020
Foundations of Mathematics (3-0) 3 Credit Hours
Contents
Course Catalog
MAT 3013. Foundations of Mathematics. (3-0) 3 Credit Hours.
Prerequisite: MAT1214. Development of theoretical tools for rigorous mathematics. Topics may include mathematical logic, propositional and predicate calculus, set theory, functions and relations, cardinal and ordinal numbers, Boolean algebras, and construction of the natural numbers, integers, and rational numbers. Emphasis on theorem proving. (Formerly MAT2243. Credit cannot be earned for MAT3013 and MAT2243.) Generally offered: Fall, Spring, Summer. Differential Tuition: $150.
Description
Foundations of Mathematics is a pivotal course for mathematics majors. It serves as the first major step towards modern mathematics of rigorous proofs and a true pre-requisite to real analysis and abstract algebra. Up to this point students are asked to do few proofs (notably geometry and perhaps some epsilon-delta in calculus). The course particularly emphasizes set-theoretical constructions, such as functions, composition, inversion, forward and inverse images, relations, equivalence relations, partial orders, quotient sets and products and unions of sets, vital to further work in mathematics.
Evaluation
- No makeup exams are offered.
- An absence may be excused if sufficient evidence of extenuating circumstances is provided. In this case, the final exam grade
could be used as the grade for the missed exam.
- Students will have access to several past exams for practice.
Text
- D. Smith, M. Eggen, R. St. Andre, A Transition to Advanced Mathematics (7e), Brooks/Cole
- Ethan D. Bloch, Proofs and Fundamentals: A First Course in Abstract Mathematics, 2nd ed, Springer (2011). https://link-springer-com.libweb.lib.utsa.edu/book/10.1007%2F978-1-4419-7127-2
Topics List A
Date | Sections | Topics | Prerequisite Skills | Student Learning Outcomes |
---|---|---|---|---|
1.0 |
|
|
| |
1.0 |
|
| ||
1.0 |
|
| ||
1.0 |
|
| ||
1.0 |
|
| ||
2.0 |
|
| ||
2.0 |
|
| ||
2.0 |
|
| ||
2.0 |
|
| ||
3.0 |
|
| ||
4.0 |
|
| ||
4.0 |
|
| ||
4.0 |
|
| ||
5.0 |
|
| ||
5.0 |
|
| ||
6.0 |
|
|||
7.0 |
|
| ||
7.0 |
|
| ||
7.0 |
|
| ||
8.0 |
|
| ||
8.0 |
|
| ||
9.0 |
|
|
| |
9.0 |
|
|
| |
10.0 |
|
| ||
10.0 |
|
| ||
10.0 |
|
| ||
11.0 |
|
| ||
11.0 |
|
| ||
11.0 |
|
|||
12.0 |
|
|||
13.0 |
|
| ||
13.0 |
|
| ||
13.0 |
|
|||
14.0 |
|
| ||
14.0 |
|
| ||
15.0 |
|
Topics List B
Week | Session | Topics | Section | Prerequisite skills | Learning outcomes | Examples |
---|---|---|---|---|---|---|
1 | Introduction |
|
1.1-1.2 |
mathematics from a historical perspective
and why this course is going | ||
2 | Informal logic |
|
1.1-1.5 | Gain the prerequisites for
writing and evaluating proofs. |
| |
3 | Strategies for proofs |
|
2.2-2.4 | informal logic | Start proving elementary results. |
|
4 | Writing Mathematics/Set theory I |
|
2.6, 3.1-3.3 |
|
How to start working with sets |
|
5 | Set theory II |
|
3.4-3.5 | Natural numbers |
|
|
6 |
| |||||
7 | Functions I |
|
4.1-4.3 | Set theory | Gain basic concepts about functions. |
|
8 | Functions II |
|
4.4-4.5 |
|
Examples | |
9 | Relations I |
|
5.1-5.2 |
|
Gain basic rigorous knowledge of relations. | |
10 | Relations II |
|
4.3-4 | Functions 1 |
|
|
11 | Finite and infinite sets II |
|
6.1-6.2 | Functions 2 | Find images and preimages of subsets under functions, with proofs. |
|
12 |
| |||||
13 | Finite and infinite sets II |
|
6.2-6.3 | Sets and functions |
|
|
14 | Finite and infinite sets III |
|
6.4 - 6.7 | Cardinality 1 | Learn properties of countable sets. | |
15 |
|
Topics List C (Proofs and Fundamentals)
Week | Session | Topics | Section | Prerequisite skills | Learning outcomes | Examples |
---|---|---|---|---|---|---|
1 | Introduction |
|
1.1 |
mathematics from a historical perspective
and why this course is going | ||
2 | Propositional logic |
|
1.2-3 | Gain the prerequisites for
writing and evaluating proofs. |
| |
3 | Proof methods | Methods for proofs | 1.4-6 | Propositional logic | Start proving elementary results. |
|
4 | Set theory |
|
2.1-3 | Basic concepts of set theory | How to start working with sets |
|
5 | Induction and counting |
|
2.4-6 | Natural numbers |
|
|
6 |
| |||||
7 | Relations 1 |
|
3.1-3 | Set theory | Gain basic concepts about relations. |
|
8 | Relations 2 |
|
3.4-5 | Relations 1 |
|
partial ordering of the power set under inclusion |
9 | Functions 1 |
|
4.1-2 |
|
Gain basic rigorous knowledge of functions. |
functional composition |
10 | Functions 2 |
|
4.3-4 | Functions 1 |
|
|
11 | Functions 3 |
|
4.5-6 | Functions 2 | Find images and preimages of subsets under functions, with proofs. |
|
12 |
| |||||
13 | Cardinality 1 |
|
5.1-2 | Sets and functions |
|
|
14 | Cardinality 2 | Countable and uncountable sets | 5.3-5 | Cardinality 1 | Learn properties of countable sets. | |
15 |
|