Glossary
Every technical word in the course and what it means in plain language, with flashcards for practice.
Every technical term in the course, with a plain-language meaning. On every page these words are marked with a dotted underline: hover or tap one to see its meaning. The “Used in” links point to the sections where each term appears.
Ch 1 · Sets, Relations and FunctionsCh 2 · Complex Numbers and Quadratic EquationsCh 3 · Matrices and DeterminantsCh 4 · Permutations and CombinationsCh 5 · Binomial Theorem and its Simple ApplicationsCh 6 · Sequence and SeriesCh 7 · Limit, Continuity and DifferentiabilityCh 8 · Integral CalculusCh 9 · Differential EquationsCh 10 · Co-ordinate GeometryCh 11 · Three Dimensional GeometryCh 12 · Vector AlgebraCh 13 · Statistics and ProbabilityCh 14 · Trigonometry
Ch 1 · Sets, Relations and Functions
| Term | Meaning | Used in |
|---|---|---|
| bijection | A function that is both one-one and onto; it pairs the elements of $A$ and $B$ perfectly and has an inverse function. | 1.2 7.1 14.2 |
| Cartesian product | $A\times B=\{(a,b): a\in A,\ b\in B\}$, the set of all ordered pairs with first entry from $A$ and second from $B$; $n(A\times B)=n(A)\,n(B)$. | 1.1 4.1 |
| codomain | The set $B$ named in $f:A\to B$, into which the images fall. The range is the part of the codomain actually reached; whether $f$ is onto depends on the codomain chosen. | 1.1 1.2 7.1 14.2 |
| composite function | For $f:A\to B$ and $g:B\to C$, the function $g\circ f:A\to C$ with $(g\circ f)(x)=g(f(x))$ — first $f$, then $g$. In general $g\circ f\ne f\circ g$. | 1.2 |
| De Morgan's laws | $(A\cup B)'=A'\cap B'$ and $(A\cap B)'=A'\cup B'$: taking complements swaps union and intersection. | 1.1 13.2 |
| equivalence class | For an equivalence relation $R$ on $A$, the set $[a]=\{x\in A: x\,R\,a\}$ of all elements related to $a$. Two classes are either equal or disjoint. | 1.1 |
| equivalence relation | A relation that is reflexive, symmetric and transitive. Its equivalence classes split the set into non-overlapping pieces. | 1.1 |
| into function | A function whose range is a proper subset of its codomain: some element of the codomain has no pre-image. | 1.2 |
| many-one function | A function in which at least two different elements share the same image, e.g. $x^2$ on $\mathbb{R}$, where $f(-1)=f(1)$. | 1.2 7.1 |
| one-one function | A function in which different elements have different images: $f(x_1)=f(x_2)\Rightarrow x_1=x_2$. Also called injective. | 1.2 4.1 7.1 7.3 |
| onto function | A function $f:A\to B$ whose range is the whole codomain $B$: every element of $B$ has at least one pre-image. Also called surjective. | 1.1 1.2 |
| power set | The set $P(A)$ of all subsets of $A$, including $\phi$ and $A$ itself. If $n(A)=n$ then $n(P(A))=2^n$. | 1.1 |
| pre-image | An element $a$ of the domain with $f(a)=b$ is a pre-image of $b$. An element of the codomain may have no pre-image, one, or several. | 1.2 7.3 |
| proper subset | A subset of $B$ that is not equal to $B$, written $A\subset B$. A set with $n$ elements has $2^n-1$ proper subsets. | 1.1 1.2 |
| reflexive relation | A relation $R$ on $A$ with $(a,a)\in R$ for every $a\in A$ — a loop at every element. | 1.1 |
| symmetric difference | $A\,\Delta\,B=(A-B)\cup(B-A)$: the elements that lie in exactly one of the two sets. | 1.1 |
| transitive relation | A relation with: $(a,b)\in R$ and $(b,c)\in R$ imply $(a,c)\in R$ — every two-step path has a one-step shortcut. | 1.1 |
| universal set | The set $U$ of all objects under discussion; every other set in the problem is a subset of it, and complements are taken inside it. | 1.1 |
Ch 2 · Complex Numbers and Quadratic Equations
| Term | Meaning | Used in |
|---|---|---|
| Argand plane | A coordinate plane in which the complex number $a+ib$ is shown as the point $(a,b)$; the horizontal axis is the real axis, the vertical axis the imaginary axis. | 2.1 2.2 |
| common root | A number that satisfies two equations at once. Quadratics share both roots exactly when their coefficients are proportional; one common root is found by eliminating $x^2$. | 2.2 |
| complex number | An ordered pair $(a,b)$ of real numbers, written $a+ib$ with $i^2=-1$; $a$ is its real part and $b$ its imaginary part. The set of all of them is $\mathbb{C}$. | 2.1 2.2 14.2 |
| conjugate of a complex number | For $z=a+ib$, the number $\bar z=a-ib$: the reflection of $z$ in the real axis. $z\bar z=a^2+b^2=|z|^2$. | |
| discriminant | The number $D=b^2-4ac$ of $ax^2+bx+c=0$. For real coefficients: $D\gt0$ two distinct real roots, $D=0$ equal roots, $D\lt0$ a pair of non-real conjugate roots. | 1.2 2.2 6.2 7.4 |
| imaginary unit | The complex number $i=(0,1)$, whose square is $-1$. Its powers repeat with period $4$: $i,\,-1,\,-i,\,1$. | |
| modulus of a complex number | $|z|=\sqrt{a^2+b^2}$ for $z=a+ib$: the distance of $z$ from the origin. $|z_1-z_2|$ is the distance between two points, and $|z_1z_2|=|z_1|\,|z_2|$. | |
| nature of the roots | Whether the roots of an equation are real or non-real, equal or distinct, rational or irrational — decided for a quadratic by its discriminant. | 2.2 |
| polar form | The form $z=r(\cos\theta+i\sin\theta)$ of a non-zero complex number, with $r=|z|$ and $\theta$ an argument of $z$. Products multiply the $r$'s and add the $\theta$'s. | 2.1 3.2 |
| principal argument | The unique argument $\operatorname{Arg} z$ of a non-zero complex number in the interval $(-\pi,\pi]$: the angle from the positive real axis to the arrow $Oz$. | 2.1 |
| purely imaginary | A complex number $a+ib$ with $a=0$ and $b\ne0$, such as $3i$; it lies on the imaginary axis. Equivalently $\bar z=-z$, $z\ne0$. | 2.1 2.2 |
| quadratic formula | The roots of $ax^2+bx+c=0$ ($a\ne0$) are $x=\dfrac{-b\pm\sqrt{b^2-4ac}}{2a}$; for a negative discriminant, $\sqrt D=i\sqrt{-D}$. | 2.2 |
| repeated root | A root that occurs twice: $ax^2+bx+c=0$ has the repeated root $-\tfrac b{2a}$ exactly when $D=0$, and then $ax^2+bx+c=a\left(x+\tfrac b{2a}\right)^2$. | 2.2 |
| symmetric function of the roots | An expression in $\alpha,\beta$ unchanged when they are swapped, such as $\alpha^2+\beta^2$ or $\tfrac1\alpha+\tfrac1\beta$; it can always be written using $\alpha+\beta$ and $\alpha\beta$. | 2.2 |
| triangle inequality | $\big||z_1|-|z_2|\big|\le|z_1+z_2|\le|z_1|+|z_2|$: a side of a triangle is at most the sum, and at least the difference, of the other two. | 2.1 10.2 12.1 |
| Vieta's relations | For the roots $\alpha,\beta$ of $ax^2+bx+c=0$: $\alpha+\beta=-\tfrac ba$ and $\alpha\beta=\tfrac ca$ — the relations between roots and coefficients. | 2.2 |
Ch 3 · Matrices and Determinants
| Term | Meaning | Used in |
|---|---|---|
| adjoint | The transpose of the matrix of cofactors, $\operatorname{adj}A=[C_{ij}]^{T}$. It satisfies $A\,\operatorname{adj}A=(\operatorname{adj}A)A=|A|\,I$. | 3.2 3.3 |
| cofactor | $C_{ij}=(-1)^{i+j}M_{ij}$: the minor of $a_{ij}$ with the chessboard sign. Expanding along any row, $|A|=\sum_j a_{ij}C_{ij}$. | 3.2 3.3 |
| collinear | Lying on one straight line. Points $(x_1,y_1)$, $(x_2,y_2)$, $(x_3,y_3)$ are collinear exactly when $\begin{vmatrix}x_1&y_1&1\\x_2&y_2&1\\x_3&y_3&1\end{vmatrix}=0$. | 2.1 3.2 4.2 10.1 |
| Cramer's rule | For $AX=B$ with $\Delta=|A|\ne0$: $x=\Delta_1/\Delta$, $y=\Delta_2/\Delta$, $z=\Delta_3/\Delta$, where $\Delta_i$ is $|A|$ with column $i$ replaced by $B$. | 3.3 10.1 |
| determinant | The number $|A|$ attached to a square matrix; for order $2$, $\begin{vmatrix}a&b\\c&d\end{vmatrix}=ad-bc$. It is $0$ exactly when the matrix has no inverse, and $|ad-bc|$ is the area of the parallelogram spanned by the rows. | 3.1 3.2 3.3 10.1 |
| diagonal matrix | A square matrix whose entries off the principal diagonal are all $0$: $a_{ij}=0$ for $i\ne j$. | 3.1 |
| homogeneous system | A system of linear equations $AX=O$ with all right-hand sides $0$. It always has the solution $X=O$, and has others exactly when $|A|=0$. | 3.3 10.1 |
| idempotent matrix | A square matrix with $A^2=A$; then $A^n=A$ for every $n\ge1$. | 1.1 3.1 3.3 |
| identity matrix | The square matrix $I$ with $1$s on the principal diagonal and $0$s elsewhere; $AI=IA=A$ for every square $A$ of the same order. | 3.1 3.3 |
| invertible matrix | A square matrix $A$ with a matrix $A^{-1}$ such that $AA^{-1}=A^{-1}A=I$. This happens exactly when $|A|\ne0$, and then $A^{-1}=\frac1{|A|}\operatorname{adj}A$. | 3.3 |
| involutory matrix | A square matrix with $A^2=I$, so that applying it twice undoes it; its odd powers equal $A$ and its even powers equal $I$. | 3.1 |
| minor | The minor $M_{ij}$ of the entry $a_{ij}$ of a square matrix is the determinant left after deleting row $i$ and column $j$. | 3.2 3.3 10.3 |
| nilpotent matrix | A square matrix with $A^k=O$ for some positive integer $k$; the least such $k$ is its index. Example: $\begin{bmatrix}0&1\\0&0\end{bmatrix}$. | 3.1 3.3 |
| Sarrus's rule | A memory aid for $3\times3$ determinants only: copy the first two columns to the right, add the three products running down to the right and subtract the three running up to the right. | 3.2 |
| scalar matrix | A diagonal matrix whose diagonal entries are all equal, i.e. $kI$ for some number $k$. | 3.1 |
| singular matrix | A square matrix with determinant $0$; it has no inverse. A matrix with non-zero determinant is called non-singular. | 3.2 |
| skew-symmetric matrix | A square matrix with $A^{T}=-A$, i.e. $a_{ij}=-a_{ji}$. Its diagonal entries are all $0$. | 3.1 3.2 |
| square matrix | A matrix with as many rows as columns ($n\times n$). Only square matrices have a principal diagonal, a trace, powers and a determinant. | 3.1 3.2 3.3 |
| symmetric matrix | A square matrix equal to its transpose, $A^{T}=A$, i.e. $a_{ij}=a_{ji}$: a mirror image of itself in the principal diagonal. | 3.1 3.2 3.3 |
| test of consistency | Deciding whether $AX=B$ has a solution: $|A|\ne0$ gives exactly one; if $|A|=0$ and $(\operatorname{adj}A)B\ne O$ there is none; if $|A|=0$ and $(\operatorname{adj}A)B=O$ there are infinitely many or none. | 3.3 |
| transpose | The matrix $A^{T}$ obtained from $A$ by turning rows into columns, $(A^{T})_{ij}=a_{ji}$. It reverses products: $(AB)^{T}=B^{T}A^{T}$. | 3.1 3.2 3.3 |
| trivial solution | The solution $x=y=z=0$ of a homogeneous system. Any other solution is called non-trivial; non-trivial solutions exist exactly when $|A|=0$. | 3.3 |
Ch 4 · Permutations and Combinations
| Term | Meaning | Used in |
|---|---|---|
| circular permutation | An arrangement around a circle in which rotations count as the same; $n$ different objects have $(n-1)!$ circular permutations, and $\tfrac{(n-1)!}{2}$ necklaces when the circle may also be turned over ($n\ge3$). | 4.1 |
| collinear points | Points that lie on one straight line. If $m$ of $n$ points are collinear, they reduce the number of lines by ${}^{m}C_{2}-1$ and the number of triangles by ${}^{m}C_{3}$. | 3.2 4.2 |
| combination | A selection of objects in which order does not matter. The number of combinations of $r$ objects from $n$ different ones is ${}^{n}C_{r}=\dfrac{n!}{r!\,(n-r)!}$. | 1.2 2.2 3.3 4.2 |
| derangement | A permutation in which no object is in its original place; their number is $D_n=n!\left(1-\tfrac1{1!}+\tfrac1{2!}-\cdots+\tfrac{(-1)^n}{n!}\right)$, e.g. $D_4=9$. | 4.1 |
| diagonal of a polygon | A segment joining two vertices of a polygon that is not a side. A convex polygon with $n$ sides has $\tfrac{n(n-3)}{2}$ diagonals. | 4.2 |
| dictionary rank | The position of a word when all arrangements of its letters are listed in alphabetical order: count the words that come before it, position by position, and add $1$. | 4.1 |
| factorial | $n!=n(n-1)(n-2)\cdots2\cdot1$ for $n\ge1$, with $0!=1$. It is the number of ways to arrange $n$ different objects in a row. | 4.1 4.2 |
| fundamental principle of counting | If one stage of a task can be done in $m$ ways and then, whatever was chosen, the next stage in $n$ ways, the two stages together can be done in $mn$ ways. Alternatives that do not overlap are added instead. | 4.1 4.2 |
| Pascal's rule | ${}^{n}C_{r}+{}^{n}C_{r-1}={}^{n+1}C_{r}$: the selections of $r$ from $n+1$ objects either contain a particular object or do not. | 4.2 5.1 |
| permutation | An arrangement of objects in a definite order. The number of permutations of $r$ objects chosen from $n$ different ones is ${}^{n}P_{r}=\dfrac{n!}{(n-r)!}$. | 4.1 |
| stars and bars | The method that counts the ways to share $n$ identical objects among $k$ people as rows of $n$ stars and $k-1$ bars: ${}^{n+k-1}C_{k-1}$, or ${}^{n-1}C_{k-1}$ if everyone gets at least one. | 4.2 |
Ch 5 · Binomial Theorem and its Simple Applications
| Term | Meaning | Used in |
|---|---|---|
| binomial coefficient | The numbers ${}^{n}C_{0},{}^{n}C_{1},\dots,{}^{n}C_{n}$ that multiply the terms of the expansion of $(a+b)^n$; they add up to $2^n$. | 1.2 5.1 |
| binomial theorem | For a positive integer $n$: $(a+b)^n=\sum_{r=0}^{n}{}^{n}C_{r}\,a^{n-r}b^r$ — the term $a^{n-r}b^r$ arises from choosing $b$ in $r$ of the $n$ brackets. | 3.1 5.1 7.1 7.3 |
| general term | The $(r+1)$-th term of the expansion of $(a+b)^n$: $T_{r+1}={}^{n}C_{r}\,a^{n-r}b^r$, $r=0,1,\dots,n$. | 5.1 6.1 |
| middle term | The term(s) in the centre of the expansion of $(a+b)^n$: $T_{\frac n2+1}$ if $n$ is even; $T_{\frac{n+1}2}$ and $T_{\frac{n+3}2}$ if $n$ is odd. They carry the greatest binomial coefficient. | 3.2 4.2 5.1 6.1 |
| Pascal's triangle | The triangular table whose row $n$ lists ${}^{n}C_{0},\dots,{}^{n}C_{n}$; every entry is the sum of the two entries above it. | 5.1 |
| term independent of x | The constant term of an expansion in powers of $x$ — the term in which the power of $x$ is $0$. Find it by setting the power of $x$ in $T_{r+1}$ equal to $0$. | 5.1 |
Ch 6 · Sequence and Series
| Term | Meaning | Used in |
|---|---|---|
| A.M.–G.M. inequality | For positive numbers, the arithmetic mean is at least the geometric mean: $\frac{a_1+\dots+a_n}{n}\ge\sqrt[n]{a_1\cdots a_n}$, with equality only when all the numbers are equal. | 6.2 14.2 |
| arithmetic mean | The average $\frac{a+b}{2}$ of two numbers, which makes $a, A, b$ an arithmetic progression; $n$ arithmetic means between $a$ and $b$ are the terms that fill an arithmetic progression from $a$ to $b$. | 6.1 6.2 13.1 |
| arithmetic progression | A sequence in which each term is obtained from the one before by adding the same number $d$: $a, a+d, a+2d,\dots$; its $n$-th term is $a+(n-1)d$. | 6.1 |
| common difference | The fixed number $d=a_{n+1}-a_n$ added at every step of an arithmetic progression; it may be positive, negative or zero. | 6.1 |
| common ratio | The fixed number $r=a_{n+1}/a_n$ by which each term of a geometric progression is multiplied to give the next. | 6.1 |
| geometric mean | For positive $a$ and $b$, the number $\sqrt{ab}$, which makes $a, G, b$ a geometric progression; for $n$ positive numbers, the $n$-th root of their product. | 6.1 6.2 |
| geometric progression | A sequence of non-zero numbers in which each term is the one before multiplied by the same number $r$: $a, ar, ar^2,\dots$; its $n$-th term is $ar^{n-1}$. | 6.1 9.1 |
| method of differences | Finding the general term of a series from the differences of consecutive terms: if they form an A.P. the $n$-th term is a quadratic in $n$; if they form a G.P. with ratio $\rho$ it is $p\rho^n+q$. | 6.2 |
| partial sum | $S_n=a_1+a_2+\dots+a_n$, the sum of the first $n$ terms of a sequence. The terms are recovered by $a_1=S_1$ and $a_n=S_n-S_{n-1}$ for $n\ge2$. | 6.1 14.2 |
| sigma notation | The shorthand $\sum_{k=m}^{n}a_k$ for $a_m+a_{m+1}+\dots+a_n$; the index $k$ runs through the integers from $m$ to $n$, giving $n-m+1$ terms. | 6.2 |
| sum to infinity | The number that the partial sums of an infinite series approach. For a geometric progression it exists exactly when $|r|\lt1$, and equals $\frac{a}{1-r}$. | 6.1 6.2 |
| telescoping sum | A sum whose terms can be written as differences $f(k+1)-f(k)$, so that all middle values cancel and $\sum_{k=1}^{n}a_k=f(n+1)-f(1)$. | 4.1 6.2 7.1 14.2 |
| triangular number | $T_n=1+2+\dots+n=\frac{n(n+1)}{2}$, the number of dots in a triangle with $n$ rows: $1, 3, 6, 10, 15,\dots$; also $1^3+\dots+n^3=T_n^2$. | 6.2 |
Ch 7 · Limit, Continuity and Differentiability
| Term | Meaning | Used in |
|---|---|---|
| absolute extremum | The largest (absolute maximum) or smallest (absolute minimum) value of $f$ on its whole domain or a stated interval. On a closed interval $[a,b]$ a continuous function has both, at critical points or endpoints. | 7.4 |
| chain rule | The derivative of a composite function: $(f\circ g)'(x)=f'(g(x))\,g'(x)$, or $\dfrac{dy}{dx}=\dfrac{dy}{du}\cdot\dfrac{du}{dx}$ — the rates of the inner and outer functions multiply. | 7.3 7.4 8.1 8.2 |
| continuity | $f$ is continuous at $a$ when $\lim_{x\to a}f(x)=f(a)$: the value exists, the two one-sided limits agree, and they equal the value. A continuous function is continuous at every point of its domain. | 1.2 7.1 7.2 7.3 |
| critical point | An interior point $c$ of the domain where $f'(c)=0$ (a stationary point) or $f'(c)$ does not exist. Local extrema can occur only at critical points, but not every critical point is one. | 7.4 |
| differentiable | $f$ is differentiable at $a$ when $\lim_{h\to0}\frac{f(a+h)-f(a)}{h}$ exists as a real number (the derivative $f'(a)$); then $f$ is also continuous at $a$. | 7.1 7.2 7.3 7.4 |
| even function | A function with $f(-x)=f(x)$ for every $x$ in its symmetric domain; its graph is symmetric about the $y$-axis, e.g. $x^2$, $\cos x$, $|x|$. | 1.2 7.1 14.2 |
| first derivative test | At a critical point $c$: if $f'$ changes sign from $+$ to $-$, $f$ has a local maximum; from $-$ to $+$, a local minimum; no change of sign, no extremum. | 7.4 |
| first principles | Finding a derivative directly from its definition as the limit of the difference quotient $\frac{f(x+h)-f(x)}{h}$, without using rules of differentiation. | 7.2 14.1 |
| fractional part | $\{x\}=x-[x]$, a number in $[0,1)$; the fractional-part function is periodic with period $1$, e.g. $\{-2.3\}=0.7$. | 7.1 |
| greatest integer function | $[x]$ (also $\lfloor x\rfloor$), the greatest integer less than or equal to $x$: $[2.7]=2$, $[-2.3]=-3$. It satisfies $[x]\le x\lt[x]+1$ and jumps at every integer. | 8.2 |
| implicit differentiation | Finding $\dfrac{dy}{dx}$ from an equation $F(x,y)=0$ without solving for $y$: differentiate every term with respect to $x$, treating $y$ as a function of $x$ (so $(y^2)'=2yy'$), then solve for $y'$. | 7.3 |
| indeterminate form | An expression such as $\tfrac00$, $\tfrac\infty\infty$, $\infty-\infty$, $0\cdot\infty$ or $1^\infty$ whose limit cannot be read off from the limits of its parts; it must be simplified first. | 7.1 |
| intermediate value theorem | If $f$ is continuous on $[a,b]$, it takes every value between $f(a)$ and $f(b)$; in particular a sign change of $f$ guarantees a zero. | 7.2 |
| inverse function | For a bijection $f:A\to B$, the function $f^{-1}:B\to A$ with $f^{-1}(y)=x\iff f(x)=y$. Its graph is the mirror image of the graph of $f$ in the line $y=x$. | 1.2 7.1 7.3 14.2 |
| jump discontinuity | A point where both one-sided limits are finite but different, like $[x]$ at an integer; the size of the jump is $|\text{RHL}-\text{LHL}|$. It cannot be removed by changing $f(a)$. | 7.2 |
| left-hand derivative | $Lf'(a)=\lim_{h\to0^-}\frac{f(a+h)-f(a)}{h}$, the slope of the graph just to the left of $a$. | 7.2 |
| left-hand limit | $\lim_{x\to a^-}f(x)$: the value $f(x)$ approaches as $x$ tends to $a$ through values less than $a$. | 7.1 7.2 |
| local maximum | $f$ has a local maximum at $c$ if $f(x)\le f(c)$ for all $x$ in some interval $(c-\delta,c+\delta)$ — the highest point nearby, not necessarily of the whole graph. | 7.4 8.2 |
| local minimum | $f$ has a local minimum at $c$ if $f(x)\ge f(c)$ for all $x$ in some interval $(c-\delta,c+\delta)$. | 7.4 8.2 |
| logarithmic differentiation | Taking $\ln|y|$ before differentiating, which turns powers into products and products into sums; the standard method for $x^x$-type powers and long products or quotients. | 7.3 |
| monotonic function | A function that is increasing throughout an interval or decreasing throughout it. A differentiable function with $f'\gt0$ on an interval is strictly increasing there; with $f'\lt0$, strictly decreasing. | 1.2 7.2 7.3 7.4 |
| odd function | A function with $f(-x)=-f(x)$ for every $x$ in its symmetric domain; its graph is symmetric about the origin, e.g. $x^3$, $\sin x$, $\tfrac1x$. | 7.1 14.1 14.2 |
| product rule | The derivative of a product of two differentiable functions: $(uv)'=u'v+uv'$. It is not the product of the derivatives. | 2.1 3.1 3.2 7.3 |
| quotient rule | The derivative of a quotient: $\left(\dfrac uv\right)'=\dfrac{u'v-uv'}{v^2}$, valid where $v\ne0$. The order $u'v-uv'$ in the numerator matters. | 7.3 8.1 |
| related rates | Rates of change of quantities that are tied together by an equation; differentiating the equation with respect to time links them, e.g. $V=\tfrac43\pi r^3$ gives $\dfrac{dV}{dt}=4\pi r^2\dfrac{dr}{dt}$. | |
| removable discontinuity | A point where $\lim_{x\to a}f(x)$ exists but differs from $f(a)$ (or $f(a)$ is undefined); redefining $f(a)$ as the limit makes $f$ continuous there. | 7.2 |
| right-hand derivative | $Rf'(a)=\lim_{h\to0^+}\frac{f(a+h)-f(a)}{h}$; $f$ is differentiable at $a$ exactly when the left-hand and right-hand derivatives exist and are equal. | 7.2 |
| right-hand limit | $\lim_{x\to a^+}f(x)$: the value $f(x)$ approaches as $x$ tends to $a$ through values greater than $a$. The two-sided limit exists exactly when LHL $=$ RHL. | 7.1 7.2 7.4 |
| sandwich theorem | If $g\le f\le h$ near $a$ and $g$ and $h$ both tend to $L$, then $f$ tends to $L$ too, e.g. $x\sin\tfrac1x\to0$. | 7.1 8.2 |
| second derivative | The derivative of the derivative, $f''(x)=\dfrac{d^2y}{dx^2}$. For a position $s(t)$ it is the acceleration; its sign is used in the second derivative test for maxima and minima. | 7.3 7.4 |
| second derivative test | If $f'(c)=0$: $f''(c)\lt0$ gives a local maximum and $f''(c)\gt0$ a local minimum; if $f''(c)=0$ the test gives no information. | 7.4 |
| signum function | $\operatorname{sgn}x=1$ for $x\gt0$, $0$ for $x=0$, $-1$ for $x\lt0$; it records the sign of $x$, and $x=|x|\operatorname{sgn}x$. | 7.1 |
Ch 8 · Integral Calculus
| Term | Meaning | Used in |
|---|---|---|
| antiderivative | A function $F$ whose derivative is $f$ on an interval: $F'(x)=f(x)$. On an interval any two antiderivatives of $f$ differ by a constant. | 8.1 8.2 9.1 |
| area between two curves | For $g\le f$ on $[a,b]$, the area of the region between them is $\int_a^b\big[f(x)-g(x)\big]\,dx$ — top minus bottom, wherever the curves lie. | 8.3 |
| area under a curve | For $f\ge0$ on $[a,b]$, the area of the region between $y=f(x)$, the $x$-axis and the lines $x=a$, $x=b$: $\int_a^b f(x)\,dx$. If $f$ changes sign, the area is $\int_a^b|f(x)|\,dx$. | 8.2 8.3 |
| constant of integration | The arbitrary constant $C$ in $\int f(x)\,dx=F(x)+C$. An initial condition (one point on the curve) fixes its value. | 8.1 |
| definite integral | The number $\int_a^b f(x)\,dx=\lim_{n\to\infty}\sum f(x_r^*)\,h$, the limit of Riemann sums: the signed area between $y=f(x)$ and the $x$-axis from $x=a$ to $x=b$. | 8.2 8.3 |
| fundamental theorem of calculus | For continuous $f$: $\frac{d}{dx}\int_a^x f(t)\,dt=f(x)$, and $\int_a^b f(x)\,dx=F(b)-F(a)$ for any antiderivative $F$ of $f$. | 8.2 9.1 |
| horizontal strip | A thin slice of a region between $y$ and $y+dy$; its area is (right $-$ left)$\,dy$. Best when every horizontal slice has the same two boundary curves. | 8.3 |
| indefinite integral | The family of all antiderivatives of $f$, written $\int f(x)\,dx=F(x)+C$ with $F$ any one antiderivative and $C$ an arbitrary constant. | 8.1 |
| integrand | The function being integrated: in $\int f(x)\,dx$ or $\int_a^b f(x)\,dx$ the integrand is $f(x)$. | 8.1 8.2 |
| integration by parts | The method $\int u\,v'\,dx=uv-\int u'\,v\,dx$, from the product rule. Choose $u$ by the order ILATE (inverse trig, log, algebraic, trig, exponential). | 8.1 8.2 |
| integration by substitution | The method $\int f(g(x))\,g'(x)\,dx=\int f(u)\,du$ with $u=g(x)$, $du=g'(x)\,dx$ — the chain rule read backwards. | 8.1 |
| King's property | $\int_a^b f(x)\,dx=\int_a^b f(a+b-x)\,dx$: reflecting the interval about its midpoint leaves the integral unchanged. Adding the two forms often makes the integrand simple. | 8.2 |
| Leibniz rule | $\frac{d}{dx}\int_{g(x)}^{h(x)}f(t)\,dt=f(h(x))\,h'(x)-f(g(x))\,g'(x)$ for continuous $f$ and differentiable $g$, $h$. | 8.2 |
| limits of integration | The numbers $a$ (lower) and $b$ (upper) in $\int_a^b f(x)\,dx$. After a substitution $u=g(x)$ they become $g(a)$ and $g(b)$. | 8.2 |
| partial fraction decomposition | Writing a proper rational function as a sum of simple fractions such as $\frac{A}{x-a}$, $\frac{B}{(x-a)^2}$ and $\frac{Bx+C}{x^2+bx+c}$, each of which can be integrated. | 8.1 |
| proper rational function | A quotient of polynomials $\frac{P(x)}{Q(x)}$ with $\deg P\lt\deg Q$. An improper one ($\deg P\ge\deg Q$) is divided out first. | 8.1 |
| Riemann sum | A sum $\sum_{r=1}^n f(x_r^*)\,h$ of areas of thin rectangles of width $h=\frac{b-a}{n}$; with right ends, left ends or midpoints as the sample points $x_r^*$. | 8.2 8.3 |
| vertical strip | A thin slice of a region between $x$ and $x+dx$; its area is (top $-$ bottom)$\,dx$, and adding the strips gives an integral in $x$. | 8.3 |
Ch 9 · Differential Equations
| Term | Meaning | Used in |
|---|---|---|
| degree of a differential equation | When the equation can be written as a polynomial in $y',y'',\dots$ (after clearing radicals and fractional powers), the highest power of the highest-order derivative. It is not defined for equations such as $y'+\sin y'=x$. | 9.1 |
| homogeneous differential equation | A first-order equation that can be written $\dfrac{dy}{dx}=F\!\left(\dfrac yx\right)$, for example $\dfrac{M(x,y)}{N(x,y)}$ with $M$, $N$ homogeneous of the same degree. The substitution $y=vx$ makes it separable. | 9.1 |
| initial value problem | A differential equation together with conditions such as $y(x_0)=y_0$ that select one particular solution. For a first-order equation one condition fixes the one constant. | 9.1 |
| integrating factor | For $\dfrac{dy}{dx}+P(x)\,y=Q(x)$, the function $\mathrm{IF}=e^{\int P\,dx}$. Multiplying by it turns the left side into $\dfrac{d}{dx}(y\cdot\mathrm{IF})$, so $y\cdot\mathrm{IF}=\int Q\cdot\mathrm{IF}\,dx+C$. | 9.1 |
| linear differential equation | A first-order equation of the form $\dfrac{dy}{dx}+P(x)\,y=Q(x)$: $y$ and $y'$ occur only to the first power and are not multiplied together. Solved with the integrating factor $e^{\int P\,dx}$. | 9.1 |
| order of a differential equation | The order of the highest derivative that occurs in the equation. $y''+4y=0$ has order $2$; $(y')^5=x$ has order $1$ — powers do not change the order. | 9.1 |
| particular solution | A solution of a differential equation obtained from the general solution by giving the arbitrary constants definite values, usually fixed by initial conditions. | 9.1 |
| separation of variables | The method for $\dfrac{dy}{dx}=g(x)h(y)$: write $\dfrac{dy}{h(y)}=g(x)\,dx$ and integrate both sides, adding one constant. Roots of $h(y)=0$ give constant solutions that must be checked separately. | 9.1 |
| slope field | A picture of a first-order equation $y'=f(x,y)$: at many points $(x,y)$ a short segment with slope $f(x,y)$ is drawn. Solution curves are tangent to the segments everywhere. | 8.1 9.1 |
Ch 10 · Co-ordinate Geometry
| Term | Meaning | Used in |
|---|---|---|
| asymptote | A line that a curve approaches more and more closely as it goes off to infinity. The hyperbola $\frac{x^2}{a^2}-\frac{y^2}{b^2}=1$ has asymptotes $y=\pm\frac bax$. | 10.3 14.1 14.2 |
| centroid | The point where the three medians of a triangle meet: $\left(\frac{x_1+x_2+x_3}{3},\frac{y_1+y_2+y_3}{3}\right)$. It divides each median in the ratio $2:1$ from the vertex. | 10.1 11.1 12.1 |
| chord | A segment joining two points of a curve. In a circle of radius $r$, a chord at distance $p$ from the centre has length $2\sqrt{r^2-p^2}$, and the perpendicular from the centre bisects it. | 6.2 7.2 7.3 7.4 |
| circumcentre | The point where the perpendicular bisectors of the sides of a triangle meet; it is equidistant (distance $R$, the circumradius) from the three vertices and is the centre of the circumcircle. | 10.1 |
| concentric circles | Circles with the same centre. In general form they have the same $g$ and $f$ and differ only in $c$. | 10.2 |
| concurrent lines | Three or more lines that pass through one common point. Three lines $a_ix+b_iy+c_i=0$, no two parallel, are concurrent exactly when the determinant of their coefficients is $0$. | 10.1 |
| conic section | A curve in which a plane cuts a double-napped right circular cone: a circle, ellipse, parabola or hyperbola (or, through the vertex, a degenerate conic). | 10.1 10.2 10.3 |
| degenerate conic | A section of a cone by a plane through its vertex: a single point, a single line or a pair of intersecting lines. | 10.2 10.3 |
| directrix | The fixed line $l$ in the focus–directrix property of a conic: every point $P$ of the conic satisfies $SP=e\cdot PM$, where $PM$ is the distance from $P$ to $l$. For the standard ellipse and hyperbola the directrices are $x=\pm\frac ae$. | 10.3 |
| eccentricity | The constant $e$ in the focus–directrix property $SP=e\cdot PM$ of a conic: $e=0$ circle, $0\lt e\lt1$ ellipse, $e=1$ parabola, $e\gt1$ hyperbola. For a section of a cone, $e=\cos\beta/\cos\alpha$. | 10.3 |
| ellipse | The conic with $0\lt e\lt1$; standard form $\frac{x^2}{a^2}+\frac{y^2}{b^2}=1$ with $b^2=a^2(1-e^2)$. The sum of the distances of any of its points from the two foci is $2a$. | 8.3 10.1 10.2 10.3 |
| Euler line | The line through the orthocentre $H$, centroid $G$ and circumcentre $O$ of a triangle; $G$ divides $HO$ in the ratio $2:1$, so $H=3G-2O$. | 10.1 |
| focal chord | A chord of a conic that passes through a focus. For $y^2=4ax$ its length is the sum of the focal distances $(x_1+a)+(x_2+a)$ of its ends. | 10.3 |
| focus of a conic | The fixed point $S$ in the focus–directrix property $SP=e\cdot PM$. The parabola $y^2=4ax$ has focus $(a,0)$; the ellipse and hyperbola in standard form have two foci $(\pm ae,0)$. | 10.3 |
| general equation of a circle | $x^2+y^2+2gx+2fy+c=0$: a circle with centre $(-g,-f)$ and radius $\sqrt{g^2+f^2-c}$ when $g^2+f^2-c\gt0$. | 10.2 |
| hyperbola | The conic with $e\gt1$; standard form $\frac{x^2}{a^2}-\frac{y^2}{b^2}=1$ with $b^2=a^2(e^2-1)$. The difference of the distances of any of its points from the two foci is $\pm2a$. | 9.1 10.2 10.3 |
| inclination of a line | The angle $\theta$, $0^\circ\le\theta\lt180^\circ$, measured anticlockwise from the positive $x$-axis to the line. A non-vertical line has slope $m=\tan\theta$. | 10.1 |
| intercept | The signed distance from the origin at which a line meets an axis: a line through $(a,0)$ and $(0,b)$ has $x$-intercept $a$ and $y$-intercept $b$, and equation $\frac xa+\frac yb=1$ when $a,b\ne0$. | 10.1 10.2 |
| latus rectum | The focal chord perpendicular to the axis of a conic. Its length is $4a$ for $y^2=4ax$ and $\frac{2b^2}{a}$ for $\frac{x^2}{a^2}\pm\frac{y^2}{b^2}=1$. | 8.3 10.3 |
| locus | The set of all points, and only those points, that satisfy a given geometric condition. Its equation is satisfied by the coordinates of every point of the locus and of no other point. | 1.1 2.1 10.1 10.2 |
| nappe | Either of the two halves of a double cone on opposite sides of its vertex. A double-napped cone is swept out by a line rotating about an axis that it crosses at the vertex. | 10.2 10.3 |
| orthocentre | The point where the three altitudes of a triangle meet. It is inside an acute triangle, at the right-angle vertex of a right triangle and outside an obtuse triangle. | 10.1 |
| parabola | The conic with eccentricity $1$: the locus of points equidistant from a focus and a directrix. Standard form $y^2=4ax$, focus $(a,0)$, directrix $x=-a$. | 1.2 2.2 7.1 7.4 |
| point circle | A circle of radius $0$: an equation such as $(x-h)^2+(y-k)^2=0$, satisfied only by the single point $(h,k)$ (the case $g^2+f^2-c=0$). | 10.2 |
| rectangular hyperbola | A hyperbola with equal semi-axes, $x^2-y^2=a^2$; its asymptotes are perpendicular and its eccentricity is $\sqrt2$. | 9.1 10.3 |
| section formula | The point dividing the join of $(x_1,y_1)$ and $(x_2,y_2)$ internally in the ratio $m:n$ is $\left(\frac{mx_2+nx_1}{m+n},\frac{my_2+ny_1}{m+n}\right)$; for external division replace $n$ by $-n$. | 10.1 11.1 12.1 |
| semi-vertical angle | The constant angle $\alpha$ between the axis of a right circular cone and each of its generators. | 10.2 10.3 |
| tangent to a circle | A line that meets a circle in exactly one point; it is at distance $r$ from the centre. The line $y=mx+c$ touches $x^2+y^2=r^2$ exactly when $c^2=r^2(1+m^2)$. |
Ch 11 · Three Dimensional Geometry
| Term | Meaning | Used in |
|---|---|---|
| common perpendicular | For two skew lines, the unique line that meets both of them at right angles; the segment between its feet is the shortest bridge between the lines. | 11.2 |
| coordinate plane | One of the three planes spanned by two coordinate axes: the $XY$-plane $z=0$, the $YZ$-plane $x=0$ and the $ZX$-plane $y=0$. | 2.1 11.1 |
| coplanar lines | Lines that lie in one plane; two coplanar lines either intersect, are parallel or coincide. Two non-parallel lines are coplanar exactly when the determinant $D$ of Theorem 11.11 is $0$. | 11.1 11.2 12.1 |
| direction angles | The angles $\alpha,\beta,\gamma$ (each between $0$ and $\pi$) that a directed line makes with the positive $x$-, $y$- and $z$-axes. | 11.1 |
| direction cosines | $l=\cos\alpha$, $m=\cos\beta$, $n=\cos\gamma$ for a directed line; they satisfy $l^2+m^2+n^2=1$, and reversing the direction changes all three signs. | 11.1 11.2 12.1 |
| direction ratios | Any three numbers $a,b,c$, not all zero, proportional to the direction cosines of a line; for the line through two points they can be taken as the differences of the coordinates. | 11.1 11.2 |
| Lagrange's identity | $(a_1^2+b_1^2+c_1^2)(a_2^2+b_2^2+c_2^2)-(a_1a_2+b_1b_2+c_1c_2)^2=(b_1c_2-b_2c_1)^2+(c_1a_2-c_2a_1)^2+(a_1b_2-a_2b_1)^2$; it gives $\sin\theta$ for the angle between two lines. | 11.2 12.1 |
| octant | One of the eight regions into which the three coordinate planes divide space, named by the signs of $(x,y,z)$; octant I has all three coordinates positive. | 11.1 |
| projection of a segment | The signed length between the feet of the perpendiculars from the ends of the segment to a line; for a line with direction cosines $l,m,n$ it is $l(x_2-x_1)+m(y_2-y_1)+n(z_2-z_1)$. | 11.1 11.2 |
| shortest distance | For two lines, the least distance between a point of one and a point of the other; for skew lines it is $\frac{|D|}{\sqrt{p^2+q^2+r^2}}$, measured along the common perpendicular. | 11.1 11.2 |
| skew lines | Two lines in space that are neither parallel nor intersecting, so no plane contains both; for example, a road and a flyover crossing it at a different height. | 11.2 |
| symmetric form of a line | The equation $\frac{x-x_1}{a}=\frac{y-y_1}{b}=\frac{z-z_1}{c}$ of the line through $(x_1,y_1,z_1)$ with direction ratios $a,b,c$ (also called its Cartesian form); a zero denominator means that coordinate is constant. | 11.1 |
Ch 12 · Vector Algebra
| Term | Meaning | Used in |
|---|---|---|
| collinear vectors | Vectors along the same or parallel lines (same or opposite direction). For $\vec b\ne\vec 0$: $\vec a=\lambda\vec b$ for some scalar $\lambda$, i.e. proportional components. | 12.1 |
| parallelogram law | If $\vec a$ and $\vec b$ are drawn from one point as adjacent sides of a parallelogram, $\vec a+\vec b$ is the diagonal from that point (and $\vec a-\vec b$ is the other diagonal). | 2.1 12.1 |
| position vector | The vector $\overrightarrow{OP}$ from a fixed origin $O$ to a point $P$. With position vectors $\vec a$, $\vec b$ of $A$, $B$, the vector $\overrightarrow{AB}=\vec b-\vec a$. | 2.1 11.1 11.2 12.1 |
| scalar product | $\vec a\cdot\vec b=|\vec a||\vec b|\cos\theta=a_1b_1+a_2b_2+a_3b_3$, a number. It is zero exactly when non-zero vectors are perpendicular, and gives angles, projections and work. | 7.4 11.2 12.1 |
| scalar projection | The scalar projection of $\vec a$ on $\vec b$ is $\dfrac{\vec a\cdot\vec b}{|\vec b|}$, the signed length of the shadow of $\vec a$ on the line of $\vec b$; the vector projection is $\dfrac{\vec a\cdot\vec b}{|\vec b|^2}\,\vec b$. | 12.1 |
| triangle law of addition | To add $\vec a$ and $\vec b$, place the tail of $\vec b$ at the head of $\vec a$; the sum runs from the tail of $\vec a$ to the head of $\vec b$: $\overrightarrow{AB}+\overrightarrow{BC}=\overrightarrow{AC}$. | 12.1 |
| unit vector | A vector of magnitude $1$. The unit vector in the direction of a non-zero $\vec a$ is $\hat a=\dfrac{\vec a}{|\vec a|}$; $\hat i$, $\hat j$, $\hat k$ are the unit vectors along the axes. | 12.1 |
| vector product | $\vec a\times\vec b=|\vec a||\vec b|\sin\theta\,\hat n$, a vector perpendicular to both (right-hand rule). Its magnitude is the area of the parallelogram on $\vec a$ and $\vec b$; $\vec b\times\vec a=-\vec a\times\vec b$. | 11.2 12.1 |
Ch 13 · Statistics and Probability
| Term | Meaning | Used in |
|---|---|---|
| Bayes' theorem | $P(E_k|A)=\tfrac{P(E_k)P(A|E_k)}{\sum P(E_i)P(A|E_i)}$: the probability of a cause after the evidence $A$ is seen. | 13.2 |
| Bernoulli trials | Independent repetitions of an experiment with two outcomes (success, failure) and the same success probability $p$ every time. | 13.3 |
| binomial distribution | The distribution of the number of successes in $n$ Bernoulli trials: $P(X=r)={}^nC_rp^rq^{n-r}$, with mean $np$ and variance $npq$. | 13.3 |
| class mark | The mid-point $\tfrac{l+u}{2}$ of a class $l$–$u$; it stands for every observation in the class when grouped data are averaged. | 13.1 |
| coefficient of variation | $\text{C.V.}=\tfrac{\sigma}{\bar x}\times100$, the spread relative to the mean. Of two data sets, the one with the smaller C.V. is the more consistent. | 13.1 |
| conditional probability | The probability of $A$ given that $B$ has occurred: $P(A|B)=\tfrac{P(A\cap B)}{P(B)}$, for $P(B)\gt0$. | 13.2 |
| cumulative frequency | The total frequency of a class and all the classes before it; it locates the median (the first class whose cumulative frequency reaches $\tfrac N2$). | 13.1 |
| exhaustive events | Events whose union is the whole sample space, so at least one of them must occur. | 4.1 13.2 13.3 |
| expected value | The mean of a random variable, $E(X)=\sum x_ip_i$ — the long-run average value over many repetitions. | 4.2 13.3 |
| independent events | Events with $P(A\cap B)=P(A)P(B)$ — knowing one occurred does not change the probability of the other. Not the same as mutually exclusive. | 13.2 13.3 |
| mean deviation | The average distance of the observations from a centre $a$: $\tfrac1n\sum|x_i-a|$, usually about the mean or the median. It is least about the median. | 13.1 |
| median class | In grouped data, the first class whose cumulative frequency is at least $\tfrac N2$; the median lies in it: $M=l+\tfrac{N/2-C}{f}h$. | 13.1 |
| modal class | The class with the largest frequency in grouped data; the mode lies in it: $l+\tfrac{f_1-f_0}{2f_1-f_0-f_2}h$. | 13.1 |
| mutually exclusive events | Events that cannot occur together: $A\cap B=\phi$, so $P(A\cup B)=P(A)+P(B)$. | 13.2 13.3 |
| posterior probability | The probability $P(E_k|A)$ of a cause after the evidence $A$ has been observed, computed from the prior $P(E_k)$ by Bayes' theorem. | 13.2 |
| probability distribution | The list of values $x_i$ of a random variable with their probabilities $p_i=P(X=x_i)$; every $p_i\ge0$ and $\sum p_i=1$. | 1.2 13.3 |
| random variable | A rule $X$ that assigns a real number to every outcome of a random experiment, such as the number of heads in three tosses. | 13.3 |
| sample space | The set $S$ of all possible outcomes of a random experiment; events are subsets of $S$. | 13.2 13.3 |
| standard deviation | The positive square root $\sigma$ of the variance; it has the same units as the data. | 13.1 13.3 |
| total probability | If $E_1,\dots,E_n$ are mutually exclusive and exhaustive, $P(A)=\sum P(E_i)P(A|E_i)$: add the probabilities of all the paths that lead to $A$. | 13.2 |
| variance | The mean of the squared deviations from the mean, $\sigma^2=\tfrac1n\sum(x_i-\bar x)^2=\tfrac1n\sum x_i^2-\bar x^{\,2}$. Unchanged by adding a constant; multiplied by $p^2$ when the data are multiplied by $p$. | 6.2 13.1 13.3 |
Ch 14 · Trigonometry
| Term | Meaning | Used in |
|---|---|---|
| allied angles | Angles such as $-\theta$, $\tfrac\pi2\pm\theta$, $\pi\pm\theta$, $2\pi-\theta$ whose trigonometric values are $\pm$ those of $\theta$ (or of the co-function), e.g. $\cos(\pi-\theta)=-\cos\theta$. | 14.1 |
| arcsine | Another name for $\sin^{-1}x$ (written $\arcsin x$): the angle in $\left[-\tfrac\pi2,\tfrac\pi2\right]$ whose sine is $x$. | |
| arctangent | Another name for $\tan^{-1}x$ (written $\arctan x$): the angle in $\left(-\tfrac\pi2,\tfrac\pi2\right)$ whose tangent is $x$. | |
| complementary identity | One of $\sin^{-1}x+\cos^{-1}x=\tfrac\pi2$, $\tan^{-1}x+\cot^{-1}x=\tfrac\pi2$, $\sec^{-1}x+\operatorname{cosec}^{-1}x=\tfrac\pi2$ on their domains. | |
| compound-angle formulas | Formulas for the trigonometric functions of $A\pm B$, e.g. $\sin(A+B)=\sin A\cos B+\cos A\sin B$ and $\cos(A-B)=\cos A\cos B+\sin A\sin B$. | 2.1 14.1 14.2 |
| fundamental period | The least positive period of a periodic function. For $a\sin(bx+c)+d$ it is $\tfrac{2\pi}{|b|}$. | 14.1 |
| inverse trigonometric function | The inverse of a trigonometric function restricted to a principal value branch, e.g. $\sin^{-1}:[-1,1]\to\left[-\tfrac\pi2,\tfrac\pi2\right]$. Note $\sin^{-1}x\ne\tfrac1{\sin x}$. | 1.2 7.1 7.3 14.1 |
| periodic function | A function with $f(x+p)=f(x)$ for all $x$ and some $p\gt0$. $\sin$ and $\cos$ are periodic with period $2\pi$, $\tan$ and $\cot$ with period $\pi$. | 14.1 |
| principal value | The value an inverse trigonometric function returns: the one angle in its branch with the given sine, cosine, …; e.g. the principal value of $\cos^{-1}\left(-\tfrac12\right)$ is $\tfrac{2\pi}3$. | 14.2 |
| principal value branch | The interval of angles in which an inverse trigonometric function takes its values: $\left[-\tfrac\pi2,\tfrac\pi2\right]$ for $\sin^{-1}$, $[0,\pi]$ for $\cos^{-1}$, $\left(-\tfrac\pi2,\tfrac\pi2\right)$ for $\tan^{-1}$, $(0,\pi)$ for $\cot^{-1}$. | 7.3 14.2 |
| radian | The angle at the centre of a circle that cuts off an arc equal to the radius. A full turn is $2\pi$ radians, so $\pi\ \text{rad}=180^\circ$ and $1\ \text{rad}\approx57.3^\circ$. | 7.1 7.3 14.1 14.2 |
| reference angle | The acute angle between the final ray of an angle and the $x$-axis. Any trigonometric value equals $\pm$ the value at the reference angle, the sign fixed by the quadrant. | 14.1 14.2 |
| sinusoid | A wave $y=a\sin(bx+c)+d$: amplitude $|a|$, period $\tfrac{2\pi}{|b|}$, phase shift $-\tfrac cb$ and midline $y=d$. | 2.1 14.1 |
| sum-to-product formulas | Formulas turning sums of sines or cosines into products and back, e.g. $\sin C-\sin D=2\cos\tfrac{C+D}2\sin\tfrac{C-D}2$. | 14.1 |
| unit circle | The circle $x^2+y^2=1$. Turning through $\theta$ from $(1,0)$ reaches the point $(\cos\theta,\sin\theta)$; this defines sine and cosine for every real $\theta$. | 2.1 2.2 7.1 8.3 |