Difference between revisions of "MAT3013"

From Department of Mathematics at UTSA
Jump to navigation Jump to search
(Added Formatted Topics List)
 
(33 intermediate revisions by 4 users not shown)
Line 4: Line 4:
 
[https://catalog.utsa.edu/undergraduate/sciences/mathematics/#courseinventory MAT 3013. Foundations of Mathematics]. (3-0) 3 Credit Hours.
 
[https://catalog.utsa.edu/undergraduate/sciences/mathematics/#courseinventory MAT 3013. Foundations of Mathematics]. (3-0) 3 Credit Hours.
  
−
Prerequisite: MAT 1214. 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 MAT 2243. Credit cannot be earned for MAT 3013 and MAT 2243.) Generally offered: Fall, Spring, Summer. Differential Tuition: $150.
+
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==
 
==Description==
Line 25: Line 25:
 
==Text==
 
==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==
+
==Topics List==
 
{| class="wikitable sortable"
 
{| class="wikitable sortable"
 
! Date !! Sections !! Topics !! Prerequisite Skills !! Student Learning Outcomes
 
! Date !! Sections !! Topics !! Prerequisite Skills !! Student Learning Outcomes
 
|-
 
|-
−
|1.0
+
| <!-- * Week -->
 +
1.
 
||
 
||
−
* 1.1
+
<!-- * Sections -->
 +
* 1.1-1.2
 
||
 
||
−
* Historical remarks
+
<!-- * Topics -->
−
* Overview of the course and its goals
+
* [[Statements]]
−
* Ideas of proofs and logic
+
* [[Sentential Logic]]
−
* Axioms and propositions
 
 
||
 
||
−
 
+
<!-- * Prerequisites -->
 
||
 
||
−
* Motivation for rigorous mathematics from a historical perspective
+
<!-- * Outcomes -->
−
* An understanding of where and why this course is going
+
* Identify syntactically correct formulas in sentential logic.
 +
* Translate compound statements in informal language to formal propositional sentences.
 +
* Find the interpretation of a sentential formula given interpretations of the propositional symbols therein.
 
|-
 
|-
−
|2.0
+
| <!-- * Week -->
 +
2.
 
||
 
||
−
* 1.2-3
+
<!-- * Sections -->
 +
* 1.3-1.4
 
||
 
||
−
* Logical operators
+
<!-- * Topics -->
−
* Truth values
+
* [[Logical Implication]]
−
* Truth tables
+
* [[Logical Equivalence]]
−
* Quantifiers
+
* [[Deductive Rules]]
−
* nan
 
 
||
 
||
−
 
+
<!-- * Prerequisites -->
 +
* [[Sentential Logic]]
 
||
 
||
−
* Gain the prerequisites for writing and evaluating proofs.
+
<!-- * Outcomes -->
 +
* Express informally stated relations between sentences in terms of semantic implication and equivalence.
 +
* State and recognize basic rules of deductive reasoning and their correct application.
 +
* Use the rules of deduction to prove basic semantic relations (implication or equivalence) between formal interpretations of propositional formulas.
 +
* Distinguish between correct and incorrect applications of deductive rules.
 
|-
 
|-
−
|3.0
+
| <!-- * Week -->
 +
3.
 
||
 
||
−
* 1.4-6
+
<!-- * Sections -->
 +
* 1.5-2.2
 
||
 
||
−
* Methods for proofs
+
<!-- * Topics -->
 +
* [[Quantifiers]]
 +
* [[Mathematical Proofs]]
 +
* [[Proofs:Direct]]
 
||
 
||
−
* Propositional logic
+
<!-- * Prerequisites -->
 +
* [[Sentential Logic]]
 +
* [[Deductive Rules]]
 
||
 
||
−
* Start proving elementary results.
+
<!-- * Outcomes -->
 
|-
 
|-
−
|4.0
+
| <!-- * Week -->
 +
4.
 
||
 
||
−
* 2.1-3
+
<!-- * Sections -->
 +
* 2.3-2.4
 
||
 
||
−
* Basic concepts
+
<!-- * Topics -->
−
* Operations and constructions with sets
+
* [[Proofs:Contraposition]]
 +
* [[Proofs:Contradiction]]
 +
* [[Proofs:Cases]]
 
||
 
||
−
* Basic concepts of set theory
+
<!-- * Prerequisites -->
 +
* [[Mathematical Proofs]]
 +
* [[Proofs:Direct]]
 
||
 
||
−
* How to start working with sets
+
<!-- * Outcomes -->
 
|-
 
|-
−
|5.0
+
| <!-- * Week -->
 +
5.
 
||
 
||
−
* 2.4-6
+
<!-- * Sections -->
 +
* 2.4-2.6
 
||
 
||
−
* Mathematical induction
+
<!-- * Topics -->
−
* Counting principles
+
* [[Proofs:Biconditionals]]
 +
* [[Proofs:Quantifiers]]
 +
* [[Writing Mathematics]]
 
||
 
||
−
* Natural numbers
+
<!-- * Prerequisites -->
 +
* [[Quantifiers]]
 +
* [[Mathematical Proofs]]
 
||
 
||
−
* Learn constructive proofs and reasoning.
+
<!-- * Outcomes -->
−
* Learn basic counting principles of discrete mathematics.
 
 
|-
 
|-
−
|6.0
+
| <!-- * Week -->
 +
6.
 
||
 
||
−
 
+
<!-- * Sections -->
 +
* 3.1-3.3
 
||
 
||
−
 
+
<!-- * Topics -->
 +
* [[Sets:Definitions]]
 +
* [[Sets:Operations]]
 +
* [[Sets:Families]]
 
||
 
||
−
 
+
<!-- * Prerequisites -->
 
||
 
||
−
 
+
<!-- * Outcomes -->
 
|-
 
|-
−
|7.0
+
| <!-- * Week -->
 +
7.
 
||
 
||
−
* 3.1-3
+
<!-- * Sections -->
 
||
 
||
−
* Cartesian products and their subsets
+
<!-- * Topics -->
−
* Equivalence relations
+
* Review of Chapters 1-3.
 +
* Midterm exam.
 
||
 
||
−
* Set theory
+
<!-- * Prerequisites -->
 
||
 
||
−
* Gain basic concepts about relations.
+
<!-- * Outcomes -->
 
|-
 
|-
−
|8.0
+
| <!-- * Week -->
 +
8.
 
||
 
||
−
* 3.4-5
+
<!-- * Sections -->
 +
* 4.1-4.3
 
||
 
||
−
* Partial orders
+
<!-- * Topics -->
−
* Graphs
+
* [[Functions:Definition]]
 +
* [[Functions:Forward Image]]
 +
* [[Functions:Forward Image|Functions:Inverse Image]]
 +
* [[Functions:Composition]]
 
||
 
||
−
* Relations 1
+
<!-- * Prerequisites -->
 +
* [[Sets:Definitions]]
 +
* [[Sets:Operations]]
 
||
 
||
−
* Familiarize with ordering.
+
<!-- * Outcomes -->
−
* Learn how to use graph representations of relations.
 
−
* nan
 
 
|-
 
|-
−
|9.0
+
| <!-- * Week -->
 +
9.
 
||
 
||
−
* 4.1-2
+
<!-- * Sections -->
 +
* 4.3-4.4
 
||
 
||
−
* Functions
+
<!-- * Topics -->
−
* Constructions with functions
+
* [[Functions:Inverses]]
 +
* [[Functions:Injective]]
 +
* [[Functions:Surjective]]
 +
* [[Functions:Bijective]]
 
||
 
||
−
* Relations
+
<!-- * Prerequisites -->
−
* Function sense (precalculus)
+
* [[Functions:Definition]]
 +
* [[Functions:Composition]]
 
||
 
||
−
* Gain basic rigorous knowledge of functions.
+
<!-- * Outcomes -->
 
|-
 
|-
−
|10.0
+
| <!-- * Week -->
 +
10.
 
||
 
||
−
* 4.3-4
+
<!-- * Sections -->
 +
* 5.1 & 5.3
 
||
 
||
−
* One-to-one
+
<!-- * Topics -->
−
* Onto
+
* [[Relations]]
−
* Compositional inverse
+
* [[Functions as Relations]]
 +
* [[Equivalence Relations]]
 
||
 
||
−
* Functions 1
+
<!-- * Prerequisites -->
 +
* [[Sets:Definitions]]
 +
* [[Sets:Operations]]
 
||
 
||
−
* Determine whether a function is one-to-one of onto, with proofs.
+
<!-- * Outcomes -->
−
* Finding inverses
 
 
|-
 
|-
−
|11.0
+
| <!-- * Week -->
 +
11.
 
||
 
||
−
* 4.5-6
+
<!-- * Sections -->
 +
* 6.1-6.3
 
||
 
||
−
* Images of subsets
+
<!-- * Topics -->
−
* Preimages of subsets
+
* [[Natural Numbers:Postulates]]
−
* Sequences
+
* [[Natural Numbers:Well-Ordering]]
 +
* [[Proofs:Induction]]
 
||
 
||
−
* Functions 2
+
<!-- * Prerequisites -->
 +
* [[Sets:Definitions]]
 +
* [[Functions:Definition]]
 +
* [[Relations]]
 
||
 
||
−
* Find images and preimages of subsets under functions, with proofs.
+
<!-- * Outcomes -->
 
|-
 
|-
−
|12.0
+
| <!-- * Week -->
 +
12.
 
||
 
||
−
 
+
<!-- * Sections -->
 +
* 6.3-6.4
 
||
 
||
−
 
+
<!-- * Topics -->
 +
* [[Proofs:Induction|Induction:Variants]]
 +
* [[Recursion]]
 
||
 
||
−
 
+
<!-- * Prerequisites -->
 +
* [[Proofs:Induction]]
 +
* [[Functions:Definition]]
 
||
 
||
−
 
+
<!-- * Outcomes -->
 
|-
 
|-
−
|13.0
+
| <!-- * Week -->
 +
13.
 
||
 
||
−
* 5.1-2
+
<!-- * Sections -->
 +
* 6.5
 
||
 
||
−
* Finite and infinite sets
+
<!-- * Topics -->
−
* Equivalent sets
+
* [[Sets:Cardinality]]
 
||
 
||
−
* Sets and functions
+
<!-- * Prerequisites -->
 +
* [[Sets:Definitions]]
 +
* [[Equivalence Relations]]
 +
* [[Functions:Injective]]
 +
* [[Functions:Bijective]]
 
||
 
||
−
* Learn classification of sets by size.
+
<!-- * Outcomes -->
−
* Generalizing the concept of size to infinite sets
 
 
|-
 
|-
−
|14.0
+
| <!-- * Week -->
 +
14.
 
||
 
||
−
* 5.3-5
+
<!-- * Sections -->
 +
* 6.6-6.7
 
||
 
||
−
* Countable and uncountable sets
+
<!-- * Topics -->
 +
* [[Sets:Finite]]
 +
* [[Sets:Countable]]
 +
* [[Sets:Uncountable]]
 +
* [[Cardinality of important sets|Cardinality:𝐍]]
 +
* [[Cardinality of important sets|Cardinality:𝐙]]
 +
* [[Cardinality of important sets|Cardinality:𝐐]]
 +
* [[Cardinality of important sets|Cardinality:𝐑]]
 
||
 
||
−
* Cardinality 1
+
<!-- * Prerequisites -->
 +
* [[Sets:Cardinality]]
 +
* [[Natural Numbers:Postulates]]
 
||
 
||
−
* Learn properties of countable sets.
+
<!-- * Outcomes -->
 
|-
 
|-
−
|15.0
+
| <!-- * Week -->
 +
15.
 
||
 
||
−
 
+
<!-- * Sections -->
 
||
 
||
−
 
+
<!-- * Topics -->
 +
* Catch-up and review for final exam.
 
||
 
||
−
 
+
<!-- * Prerequisites -->
−
||
 
−
 
 
−
|}
 
−
 
 
−
==Topics List B==
 
−
{| class="wikitable sortable"
 
−
! Week !! Session !! Topics !! Section !! Prerequisite skills !! Learning outcomes !! Examples
 
−
 
 
−
|-
 
−
|1
 
−
 
 
−
|| Introduction
 
−
 
 
−
||
 
−
* Historical remarks
 
−
* Overview of the course and its goals
 
−
* Ideas of proofs and logic
 
−
* Axioms and propositions
 
−
 
 
−
|| 1.1
 
−
 
 
−
||
 
−
 
 
−
||
 
−
 
 
−
* Motivation for rigorous
 
−
mathematics from a
 
−
historical perspective
 
−
* An understanding of where
 
−
and why this course is
 
−
going
 
−
|-
 
−
|2
 
−
|| Propositional logic
 
−
||
 
−
* Logical operators
 
−
* Truth values
 
−
* Truth tables
 
−
* Quantifiers
 
−
 
 
−
|| 1.2-3
 
−
||
 
−
|| Gain the prerequisites for
 
−
writing and evaluating
 
−
proofs.
 
−
||
 
−
* connectives
 
−
* conditionals
 
−
* biconditionals
 
−
 
 
−
|-
 
−
|3
 
−
|| Proof methods
 
−
|| Methods for proofs
 
−
|| 1.4-6
 
−
|| Propositional logic
 
−
|| Start proving elementary results.
 
−
||
 
−
* direct proofs
 
−
* ''modus ponens''
 
−
* proofs by contradiction
 
−
 
 
−
|-
 
−
|4
 
−
|| Set theory
 
−
||
 
−
* Basic concepts
 
−
* Operations and constructions with sets
 
−
|| 2.1-3
 
−
|| Basic concepts of set theory
 
−
|| How to start working with sets
 
−
||
 
−
* notation
 
−
* subsets
 
−
* proving sets are equal
 
−
* unions, intersections, complements
 
−
 
 
−
|-
 
−
|5
 
−
|| Induction and counting
 
−
||
 
−
* Mathematical induction
 
−
* Counting principles
 
−
||2.4-6
 
−
||Natural numbers
 
−
||
 
−
* Learn constructive proofs and reasoning.
 
−
* Learn basic counting principles of discrete mathematics.
 
−
||
 
−
* sums of consecutive powers
 
−
* other induction proofs
 
−
* well ordering principle
 
−
* inclusion-exclusion principle
 
−
|-
 
−
|6
 
−
||
 
−
* Catch up and review
 
−
* Midterm 1
 
−
 
 
−
|-
 
−
|7
 
−
||Relations 1
 
−
||
 
−
* Cartesian products and their subsets
 
−
* Equivalence relations
 
−
||3.1-3
 
−
||Set theory
 
−
||Gain basic concepts about relations.
 
−
||
 
−
* modular congruence
 
−
* gluing sets
 
−
|-
 
−
|8
 
−
||Relations 2
 
−
||
 
−
* Partial orders
 
−
* Graphs
 
−
||3.4-5
 
−
||Relations 1
 
−
||
 
−
* Familiarize with ordering.
 
−
* Learn how to use graph representations of relations.
 
−
|| partial ordering of the power set under inclusion
 
−
|-
 
−
|9
 
−
||Functions 1
 
−
||
 
−
* Functions
 
−
* Constructions with functions
 
−
||4.1-2
 
−
||
 
−
* Relations
 
−
* Function sense (precalculus)
 
−
|| Gain basic rigorous knowledge of functions.
 
−
||
 
−
functional composition
 
−
|-
 
−
|10
 
−
||Functions 2
 
−
||
 
−
* One-to-one
 
−
* Onto
 
−
* Compositional inverse
 
−
||4.3-4
 
−
||Functions 1
 
−
||
 
−
* Determine whether a function is one-to-one of onto, with proofs.
 
−
* Finding inverses
 
−
||
 
−
* examples with finite sets
 
−
* many precalculus examples
 
−
 
 
−
|-
 
−
|11
 
−
||Functions 3
 
−
||
 
−
* Images of subsets
 
−
* Preimages of subsets
 
−
* Sequences
 
−
||4.5-6
 
−
||Functions 2
 
−
||Find images and preimages of subsets under functions, with proofs.
 
−
||
 
−
* examples with finite sets
 
−
* many precalculus examples
 
−
 
 
−
|-
 
−
|12
 
−
||
 
−
* Catch up and review
 
−
* Midterm 2
 
−
|-
 
−
|13
 
−
||Cardinality 1
 
−
||
 
−
* Finite and infinite sets
 
−
* Equivalent sets
 
−
||5.1-2
 
−
||Sets and functions
 
−
||
 
−
* Learn classification of sets by size.
 
−
* Generalizing the concept of size to infinite sets
 
−
||
 
−
 
 
−
|-
 
−
|14
 
−
||Cardinality 2
 
−
|| Countable and uncountable sets
 
−
||5.3-5
 
−
||Cardinality 1
 
−
||Learn properties of countable sets.
 
−
||
 
−
|-
 
−
|15
 
 
||
 
||
−
*Catch up and review for final
+
<!-- * Outcomes -->
−
* Study days
 
 
|}
 
|}
  

Latest revision as of 14:15, 14 October 2021

Foundations of Mathematics (3-0) 3 Credit Hours

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

Topics List

Date Sections Topics Prerequisite Skills Student Learning Outcomes

1.

  • 1.1-1.2
  • Identify syntactically correct formulas in sentential logic.
  • Translate compound statements in informal language to formal propositional sentences.
  • Find the interpretation of a sentential formula given interpretations of the propositional symbols therein.

2.

  • 1.3-1.4
  • Express informally stated relations between sentences in terms of semantic implication and equivalence.
  • State and recognize basic rules of deductive reasoning and their correct application.
  • Use the rules of deduction to prove basic semantic relations (implication or equivalence) between formal interpretations of propositional formulas.
  • Distinguish between correct and incorrect applications of deductive rules.

3.

  • 1.5-2.2

4.

  • 2.3-2.4

5.

  • 2.4-2.6

6.

  • 3.1-3.3

7.

  • Review of Chapters 1-3.
  • Midterm exam.

8.

  • 4.1-4.3

9.

  • 4.3-4.4

10.

  • 5.1 & 5.3

11.

  • 6.1-6.3

12.

  • 6.3-6.4

13.

  • 6.5

14.

  • 6.6-6.7

15.

  • Catch-up and review for final exam.

See also

Retrieved from "https://mathresearch.utsa.edu/wiki/index.php?title=MAT3013&oldid=2281"