Calculus I
Number sets, functions, limits, continuity, derivatives, integrals, series and differential equations. Every topic with step-by-step theory, worked examples and solved exercises.
Complete Theory
4Natural numbers : . Used for counting discrete objects. In we can add and multiply, but not freely subtract ().
Integers : . By introducing negatives, subtraction becomes always possible. Every integer has an opposite ().
Rational numbers : . Fractions allow division between any integers (except ). However has "gaps": there are points on the number line that do not correspond to any rational number.
Why is not enough: we prove by contradiction. Suppose with coprime integers. Then , so is even, hence is even. Write . Substituting: , so is even, hence is even. But and cannot both be even because they were chosen coprime — contradiction. Therefore is not rational.
Real numbers : to "fill the gaps" we introduce real numbers, which include all limits of convergent sequences of rationals (completion of ). is a complete ordered field: every non-empty bounded above subset has a supremum in .
Complex numbers : . They extend by including solutions to .
In summary: . Each step extends the possible operations and fills previous gaps.
Upper and lower bounds: let be non-empty. is an upper bound of if for all . If admits upper bounds, it is bounded above. Similarly, is a lower bound if for all .
Supremum: the smallest upper bound, denoted . The supremum may or may not belong to . For example, but , while and . If , then is also the maximum of .
Characterisation of : iff (i) is an upper bound (); (ii) for every there exists with (i.e., cannot be improved).
Infimum: the largest lower bound: . If , then is the minimum.
Completeness axiom (Dedekind): every non-empty subset of bounded above has a in . This axiom distinguishes from : in , the set is bounded above but has no sup in (the sup would be , which is not rational).
Existence theorem for sup and inf: if is non-empty and bounded (both above and below), then and exist in .
A function assigns to each exactly one element . is the domain, the codomain, and the image (range).
Key properties:
- Injective (one-to-one): . Different inputs give different outputs. Graphically: no horizontal line intersects the graph more than once (horizontal line test).
- Surjective (onto): , i.e., every has at least one preimage. Equivalently: the equation has a solution for every .
- Bijective: both injective and surjective. Then the inverse function exists with .
- Even: for all . Graph symmetric about the -axis. Examples: , , .
- Odd: for all . Graph symmetric about the origin. Examples: , , .
- Monotone increasing: . Strictly increasing if .
- Periodic with period : for all . The fundamental period is the smallest with this property.
Function composition: . Composition is defined when the image of is contained in the domain of . Composition is associative () but not commutative ( in general).
Inverse function: if is bijective, is defined by . The graph of is the reflection of the graph of across the line . Properties: and .
Exponential function : domain , range , strictly increasing, . Key property: . Growth hierarchy: grows faster than any power as ( for any ). General exponential: .
Natural logarithm : inverse of . Domain , range , strictly increasing. Properties: , , . Change of base: .
Trigonometric functions: and are periodic with period , bounded in . Pythagorean identity: . Addition formulas: , . is periodic with period , defined for .
Inverse trigonometric functions: (inverse of restricted to ); ; .
Hyperbolic functions: , . (analogue of Pythagorean identity).
Worked Examples
2Exercises with Solutions
2Keep studying
Guided exercises on this topic
Recommended Books
As an Amazon Associate I earn from qualifying purchases.