Quantities like mass, length, or time are determined solely by their magnitudes and require only a number and a unit of measure.
Quantities like force, displacement, or velocity require more information: they need direction in addition to magnitude.
Force: Requires magnitude and the direction in which it acts.
Displacement: Requires magnitude (how far) and direction (where it moves).
Velocity: Requires magnitude (speed) and direction (where the body is headed).
Definition of Vectors:
Quantities possessing both magnitude and direction are represented by arrows called directed line segments or vectors.
The length of the arrow represents the magnitude of the action in terms of a chosen unit.
This chapter focuses on $n$-vectors or $n$-dimensional vectors in Rn.
Scope of Study:
Vectors provide geometric motivation for Linear Algebra.
Algebraic and geometric properties of points in Rn are discussed.
Scalar products (dot products) and vector products (cross products) are included.
Points in R2 and R3 are treated as special cases of Rn.
The cross product is unique to 3-dimensional space (invalid in 2D, 4D, or other $n$ dimensions).
1.1 Definition of Points in n-space
Practical Context: Vectors arise in the simultaneous study of multiple characteristics. For example, height (a1), weight (a2), age (a3), and blood pressure (a4) can be represented as an ordered 4-tuple A=(a1,a2,a3,a4)∈R4.
Definition 1.1.1 (Operations): Let A=(a1,a2,…,an) and B=(b1,b2,…,bn) be points in $n$-space, and c∈R.
Addition: A+B=(a1+b1,a2+b2,…,an+bn).
Scalar Multiplication: cA=(ca1,ca2,…,can).
Example 1.1.1:
Let A=(−1,3,6,2), B=(0,−5,−1,4), C=(2,−1,3).
A+B=(−1+0,3−5,6−1,2+4)=(−1,−2,5,6).
A+C is not defined because A is in 4D space and C is in 3D space.
−2A=(−2(−1),−2(3),−2(6),−2(2))=(2,−6,−12,−4).
Definition 1.1.2 (Subtraction): A−B=A+(−B).
Theorem 1.1.1 (Properties): For points A,B,C∈Rn and α,β∈R:
A+B=B+A (Commutativity).
A+(B+C)=(A+B)+C (Associativity).
α(A+B)=αA+αB.
(α+β)A=αA+βA.
α(βA)=(αβ)A.
A+0=0+A=A.
1⋅A=A and −1⋅A=−A.
A+(−A)=0.
1.2 Vectors in n-space: Geometric Interpretation
Vector Determination: A vector AB is determined by an initial point A and a terminal point B.
Relation between Points: If A=(a1,a2) and B=(b1,b2), then B=A+(B−A).
Definition 1.2.2 (Equivalence): AB≅CD if and only if B−A=D−C.
Origin Property: Every vector is equivalent to a vector whose initial point is the origin (O). If AB≅OP, then P=B−A.
Definition 1.2.3 (Parallelism): AB∥CD if there exists α∈R such that B−A=α(D−C).
Equivalent vectors are parallel where α=1.
If α>0, vectors have the same direction.
If α<0, vectors have opposite directions.
1.3 The Scalar Product
Definition 1.3.1: For A=(a1,…,an) and B=(b1,…,bn), the scalar product (dot product) is:
A⋅B=a1b1+a2b2+⋯+anbn.
Theorem 1.3.1 (Properties):
A⋅B=B⋅A.
A⋅(B+C)=A⋅B+A⋅C.
(αA)⋅B=α(A⋅B)=A⋅(αB).
A⋅A≥0; A⋅A=0⟺A=0.
Definition 1.3.2 (Orthogonality): A⊥B⟺A⋅B=0.
The Norm of a Vector (Definition 1.3.3):
The norm (length) is denoted ∥A∥=A⋅A=a12+a22+⋯+an2.
Property: ∥αA∥=∣α∣∥A∥.
Unit Vectors: A vector A is a unit vector if ∥A∥=1.
For any A=0, the vector u=∥A∥A is a unit vector in the direction of A.
Distance from point Q to line l: D=∥L∥∥L×PQ∥ where P is any point on l.
Planes in Space:
A plane is determined by a point Q(x0,y0,z0) and a normal vector N=ai+bj+ck.
Equation of Planet: a(x−x0)+b(y−y0)+c(z−z0)=0.
Distance from point Q to plane π: D=∥N∥∣N⋅QP∣ where P is any point on π.
1.6 Applications
Area of a Triangle: Area=21∥A×B∥ where A and B are adjacent side vectors.
Volume of a Parallelepiped: Volume=∣A⋅(B×C)∣. This is the absolute value of the scalar triple product.
Vector Spaces (Chapter 4)
4.1 Definition and Axioms
Definition: A vector space V over a field F is a set of objects (vectors) satisfying:
Closure under addition: u+v∈V.
Closure under scalar multiplication: αv∈V.
Commutativity: u+v=v+u.
Associativity of addition: (u+v)+w=u+(v+w).
Additive identity: There exists 0∈V such that 0+u=u.
Additive inverse: There exists −u∈V such that u+(−u)=0.
Distributivity (scalar): α(u+v)=αu+αv.
Distributivity (field): (α+β)u=αu+βu.
Associativity of scalar multiplication: (αβ)u=α(βu).
Unitary Law: 1⋅u=u.
Theorem 4.1.2:
0v=0 and α0=0.
αv=0⟺α=0 or v=0.
(−1)v=−v.
4.2 Subspaces
Definition: A subset W⊆V is a subspace if it satisfies closure under addition, closure under scalar multiplication, and contains the zero vector.
Intersection Rule: The intersection of two subspaces W1∩W2 is always a subspace.
Union Rule: The union W1∪W2 is generally not a subspace unless one is contained in the other.
Sum of Subspaces: W1+W2={u1+u2:u1∈W1,u2∈W2} is a subspace.
Linear Combination: A vector v=∑αivi is a linear combination.
Generating Set: A set S spans V if every vector in V can be written as a linear combination of elements in S.
4.3 Linear Independence
Linear Dependence: Vectors v1,…,vn are LD if ∑αivi=0 for some αi=0.
Linear Independence: Vectors are LI if ∑αivi=0⟹ all αi=0.
Singleton Rule: {x} is LI iff x=0.
4.4 Basis and Dimension
Basis: A set B is a basis for V if it spans V and is linearly independent.
Dimension (dimV): The number of vectors in any basis of V.
Extension Theorem: Any linearly independent set can be extended to form a basis.
Coordinate Vector: If u=∑aivi relative to basis {vk}, then (a1,…,an) is the coordinate vector.
Chapter 2: Matrices, Determinants, and Systems
2.1 Matrix Definitions
Definition: An m×n matrix A is a rectangular array of numbers with m rows and n columns.
Equality: Matrices A=B if they have the same size and all corresponding entries aij=bij are equal.
2.2 Operations
Addition: (A+B)ij=aij+bij. Both must be same size.
Scalar Multiplication: (αA)ij=αaij.
Multiplication: For Am×n and Bn×p, the product Cm×p is cik=∑j=1naijbjk.
Note: Matrix multiplication is not commutative (AB=BA).
Properties:
A(BC)=(AB)C (Associative).
A(B+C)=AB+AC (Distributive).
2.3 Types of Matrices
Transpose (At): Interchanging rows and columns. (At)ij=aji.
(AB)t=BtAt.
Identity (I): Square matrix with 1s on diagonal, 0s elsewhere.
Diagonal: aij=0 for i=j.
Symmetric: At=A⟹aij=aji.
Skew-Symmetric: At=−A⟹aij=−aji (diagonal entries must be 0).
Triangular: Upper triangular (aij=0 for i>j) or Lower triangular (aij=0 for i<j).
2.4 Inverses and Rank
Elementary Row Operations:
Interchange two rows (Ri↔Rj).
Multiply a row by a non-zero constant (Ri→αRi).
Add a multiple of one row to another (Ri→Ri+αRj).
Row Echelon Form (REF):
Zeros at bottom.
Leading non-zero entry is 1.
Leading 1 of a lower row is to the right of the leading 1 above it.
Reduced Row Echelon Form (RREF): REF plus zeros above every leading 1.
Inverse (A−1): AA−1=A−1A=I. Only for non-singular matrices.
Computation: Augment A with I ([A∣I]) and use row operations to reach [I∣A−1].
Rank: Number of non-zero rows in REF.
2.6 Systems of Linear Equations
Matrix Form: Ax=b.
Gaussian Elimination: Reducing the augmented matrix to REF.
Gauss-Jordan Elimination: Reducing the augmented matrix to RREF.
Consistency:
If rank(A)<rank(A∣b), no solution (inconsistent).
If rank(A)=rank(A∣b)=n, unique solution.
If rank(A)=rank(A∣b)<n, infinitely many solutions (dependent on n−r parameters).
Chapter 3: Determinants
Definition 3.1.1:
1×1: ∣a11∣=a11.
2×2: acbd=ad−bc.
Expansion by Cofactors: detA=∑j=1n(−1)i+jaij∣Aij∣ for any row i. Here ∣Aij∣ is the minor (determinant of submatrix after deleting row i and col j).
Properties:
det(I)=1.
det(AB)=det(A)det(B).
det(At)=det(A).
If any row or col is all 0, det(A)=0.
Swapping two rows changes the sign of the determinant.
Multiplying a row by k results in k⋅det(A).
For triangular matrices, det(A)=∏i=1naii.
Adjoint Inverse: A−1=detA1adjA, where adjA is the transpose of the matrix of cofactors.
Cramer’s Rule: For Ax=b, xi=det(A)det(Bi), where Bi replaces col i of A with b.
PART II: CALCULUS
Chapter 1: Limits, Continuity, and Differentiation
1.1 Limits
Definition: limx→af(x)=L if f(x) approach L as x approaches a.
One-Sided Limits: limx→a−f(x) (left-hand) and limx→a+f(x) (right-hand).
Theorems: Limits of sums, differences, products, and quotients are the operations of the individual limits (assuming denominators are non-zero).
Squeeze Theorem: If h(x)≤f(x)≤g(x) and limh(x)=limg(x)=L, then limf(x)=L.
Trigonometric Limits: limx→0xsin(x)=1 and limx→0x1−cos(x)=0.
Continuity
At a point: continuous at a if f(a) is defined, the limit exists, and limx→af(x)=f(a).
Discontinuities: Removable (limit exists but =f(a)) or Essential (limit does not exist, e.g., jump or infinite).
Intermediate Value Theorem (IVT): If f is continuous on [a,b] and k is between f(a) and f(b), there exists c∈(a,b) such that f(c)=k.
1.3 Differentiation
Definition: f′(a)=limh→0hf(a+h)−f(a).
Geometric Meaning: The slope of the tangent line to the curve at x=a.
Rules:
dxd[c]=0.
dxd[xn]=nxn−1.
dxd[f⋅g]=f′g+fg′ (Product Rule).
dxd[f/g]=g2f′g−fg′ (Quotient Rule).
dxd[f(g(x))]=f′(g(x))⋅g′(x) (Chain Rule).
Implicit Differentiation: Differentiating both sides of an equation with respect to x, treating y as a function of x, and solving for dxdy.
Inflection Point: Point where concavity changes sign.
Optimization: Converting word problems to functions, finding critical points to maximize/minimize quantities (e.g., volume, area, time).
Related Rates: Finding the rate of change of one quantity based on the rate of change of others using the Chain Rule (e.g., area of a growing disc, ladder sliding down a wall).
Chapter 3: Integration
Antiderivatives and Indefinite Integrals
Definition: F is an antiderivative of f if F′(x)=f(x).