MATH 3200: Introduction to Higher Mathematics

MWF 11:30 AM-12:20 PM, Boyd Graduate Studies Building, Room 303
Fall 2024
Pollack's office:
406 Boyd GSRC
Dahlen Elstran's office:
434F Boyd GSRC

Office hours (Pollack):
T 2:15-3:15
W 3:00-5:00
F 3:00-4:00

Office hour (Elstran):
M 1:00-2:00

Current assignments/other course materials
  • "Homework" 7 (practice only; not to turn in!)PDF
  • Final exam learning objectives/review sheetPDF
  • Exam #2 learning objectives/review sheetPDF
  • Read section 5.2 5.3 (you can skip 5.2)complete by 11/13
  • Assignment #6due 11/13PDF
  • Assignment #5due 10/30 11/4PDF
  • Exam #1 learning objectives/review sheetPDF
  • Read section 5.1complete by 10/25
  • Assignment #4due 10/18PDF
  • Read sections 4.4--4.5.complete by 10/14
  • Read sections 4.1--4.3 in the text.complete by 9/20
  • Assignment #3due 9/25PDF
  • Read Chapter 3 in the text.complete by 9/4
  • Assignment #2due 9/4PDF
  • Read Chapter 2 in the course text.complete by 8/23
  • Assignment #1due 8/28PDF
  • Read section 1.4 in the course text.complete by 8/21
  • Read section 1.3 in the course text.complete by 8/19
  • Watch your inbox for a class questionnaire.
    Read sections 1.1 and 1.2 in the course text.
    complete by 8/16
Course summary to date (reverse chronological order)
  • 11/25 Left inverse functions. Right inverse functions. Inverse functions. $f$ has an inverse if and only if $f$ is a bijection. The inverse funcntion of $f$, if it exists, is unique.
  • 11/22 One-to-one and onto functions, continued. Composition of functions.
  • 11/20 One-to-one and onto functions.
  • 11/18 Proofs with functions (e.g., $f(A\cup B) = f(A) \cup f(B)$).
  • 11/15 Exam #2.
  • 11/13 Introduction to functions.
  • 11/11 More on equivalence classes: $[x] = [y] \Longleftrightarrow x\sim y$, and for any two equivalence classes, either $[x]=[y]$ or $[x]\cap [y]=\emptyset$. Equivalence classes and set partitions.
  • 11/8 Coming to terms with equivalence classes.
  • 11/6 Equivalence relations. Introduction to equivalence classes.
  • 11/4 Practice with symmetric, reflexive, and transitive relations.
  • 10/30 Domain and range of relations. More on symmetric relations.
  • 10/28 Practice with relations. Start of discussion of symmetric relations.
  • 10/25 More on index sets. Definition of relations. Pass back HW #4.
  • 10/23 Completion of power sets. Introduction to index sets.
  • 10/21 More proving identities with power sets.
  • 10/18 Introduction to power sets. Proving identities with power sets.
  • 10/16 Formulas for $|A\cup B \cup C|$ and $|A\cup B \cup C \cup D|$. Counting integers $1\le n \le 105$ divisible by $3, 5$, or $7$.
  • 10/14 Identities for product sets with element chasing. Formulas for $|A\cup B|$ and $|A\cup B \cup C|$.
  • 10/11 "Beyond element chasing", conclusion. Start of discussion of product sets.
  • 10/9 "Beyond element chasing".
  • 10/7 More practice proving set equality through element chasing. Start of "beyond element chasing".
  • 10/4 Proving equality through element chasing. Venn diagrams. Pass back exams and HW #3.
  • 10/2 Exam.
  • 9/30 Set equality. Set operations: intersection, union, set subtraction, complements (relative to an overarching/universal set).
  • 9/25 Fundamental set definitions, continued. Discussion of how to show $A \subseteq B$.
  • 9/23 Uga nuggets. Start of discussion of sets.
  • 9/20 More on strong induction.
  • 9/18 Strong induction, continued.
  • 9/16 Strong induction, continued.
  • 9/13 Start of strong induction.
  • 9/11 Induction, the adventure continues.
  • 9/6 Further practice with induction.
  • 9/4 Wrap up of the wrap up problem. Introduction to induction.
  • 8/30 Wrap up of $\sqrt{2}$ being irrational. More practice with inequalities.
  • 8/28 More inequality proofs. Group work on $\sqrt{2}$ being irrational.
  • 8/26 More on parity proofs. Inequality proofs.
  • 8/23 Direct proof, proof by contrapositive, proof by contradiction. Parity proofs.
  • 8/21 Recap of implications, converse, inverese, and contrapositive. Quantifiers. Negations.
  • 8/19 Equivalence of compound statements. Verifying equivalence with truth tables. An implication is equivalent to its contrapositive. The converse and inverse are equivalent.
  • 8/16 Statements. Forming new statements from old via AND, NOT, OR, and IMPLIES, and the corresponding truth values.
  • 8/14Discussion of syllabus [static copy here]. Some "food for thought".
Course content summary

Given that this class is titled "Introduction to Higher Mathematics.", it makes sense for us to begin by discussing what "higher" mathematics is, and how it differs from the more terrestrial flavor of mathematics you are likely accustomed to.

A useful way of conceptualizing higher mathematics can be seen in a common name people have for courses like MATH 3200. MATH 3200 is what many people would call a "transition course". The transition is away from a focus on computation, and away from an emphasis on correct answers as the end goal. The transition is towards a focus on logical reasoning, and towards an emphasis on deep conceptual understanding.

Why is there such an emphasis placed on logical reasoning? One answer is: Communication! If two groups of people are given the same mathematical problem, the group claiming a solution needs to be able to convince the others that they indeed have found a solution.

