What are the fundamental concepts needed for advanced calculus?

  • Context: Graduate 
  • Thread starter Thread starter Asmodeus
  • Start date Start date
  • Tags Tags
    Conceptual
Click For Summary
SUMMARY

The discussion centers on the fundamental concepts necessary for mastering advanced calculus, specifically Analysis I. Key topics include proving uniqueness with inequalities, applying induction for inequality proofs, understanding infimum/supremum, and the identity function along with right/left inverses. The student seeks clarification on using induction to prove the uniqueness of integers in modular arithmetic, as well as the axioms governing operations in modular sets.

PREREQUISITES
  • Understanding of mathematical induction
  • Familiarity with inequalities and their proofs
  • Knowledge of infimum and supremum concepts
  • Basic understanding of modular arithmetic
NEXT STEPS
  • Study the principles of mathematical induction in depth
  • Learn how to prove inequalities rigorously
  • Explore infimum and supremum in real analysis
  • Research modular arithmetic and its applications in number theory
USEFUL FOR

First-year students in advanced calculus, mathematics majors, and anyone seeking to strengthen their understanding of foundational concepts in real analysis and modular arithmetic.

Asmodeus
Messages
3
Reaction score
0
Hello,

I'm a first-year student and I am in advanced calculus (specifically, Analysis I). I, however, switched into the class during the third week. So I am having quite a bit of difficulty, because I haven't learned any fundamental concepts.

So I am asking if someone can please discuss a couple of concepts/questions with me:

-How to prove uniqueness (specifically with inequalities)

-I know about induction, but I'm not sure how to use it to prove inequalities

-inf/sup/max/min

-identity function and right/left inverse

And for this question, I do not understand it at all:

"1a) let k be any natural number. use induction to prove: theorem

for any integer n, which is an integer, there is a unique q, which is an integer, such that 0 <= n+qk <k
(the resulting number n + qk {0,...,k-1} is somtines denoted "n mod k")

b)
for any n that is an integer (I have to be explicit, because I don't know how to type those math symbols) let [n] C Integers, be the subset.

[n] = {n+qk, q is any integer}

note that
[n + pk] = [n] for any n,p that are integers. hence, by part a) there are actually just k distinct subsets, [0],...,[k-1]. Let Z(subscript k) be the set of such subsets,

z(subscript k) = {[0],...,[k-1]}.

define an addition and a multiplication on z(subscript k) by

[n] + [m] = [n+m], [n][m]=[nm]

show that z(subscript 3) satifies the axioms (p1) to (p9), but z (subscript 4) does not. (don't have to write out the proof that these formulas for + and * are well-defined)."

the axioms are from my spivak textbook. can someone just discuss what is going on in this question.

Thanks for any help.
 
Physics news on Phys.org
advice, find a friend to work with. this is honors elementary calculus.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 21 ·
Replies
21
Views
4K
  • · Replies 0 ·
Replies
0
Views
4K