Depending on the problem, convincing someone you have a solution can be easy or difficult. As an example of the former, suppose you are asked to prove that 2024 can be written as a sum of four squares of integers. If you know that $2024 = 4^2 + 6^2 + 6^2 + 44^2$, you can convince someone else of this fact just by showing them that equation. But what if the problem is as follows?

PROBLEM: Show that every positive integer is a sum of four squares.

How could you convince someone that you solved that? It would not be enough to communicate representations of integers up to $100$, $1000$, or $10^{100}$, as there are infinitely many numbers beyond any of these limits. What is needed here is a logical argument, starting from points both parties can agree upon, and which proceeds in a manner that both parties endorse. This is what is meant by mathematical proof. The goal of this class is to introduce you to the art and science of writing mathematical proofs.

(The above PROBLEM describes a famous result from Number Theory, which is MATH 4400.)

Course structure

This class is, unapologetically, structured to emphasize active learning. Active learning is the crazy idea is that you learn mathematics best by doing mathematics, not by hearing someone else talk about it. Just as you hone your athletic abilities not by sitting on the bench but by getting out in the field and running after the sportsball, you hone your mathletic abilities not by listening to me lecture but by solving math problems.

What does this mean in practice? If you haven't taken other classes that emphasize active learning, you should expect a different kind of classroom experience. Rather than spending 50 minutes on lecture each time we meet, a typical day will start with a brief mini-lecture, recapping the readings --- readings you are expected to have completed outside of class. (You should expect to have regular assigned readings.) The rest of our time together will usually be devoted to problem solving with your classmates, in groups --- with occasional assistance from myself, when necessary. I may occasionally call on you to present solutions; this means that you can expect oral feedback both from myself and from your classmates.

This way of learning mathematics may require you to step out of your comfort zone. This is a big ask. In return, I promise to do my best to provide you with a supportive environment. It's OK to find something difficult or confusing. That's part of learning mathematics, and the struggle is present at every level, perhaps even more so the further you advance. (I myself am confused almost all of the time.) Please help me out by doing your best to be show support to your classmates. Aim your comments to be thoughtful, respectful, and constructive.

Finally, I would like to encourage you to use me as a resource, and to stop by office hours (mine and those of the TA) when you have questions. Those might be questions about the reading, questions about class activities, or questions about a past or present homework assignment.

Textbook (free!)

We will aim to cover all five chapters.

It is always a good idea when learning a subject to consult multiple sources. Different authors have different styles, some of which will sing to your soul more or less than others. For the material we will cover two free online options are Book of Proof by Hammack and Mathematical Reasoning: Writing and Proof by Sundstrom. (These are optional additional resources; you are not expected or required to look at them.)

Exam dates

There are two in-class midterm exams as well as a final exam.

  • Midterm #1: Friday, Sept. 20 Sept. 27
  • Midterm #2: Friday, Nov. 1 Nov. 15
  • Final exam: Wed, December 11, 12:00 - 3:00 PM (usual classroom)

No make-up exams will be given. The final exam is cumulative.

Attendance/ Homework /Exam Policies

Your grade is made up of the following weighted components:

  • Each midterm: 20% (total of 40%)
  • Homework: 25%
  • Final exam: 35%

You are expected to participate in class. In particular, attendance in this course is required. More than four unexcused absences may result in you being withdrawn from the course. Keep me posted whenever you have a conflict that requires you to miss class and this should not be an issue.

All exams are in-class, closed book, and closed notes.

Homework will be collected in class regularly (every week or two). Late homework will not be accepted. If you have a need to turn in HW early, that can be arranged. HW problems are graded out of 10 points. You will be given an opportunity to correct your assignments and recover up to 9 of the 10 points. For this, you must turn in your revisions to our TA within 1 week of the date the assignment is returned to you. This opportunity is only open to students who turned in a first version of the problems on time. Your lowest homework score will be dropped at the end of the semester.

On homework, collaboration is allowed and in fact is very much encouraged. Mathematics wouldn't be nearly as much fun if we couldn't talk about it with other people! However, copying (from a textbook or another student), web searches, and use of AI tools (such as ChatGPT) are not allowed, and you are required to write your own final solutions independently. Keep in mind that by entering UGA, you have already agreed to abide by the UGA Honor code described in detail at https://honesty.uga.edu/Academic-Honesty-Policy/Student-Honor-Code/.

In practice, what this means that you may discuss homework problems and their solutions with your classmates (and with me at office hours!), but you may not turn in a solution unless you understand it yourself. A reasonable rule of thumb is that you should be able to explain your solutions verbally to me (in all their gory detail) if requested to do so.

Special accommodations

Students with disabilities who may require special accommodations should talk to me as soon as possible. Appropriate documentation concerning disabilities may be required. For further information, please visit the Disabilities Resource Center page.

Mental health and wellness

If you or someone you know needs assistance, you are encouraged to contact Student Care and Outreach in the Division of Student Affairs at 706-542-8479 or visit https://sco.uga.edu. They will help you navigate any difficult circumstances you may be facing by connecting you with the appropriate resources or services. UGA has several resources for a student seeking mental health services (https://caps.uga.edu/well-being-prevention-programs-mental-health/) or crisis support (https://healthcenter.uga.edu/emergencies/).

FERPA Notice

The Federal Family Educational Rights and Privacy Act (FERPA) grants students certain information privacy rights. See the registrar’s explanation at reg.uga.edu/general-information/ferpa/. FERPA allows disclosure of directory information (name, address, telephone, email, major, activities, degrees, awards, prior schools), unless requested in a written letter to the registrar.

Disclaimer

The course syllabus is a general plan for the course; deviations announced to the class by the instructor may be necessary.