IB Maths AI notes › Glossary
Glossary
Key terms in plain words, with the lesson that teaches each one.
6
- 68–95–99.7 rule
- For a normal distribution, approximately , and of values lie within , and standard deviations of the mean.Taught in 4.9 Normal distribution
A
- acceleration
- The rate of change of velocity with time, ; in straight-line motion, a negative acceleration slows an object down only while its velocity is positive, because speed falls only when velocity and acceleration have opposite signs.Taught in 5.13 Kinematics
- adjacency matrix
- A square matrix with one row and one column for each vertex of a graph, whose entry in row , column is the number of edges going directly from vertex to vertex ; it is symmetric when the graph is undirected.Taught in 3.15 Adjacency matrices and walks
- alternative hypothesis
- The statement that a test finds evidence for when it rejects ; its form (, or or ) decides whether a t-test is two-tailed or one-tailed.Taught in 4.11 Chi-squared tests and the t-test
- ambiguous case
- When you know two sides of a triangle and an angle not between them, the sine rule can give both an acute and an obtuse angle, so two, one or no triangles may fit; keep each angle whose sum with the known angle is less than .Taught in 3.8 Unit-circle trigonometry and equations
- amortization
- Repaying a loan with equal regular payments, each covering that period's interest with the rest reducing the amount owed, so the debt reaches 0 with the last payment; in IB exams the payments are made at the end of each period.Taught in 1.7 Amortization and annuities
- amplitude
- For a sine or cosine wave, half the difference between its maximum and minimum values; for or it is , which is never negative.Taught in 2.5 Modelling with functions
- angle between a line and a plane
- For a line that meets a plane, the angle between the line and its projection on the plane, the line joining the meeting point to the foot of a perpendicular dropped from a point on the line to the plane; it is never more than .Taught in 3.1 3D distance, midpoint and measurement
- angle of depression
- The angle between the horizontal (not the vertical) and the line of sight down to an object below the observer; over horizontal ground it equals the angle of elevation from the object back to the observer.Taught in 3.3 Applied triangle trigonometry
- angle of elevation
- The angle between the horizontal and the line of sight up to an object above the observer.Taught in 3.3 Applied triangle trigonometry
- annuity
- A lump sum invested now that pays out a fixed amount each period for a set number of periods, while the money left in it keeps earning compound interest; in IB exams the payments are made at the end of each period.Taught in 1.7 Amortization and annuities
- antiderivative
- A function whose derivative is , so ; on an interval, any two antiderivatives of differ only by a constant.Taught in 5.5 Antidifferentiation, definite integrals and area
- arc
- Part of the circumference of a circle; with radius and angle degrees at the centre, its length is .Taught in 3.4 Arc length and sector area
- Argand diagram
- A drawing of the complex plane, with a horizontal real axis and a vertical imaginary axis, on which (, real) is the point .Taught in 1.12 Complex numbers in Cartesian form
- argument of a complex number
- For , the angle from the positive real axis to the line from to on an Argand diagram, measured anticlockwise and usually with ; gives it only when , so check the quadrant.Taught in 1.12 Complex numbers in Cartesian form
- arithmetic sequence
- A sequence in which each term is the previous term plus the same constant (positive, negative or zero), so the terms rise, fall or stay level in equal steps.Taught in 1.2 Arithmetic sequences and series
- asymptote
- A straight line that a graph gets closer and closer to as or grows without limit, written as an equation such as (vertical) or (horizontal); a graph may cross a horizontal asymptote at a finite value of .Taught in 2.4 Key features of graphs
- axis of symmetry
- A line that a graph can be folded along so the two halves match; for the parabola it is the vertical line through the vertex.Taught in 2.4 Key features of graphs
B
- base vectors
- The unit vectors , and , one unit along the positive -, - and -axes, so that any vector can be written .Taught in 3.10 Vectors in 2D and 3D
- bearing
- A direction given as the angle measured clockwise from north, written with three figures before any decimal point, such as for north-east.Taught in 3.3 Applied triangle trigonometry
- binomial distribution
- The distribution of the number of successes in a fixed number of independent trials, each with two outcomes and the same probability of success; it is written and has mean and variance .Taught in 4.8 Binomial distribution
- bivariate data
- Data that comes in pairs: two measurements, such as height and mass, taken from each member of a sample.Taught in 4.4 Correlation and regression (y on x)
- boundary condition
- A known pair of values, such as when , substituted into the integrated function (not the derivative) to find the constant of integration.Taught in 5.5 Antidifferentiation, definite integrals and area
- box and whisker diagram
- A diagram drawn to scale with a box from to , a line at the median, whiskers out to the smallest and largest values that are not outliers, and a cross for each outlier.Taught in 4.2 Data presentation
C
- carrying capacity
- In a logistic model with , the value : the horizontal asymptote , a long-term limit the quantity approaches but never reaches.Taught in 2.9 Further function models
- Cartesian form
- A complex number written as with and real: the real part first, then the imaginary part times .Taught in 1.12 Complex numbers in Cartesian form
- causation
- When a change in one variable directly produces a change in another; a correlation alone, however strong, does not show causation.Taught in 4.4 Correlation and regression (y on x)
- cell (Voronoi diagram)
- The region of all points closer to one site than to any other site; its edges lie on perpendicular bisectors of that site and its neighbouring sites.Taught in 3.6 Voronoi diagrams
- central limit theorem
- The result that the mean of a random sample of size from any population with mean and variance is approximately when is large, where how large depends on the population and IB exams treat as enough.Taught in 4.15 Sample mean and the central limit theorem
- chain rule
- The rule for differentiating a composite function: if and , then , so you differentiate the outside function and multiply by the derivative of the inside.Taught in 5.9 Differentiation rules and related rates
- characteristic polynomial
- For a matrix , the quadratic in , whose roots are the eigenvalues of .Taught in 1.15 Eigenvalues and eigenvectors
- Chinese postman problem
- Finding the least-weight closed route along every edge of a connected weighted graph at least once, by repeating the shortest routes for the least-weight pairing of the odd vertices.Taught in 3.16 Spanning trees, postman and salesman problems
- circuit
- A trail that starts and finishes at the same vertex, so it is closed and repeats no edge.Taught in 3.16 Spanning trees, postman and salesman problems
- class interval
- A group of values in a grouped frequency table, written as an inequality such as ; the classes leave no gaps and don't overlap, so each value belongs to exactly one class.Taught in 4.2 Data presentation
- coefficient of determination
- , the proportion of the variation in that a model accounts for; it equals for a linear least squares model, and a high on its own does not show that a model is the right choice.Taught in 4.13 Non-linear regression and R²
- common difference
- In an arithmetic sequence, the constant , the same for every pair of consecutive terms and negative when the terms fall; for real data that is only roughly arithmetic it can only be estimated.Taught in 1.2 Arithmetic sequences and series
- common ratio
- The number that every term of a geometric sequence is multiplied by to give the next term; it is the same for every pair of consecutive terms, and it can be negative or a fraction but never .Taught in 1.3 Geometric sequences and series
- complementary events
- An event and its complement (not ), which holds every outcome not in ; exactly one of them happens on each trial, so .Taught in 4.5 Probability foundations and expected value
- complete graph
- A simple graph in which every pair of vertices is joined by an edge; the complete graph on vertices has edges.Taught in 3.14 Graph theory basics
- complex conjugate
- For with and real, the conjugate is , the reflection of in the real axis of an Argand diagram; the non-real roots of a quadratic with real coefficients are a conjugate pair.Taught in 1.12 Complex numbers in Cartesian form
- complex number
- A number , where and are real and is the non-real number with ; real numbers are the complex numbers with .Taught in 1.12 Complex numbers in Cartesian form
- component of a vector
- One of the numbers , , in , giving how far the vector goes along the -, - or -axis, written in that order in a column vector.Taught in 3.10 Vectors in 2D and 3D
- component of a vector in a direction
- For a non-zero vector , the component of in the direction of is the scalar , where is the angle between them (negative when ), and the component perpendicular to , in the plane of the two vectors, is .Taught in 3.13 Scalar and vector products
- composite function
- The function that applies first and then to the result, so ; it exists only where lies in the domain of , and swapping the order usually gives a different function.Taught in 2.7 Composite and inverse functions
- compound interest
- Interest that is added to the balance at the end of each period and then earns interest itself; at a nominal annual rate of compounded times a year, the balance is multiplied by each period.Taught in 1.4 Compound interest and depreciation
- concave-down
- Bending downwards on an interval, with the gradient decreasing as increases; a graph is concave-down on any interval where throughout.Taught in 5.10 Second derivative and concavity
- concave-up
- Bending upwards on an interval, with the gradient increasing as increases; a graph is concave-up on any interval where throughout.Taught in 5.10 Second derivative and concavity
- conditional probability
- The probability of given that has happened, written and equal to , where .Taught in 4.6 Probability diagrams, rules and independence
- confidence interval
- A range of values for a population mean, calculated from one random sample by a method that gives an interval containing the true mean for a stated percentage of all such samples; a 95% interval does not mean a 95% chance that this particular interval contains the mean.Taught in 4.16 Confidence intervals for the mean
- connected graph
- A graph in which you can travel along edges from any vertex to any other vertex.Taught in 3.14 Graph theory basics
- constant of integration
- The at the end of an indefinite integral, there because any constant differentiates to ; on a domain with no breaks, one known point on the curve fixes its value.Taught in 5.5 Antidifferentiation, definite integrals and area
- content validity
- The extent to which a test covers every part of what it is meant to measure, in sensible proportions.Taught in 4.12 Data collection, reliability and validity
- contingency table
- A two-way table of observed frequencies, with one categorical variable in the rows and another in the columns, used in the χ² test for independence.Taught in 4.11 Chi-squared tests and the t-test
- continuous data
- Measured data that can take any value in a range, such as a time or a mass, even when it is recorded rounded.Taught in 4.1 Sampling, data quality and outliers
- continuous function
- Informally, a function whose graph has no breaks or jumps on an interval, so it can be drawn there without lifting your pen; a piecewise function is continuous at a joining point when the rules on both sides give the same value there.Taught in 2.9 Further function models
- continuous random variable
- A random variable that can take any value in an interval, such as a time or a mass; its probabilities are areas under a curve, so and .Taught in 4.9 Normal distribution
- convenience sampling
- Choosing the members of the population that are easiest to reach, such as the first people you meet; it is quick but likely to be biased.Taught in 4.1 Sampling, data quality and outliers
- correlation
- How closely the points of a scatter diagram follow a straight line, described by direction (positive, negative or zero) and strength (strong, weak or none).Taught in 4.4 Correlation and regression (y on x)
- cosine rule
- In any triangle , , where is the angle between sides and and is the side opposite it.Taught in 3.2 Triangle trigonometry
- coupled differential equations
- A pair of differential equations, one giving and one giving , in which each rate can depend on both and , so the two must be solved together.Taught in 5.16 Euler's method
- critical region
- The values of a test statistic that lead to rejecting ; for a binomial or Poisson test it is the tail with the largest probability under that is still less than the significance level.Taught in 4.18 Further hypothesis tests and errors
- critical value
- The boundary value of a test statistic for a given significance level and sample size (number of pairs or degrees of freedom): correlation is significant when is greater than the critical value of , and in a test is rejected when is greater than its critical value.Taught in 4.4 Correlation and regression (y on x)
- cumulative frequency
- The number of data values less than or equal to a given value, a running total of the frequencies; on a cumulative frequency graph it is plotted at each class's upper boundary.Taught in 4.2 Data presentation
- cycle
- A circuit that repeats no vertex, except that the start vertex is also the end vertex.Taught in 3.16 Spanning trees, postman and salesman problems
D
- decreasing function
- A function is decreasing on an interval if its output gets smaller as gets bigger there, so gives ; this holds whenever for every in the interval.Taught in 5.2 Increasing and decreasing functions
- definite integral
- The number , found from between the limits and ; with , it equals the area between the curve and the -axis only when throughout, because parts below the axis count as negative.Taught in 5.5 Antidifferentiation, definite integrals and area
- degree of a vertex
- The number of edge ends at a vertex, with a loop counting twice; in any graph the degrees add up to twice the number of edges.Taught in 3.14 Graph theory basics
- degrees of freedom
- The number of values free to vary once the totals are fixed: for a contingency table with rows and columns, and for an SL goodness of fit test with categories (one fewer for each parameter estimated from the data).Taught in 4.11 Chi-squared tests and the t-test
- deleted vertex algorithm
- Deleting one vertex, finding a minimum spanning tree of the rest and adding the two least-weight edges from the deleted vertex; the total is a lower bound for the travelling salesman problem, and the largest such bound is the best.Taught in 3.16 Spanning trees, postman and salesman problems
- depreciation
- The loss of an item's value over time; at a fixed rate of a year the value is multiplied by each year, so in this model it falls by a smaller amount each year and never reaches .Taught in 1.4 Compound interest and depreciation
- derivative
- The function , also written when , whose value at each is the gradient of the curve there and the rate of change of with respect to .Taught in 5.1 Limits and the derivative as a rate of change
- determinant
- A number, written or , worked out from a square matrix : for a matrix with rows and it is , and has an inverse only when .Taught in 1.14 Matrices, determinants and inverses
- diagonalization
- Writing a square matrix as , with eigenvectors of as the columns of and the matching eigenvalues, in the same order, on the diagonal of (zeros elsewhere), so that ; in IB AI it is done only for matrices with two different real eigenvalues.Taught in 1.15 Eigenvalues and eigenvectors
- differential equation
- An equation that contains a derivative, such as ; solving it means finding the function itself.Taught in 5.14 Setting up and separating differential equations
- direct variation
- A relationship with and a positive integer, read " is proportional to "; then when .Taught in 2.5 Modelling with functions
- directed graph
- A graph in which each edge has a direction, shown by an arrow, and is travelled only that way; a vertex's in-degree counts edges coming in and its out-degree counts edges going out.Taught in 3.14 Graph theory basics
- direction vector
- A non-zero vector parallel to a line; any non-zero multiple of it is also a direction vector of that line.Taught in 3.11 Vector equations of lines
- discrete data
- Data that can take only separate values, usually counts, such as the number of goals in a match.Taught in 4.1 Sampling, data quality and outliers
- discrete random variable
- A random variable whose possible values can be listed one by one, such as . Counts and scores are discrete.Taught in 4.7 Discrete random variables and expected value
- discriminant
- For with , the number ; when , and are real, has two distinct real roots if , one repeated real root if , and no real roots but two complex conjugate roots if .Taught in 1.12 Complex numbers in Cartesian form
- displacement
- A change in position, given as a vector: from A to B it is , which depends only on the start and end points and not on the route, so it is not the distance travelled; in one dimension it is a signed distance, such as a position measured from the origin.Taught in 3.12 Kinematics with vectors
- distance travelled
- The total length of path an object covers between two times, counting motion in either direction, ; it equals the size of the displacement only if the object never changes direction in that time.Taught in 5.13 Kinematics
- distribution of the sample mean
- How the mean of a random sample of size varies from sample to sample: it has mean and variance (the variance, not the standard deviation, is divided by ), and it is exactly when the population is .Taught in 4.15 Sample mean and the central limit theorem
- domain
- The set of input values a function is defined for; in a model, the context can limit it further, for example to times .Taught in 2.2 Function concepts, domain and range
E
- e (Euler's number)
- The irrational constant , used as the base of exponential growth and decay models and of the natural logarithm.Taught in 1.5 Exponents and introductory logarithms
- edge (graph theory)
- A line in a graph joining two vertices, or joining a vertex to itself, in which case it is called a loop.Taught in 3.14 Graph theory basics
- edge (Voronoi diagram)
- A boundary between two neighbouring cells; it lies on the perpendicular bisector of their two sites, so every point on it is the same distance from both.Taught in 3.6 Voronoi diagrams
- eigenvalue
- A number such that for some non-zero vector , where is a square matrix; the eigenvalues are the solutions of .Taught in 1.15 Eigenvalues and eigenvectors
- eigenvector
- A non-zero vector with for a square matrix and some number , so the matrix only stretches, shrinks or flips it; any non-zero multiple of it is also an eigenvector for the same , and the zero vector never counts.Taught in 1.15 Eigenvalues and eigenvectors
- equilibrium point
- A point where and at the same time, so a solution that starts there stays there; for , with non-zero eigenvalues it is the origin only.Taught in 5.17 Phase portraits for coupled equations
- Euler's method
- A numerical method that estimates the solution of by repeated steps of constant length : and ; the result is an approximation, usually closer for a smaller .Taught in 5.16 Euler's method
- Eulerian circuit
- A circuit that uses every edge of a graph exactly once; a connected graph has one exactly when every vertex has even degree.Taught in 3.16 Spanning trees, postman and salesman problems
- Eulerian trail
- A trail that uses every edge of a graph exactly once; a connected graph has one exactly when it has 0 or 2 odd vertices, and with 2 odd vertices the trail starts at one and finishes at the other.Taught in 3.16 Spanning trees, postman and salesman problems
- event
- A set of outcomes from the sample space, such as "an odd number"; the event happens when the outcome of the trial is one of them.Taught in 4.5 Probability foundations and expected value
- expected frequency
- The count predicted for a category if is true, compared with the observed (recorded) count; in a contingency table it is row total × column total ÷ grand total, and a χ² test needs each one greater than .Taught in 4.11 Chi-squared tests and the t-test
- expected number of occurrences
- The long-run average number of times an event happens in trials, ; it need not be a whole number.Taught in 4.5 Probability foundations and expected value
- expected value
- The long-run mean of a discrete random variable over many repeats of the trial: . It need not be a value can take.Taught in 4.7 Discrete random variables and expected value
- exponential decay
- A decrease in which equal steps in multiply the gap by the same factor between and , as in with and , with and , or with and ; the values approach but never reach it.Taught in 2.5 Modelling with functions
- exponential form
- A non-zero complex number written , also called Euler form, with the same modulus and argument as in polar form, and in radians.Taught in 1.13 Complex numbers in polar and exponential form
- exponential function
- A function with the variable in the exponent, such as with , , , or with , ; its graph has the horizontal asymptote .Taught in 2.5 Modelling with functions
- exponential growth
- An increase in which equal steps in multiply the gap by the same factor greater than , as in with and , or with and .Taught in 2.5 Modelling with functions
- extrapolation
- Using a model to predict a value outside the range of data it was built from; less reliable, because the trend may not continue there.Taught in 2.6 Fitting and testing models
F
- fair game
- A game in which a player's expected gain is : , where is the player's gain (prize minus cost) in one game.Taught in 4.7 Discrete random variables and expected value
- fractal
- A shape made by applying the same transformations again and again for ever, so it shows detail at every scale; its length or area at each stage often forms a geometric sequence.Taught in 3.9 Matrix transformations
- function
- A rule that gives exactly one output for each input in its domain.Taught in 2.2 Function concepts, domain and range
- future value
- The value after a given number of periods (); in a calculator's finance solver with no regular payments, it has the opposite sign to the present value, because the money moves the other way.Taught in 1.4 Compound interest and depreciation
G
- general form of a line
- The equation of a straight line written as , with every term on one side and and not both zero; it can describe any line, including a vertical one.Taught in 2.1 Straight-line equations
- general solution
- The solution of a differential equation written with arbitrary constants, one for a first-order equation and two for a second-order one, so that it describes a whole family of solution curves.Taught in 5.14 Setting up and separating differential equations
- geometric sequence
- A sequence with a non-zero first term in which each term after the first is the term before multiplied by the same non-zero number , the common ratio, as in where .Taught in 1.3 Geometric sequences and series
- geometric series
- The sum of the terms of a geometric sequence; for a common ratio the first terms add up to .Taught in 1.3 Geometric sequences and series
- global maximum
- The greatest value a function takes anywhere on its domain (the global minimum is the least value); it may be at a local maximum or, when the domain has end points, at an end point.Taught in 5.6 Local maximum and minimum points
- gradient
- The steepness of a straight line, written : the change in divided by the change in between any two points on it, positive when the line rises from left to right, negative when it falls, and undefined for a vertical line.Taught in 2.1 Straight-line equations
- gradient function
- Another name for the derivative : the function that gives the gradient of the tangent to the curve at each value of .Taught in 5.1 Limits and the derivative as a rate of change
- gradient-intercept form
- The equation of a non-vertical line written as , where is the gradient and the line crosses the -axis at .Taught in 2.1 Straight-line equations
- graph (graph theory)
- A set of vertices joined by edges; only which vertices are joined matters, not where they are drawn or how long the edges look.Taught in 3.14 Graph theory basics
H
- half-life
- The time a quantity decaying exponentially towards takes to fall to half its value; for with and it is , the same whatever the starting amount.Taught in 2.9 Further function models
- Hamiltonian cycle
- A cycle that visits every vertex of a graph exactly once and returns to its start vertex.Taught in 3.16 Spanning trees, postman and salesman problems
- Hamiltonian path
- A path that visits every vertex of a graph exactly once; there is no simple test for whether one exists.Taught in 3.16 Spanning trees, postman and salesman problems
- histogram
- A chart of grouped data on a continuous scale, with one bar per class and no gaps between bars; when every class has the same width, each bar's height is the class frequency.Taught in 4.2 Data presentation
- horizontal stretch
- For , the transformation from to , with scale factor , not : every -coordinate is divided by , every -coordinate stays the same, and the -axis is invariant.Taught in 2.8 Transformations of graphs
I
- identity matrix
- The square matrix with s on the leading diagonal and s everywhere else, so that for any square matrix of the same order.Taught in 1.14 Matrices, determinants and inverses
- imaginary part
- For with and real, the imaginary part is the real number , not .Taught in 1.12 Complex numbers in Cartesian form
- increasing function
- A function is increasing on an interval if its output gets bigger as gets bigger there, so gives ; this holds whenever for every in the interval.Taught in 5.2 Increasing and decreasing functions
- indefinite integral
- The family of all antiderivatives of , written ; for a power, only when .Taught in 5.5 Antidifferentiation, definite integrals and area
- independent events
- Events where one happening does not change the probability of the other, so ; two mutually exclusive events that each have a non-zero probability are never independent.Taught in 4.6 Probability diagrams, rules and independence
- initial condition
- A known value at the start of a situation, usually at , which you substitute into a model to find a parameter.Taught in 2.6 Fitting and testing models
- initial state matrix
- The column of probabilities (or proportions) of being in each state at the start, in the same order as the transition matrix ; its entries add up to , and after steps the state matrix is .Taught in 4.19 Transition matrices and Markov chains
- integration by inspection
- Finding an integral by recognising the integrand as the derivative of a known function, often by reversing the chain rule, then differentiating the guess to check it and fix any constant factor.Taught in 5.11 Standard integrals and substitution
- integration by substitution
- Finding by letting , so that becomes , integrating with respect to and writing the answer in terms of again; for a definite integral, you can change the limits to values of instead of writing back.Taught in 5.11 Standard integrals and substitution
- interpolation
- Using a model to predict a value inside the range of data it was built from; usually more reliable than extrapolation, but only as good as the model's fit.Taught in 2.6 Fitting and testing models
- interquartile range
- The difference between the upper and lower quartiles, , which measures the spread of the middle half of the data.Taught in 4.1 Sampling, data quality and outliers
- invariant
- Unchanged by a transformation: an invariant point maps to itself, such as a point on the -axis under the vertical stretch , or on the mirror line under a reflection.Taught in 2.8 Transformations of graphs
- inverse function
- The function that undoes a one-to-one function : if then , its graph is the reflection of the graph of in , its domain is the range of , and is not .Taught in 2.2 Function concepts, domain and range
- inverse matrix
- For a square matrix with , the matrix with ; a matrix with has no inverse, and gives , multiplying on the left.Taught in 1.14 Matrices, determinants and inverses
- inverse normal
- Working back from a probability to a value: for a normal variable with known mean and standard deviation, finding so that ; for , use the area or set the GDC's tail to right.Taught in 4.9 Normal distribution
- inverse trigonometric function
- , and give an angle from a ratio, but a calculator returns only one angle ( and between and , between and ), so other angles with the same ratio may exist.Taught in 3.2 Triangle trigonometry
- inverse variation
- A relationship with and a negative integer, such as ; the -axis is a vertical asymptote, and is constant only when .Taught in 2.5 Modelling with functions
K
- Kruskal's algorithm
- A way to find a minimum spanning tree: take the edges in increasing order of weight, add each one unless it makes a cycle, and stop at edges for vertices.Taught in 3.16 Spanning trees, postman and salesman problems
L
- laws of exponents
- The rules for powers of a non-zero base with integer exponents: and (both need the same base), , and .Taught in 1.5 Exponents and introductory logarithms
- laws of logarithms
- The rules , and , which hold for with ; there is no law for the log of a sum such as .Taught in 1.9 Laws of logarithms
- least squares regression
- Fitting a line or curve of a chosen type (linear, quadratic, cubic, exponential, power or sine) by choosing its parameters so that the sum of the squared vertical distances from the data points to it is as small as possible; for exponential and power models the GDC does this for rather than .Taught in 4.13 Non-linear regression and R²
- limit
- The value that gets closer and closer to as gets closer to a number from both sides (whatever is, or even if it doesn't exist), or as grows without bound; in this course you estimate it from a table, a graph or a GDC table.Taught in 5.1 Limits and the derivative as a rate of change
- line of best fit
- A straight line drawn by eye that follows the trend of the points on a scatter diagram and passes through the mean point .Taught in 4.4 Correlation and regression (y on x)
- linear combination of random variables
- A variable such as built by multiplying random variables by constants and adding; its expected value is always the same combination of the expected values, while its variance is only when the variables are independent, with every term added even for a difference.Taught in 4.14 Linear combinations and unbiased estimates
- linearizing data
- Taking logarithms of one or both variables so that curved data lie on a straight line: for positive data, against is straight for an exponential model and against is straight for a power model .Taught in 2.10 Logarithmic scales and linearizing data
- local maximum
- A point on a graph that is at least as high as every point near it; it need not give the greatest value on the domain, which may be at an end point.Taught in 2.4 Key features of graphs
- local minimum
- A point on a graph that is at least as low as every point near it; it need not give the least value on the domain, which may be at an end point.Taught in 2.4 Key features of graphs
- log-log graph
- A graph with logarithmic scales on both axes, or of against , on which data from a power model with and lie on a straight line with gradient .Taught in 2.10 Logarithmic scales and linearizing data
- logarithm
- For , and , is the exponent for which , so because .Taught in 1.5 Exponents and introductory logarithms
- logarithmic scale
- A scale on which equal distances stand for equal multiplying factors, such as each gridline being times the one before, used when positive values cover a very wide range.Taught in 2.10 Logarithmic scales and linearizing data
- logistic function
- A function with , used to model restricted growth: its S-shaped graph rises almost exponentially while is small compared with , then slows and levels off towards .Taught in 2.9 Further function models
- lower bound
- For a value rounded to the nearest , the rounded value minus , which the true value can equal ( to d.p. has lower bound ); in graph theory, a value that the length of the shortest travelling salesman tour cannot be less than.Taught in 1.6 Rounding, bounds and percentage error
M
- magnitude of a vector
- The length of a vector, for , which is a scalar and never negative.Taught in 3.10 Vectors in 2D and 3D
- Markov chain
- A process that moves between a fixed set of states in steps, where the probability of each possible next state depends only on the current state, not on the states before it.Taught in 4.19 Transition matrices and Markov chains
- matched pairs
- Two measurements on each subject, such as before and after, analysed by testing the differences as one sample.Taught in 4.18 Further hypothesis tests and errors
- mathematical model
- A function or equation that describes a real situation approximately, and is only valid over a domain the context allows.Taught in 2.2 Function concepts, domain and range
- matrix
- A rectangular array of numbers in rows and columns: a matrix with rows and columns has order (rows first), and is the element in row , column .Taught in 1.14 Matrices, determinants and inverses
- matrix multiplication
- Forming the product , which exists only when has as many columns as has rows; each element of is a row of times a column of (multiply matching pairs, then add), and in general .Taught in 1.14 Matrices, determinants and inverses
- mean
- The total of the data values divided by how many values there are, written ( for a whole population).Taught in 4.3 Central tendency and dispersion
- median
- The middle value of the data when it is put in order; with an even number of values it is the mean of the middle two.Taught in 4.2 Data presentation
- minimum spanning tree
- A spanning tree of a connected weighted graph with the least possible total weight; there may be more than one, all with the same weight.Taught in 3.16 Spanning trees, postman and salesman problems
- modal class
- For grouped data with equal class widths, the class with the highest frequency.Taught in 4.3 Central tendency and dispersion
- modulus of a complex number
- For with and real, , the distance from to on an Argand diagram; it is never negative.Taught in 1.12 Complex numbers in Cartesian form
- mutually exclusive events
- Events that cannot both happen, so ; this is not the same as being independent.Taught in 4.6 Probability diagrams, rules and independence
N
- natural logarithm
- The logarithm with base , written and defined only for , so means .Taught in 1.5 Exponents and introductory logarithms
- nearest neighbour algorithm
- Building a tour by going from the start to the nearest unvisited vertex each time, then back to the start; its weight is an upper bound for the travelling salesman problem, not always the best tour.Taught in 3.16 Spanning trees, postman and salesman problems
- nearest neighbour interpolation
- Estimating a quantity at a point as the value at its nearest site, so every point in a Voronoi cell gets the value of that cell's site.Taught in 3.6 Voronoi diagrams
- normal distribution
- A continuous probability distribution whose curve is symmetric and bell-shaped about its mean ; has mean and variance , so its standard deviation is .Taught in 4.9 Normal distribution
- normal to a curve
- The straight line through a point of the curve that is perpendicular to the tangent there; its gradient is when , and it is the vertical line when .Taught in 5.4 Tangents and normals
- null hypothesis
- The statement assumed true during a hypothesis test, such as no association, no difference between population means, or data fitting a claimed distribution; a test either rejects it or does not, and never proves it.Taught in 4.11 Chi-squared tests and the t-test
O
- odd vertex
- A vertex whose degree is odd; every graph has an even number of odd vertices.Taught in 3.16 Spanning trees, postman and salesman problems
- one-tailed test
- A test whose states a direction, such as , so the p-value is the area in one tail only.Taught in 4.11 Chi-squared tests and the t-test
- one-to-one function
- A function in which no two different inputs give the same output, so every horizontal line meets its graph at most once and the function has an inverse.Taught in 2.2 Function concepts, domain and range
- optimisation
- Finding the greatest or least value of a quantity in context over the values its variable can take, usually by comparing the points where the derivative is zero with the ends of the domain.Taught in 5.7 Optimisation problems
- outlier
- A data value less than or greater than ; some outliers are valid data and some are errors, so check the context before removing one.Taught in 4.1 Sampling, data quality and outliers
P
- p-value
- The probability, assuming is true, of a result at least as extreme as the one observed; reject when it is less than the significance level. It is not the probability that is true.Taught in 4.11 Chi-squared tests and the t-test
- parabola
- The U-shaped graph of a quadratic function , which opens upwards when and downwards when .Taught in 2.5 Modelling with functions
- parallel forms reliability
- A reliability check in which the same group takes two equivalent versions of a test; a strong positive correlation between the two sets of scores suggests the test is reliable.Taught in 4.12 Data collection, reliability and validity
- parameter
- A constant in a model, such as , or in , found from the situation and then kept fixed while the variable changes.Taught in 2.6 Fitting and testing models
- parametric form
- A line written as one equation per coordinate in terms of a parameter , such as , , , where is a point on the line and is a direction vector; each value of gives one point.Taught in 3.11 Vector equations of lines
- particular solution
- The one solution of a differential equation that also fits the given conditions, such as a known value at ; the conditions fix the constants in the general solution, one condition for each constant.Taught in 5.14 Setting up and separating differential equations
- path
- A walk in which no vertex is visited more than once, so no edge is repeated either.Taught in 3.16 Spanning trees, postman and salesman problems
- Pearson's product-moment correlation coefficient
- The number , with , that measures the strength and direction of linear correlation only; near means no straight-line link, though the variables may still follow a curve.Taught in 4.4 Correlation and regression (y on x)
- percentage error
- How far an approximate value is from the exact value , as a percentage of the exact value: ; always divide by the exact value, never by the approximation.Taught in 1.6 Rounding, bounds and percentage error
- percentile
- The th percentile is the value with of the data below it, so the median is the 50th percentile.Taught in 4.2 Data presentation
- period
- The horizontal length of one complete cycle of a repeating graph; for or with it is in degrees, or in radians.Taught in 2.5 Modelling with functions
- perpendicular bisector
- The line through the midpoint of a line segment at right angles to it; in a plane, a point lies on it exactly when it is the same distance from both ends of the segment.Taught in 3.5 Perpendicular bisectors
- perpendicular lines
- Lines that meet at a right angle; two non-vertical lines with gradients and are perpendicular exactly when , and a horizontal line is perpendicular to a vertical one.Taught in 2.1 Straight-line equations
- phase portrait
- A diagram in the plane showing the trajectories of a pair of coupled differential equations, with arrows for the direction of motion as time increases; time itself is not an axis.Taught in 5.17 Phase portraits for coupled equations
- phase shift
- The horizontal translation of a sinusoidal graph: in or it is , to the right when , so with is shifted to the left, not .Taught in 1.13 Complex numbers in polar and exponential form
- piecewise function
- A function that uses different rules on different intervals of its domain, with each input using exactly one rule; check which interval an input is in, endpoints included, before substituting.Taught in 2.5 Modelling with functions
- point of inflexion
- A point on a graph where the concavity changes, from concave-up to concave-down or the other way; if exists there it equals , but alone does not make a point of inflexion, and the gradient there need not be .Taught in 5.10 Second derivative and concavity
- point-gradient form
- The equation of the straight line with gradient that passes through the point .Taught in 2.1 Straight-line equations
- Poisson distribution
- The distribution of the number of events in a fixed interval of time or space, when the events happen independently at a uniform average rate of per interval; takes the values and has mean and variance both equal to .Taught in 4.17 Poisson distribution
- polar form
- A non-zero complex number written , where is its modulus and is its argument; also called modulus-argument form.Taught in 1.13 Complex numbers in polar and exponential form
- polynomial
- A sum of terms , where each coefficient is a constant and each power is a whole number ; the highest power with a non-zero coefficient is its degree.Taught in 1.8 Solving equations with technology
- population
- The whole group of people or things that a statistical question is about.Taught in 4.1 Sampling, data quality and outliers
- population product-moment correlation coefficient
- The correlation between two variables in the whole population, estimated by the sample's ; testing : assumes the data come from a bivariate normal distribution.Taught in 4.18 Further hypothesis tests and errors
- position vector
- The arrow from a fixed origin O to a point A, labelled or ; its components equal the coordinates of A.Taught in 3.10 Vectors in 2D and 3D
- power rule
- The rule that the derivative of is (multiply by the power, then lower the power by one), used at SL for integer and at HL also for rational ; it does not apply to an exponential such as , where the variable is in the power.Taught in 5.3 Differentiation of integer-power polynomials
- predator–prey model
- A pair of coupled differential equations for a prey population and a predator population, in which meetings between them lower the prey's growth rate and raise the predators' growth rate.Taught in 5.16 Euler's method
- present value
- The value at the start (), such as the amount invested or borrowed; in a calculator's finance solver with no regular payments, it has the opposite sign to the future value, because the money moves the other way.Taught in 1.4 Compound interest and depreciation
- Prim's algorithm
- A way to find a minimum spanning tree: from a start vertex, keep adding the least-weight edge from a vertex in the tree to a vertex not yet in it; it can be run directly on a table (the matrix method).Taught in 3.16 Spanning trees, postman and salesman problems
- principal axis
- The horizontal line halfway between the maximum and minimum values of or .Taught in 2.5 Modelling with functions
- probability distribution
- Every value a discrete random variable can take, together with its probability , given as a table or a formula. Each probability lies between and , and together they add up to .Taught in 4.7 Discrete random variables and expected value
- product rule
- The rule for differentiating a product of two functions: if , then .Taught in 5.9 Differentiation rules and related rates
- Pythagorean identity
- The identity , true for every angle , which is Pythagoras' theorem for a point on the unit circle.Taught in 3.8 Unit-circle trigonometry and equations
Q
- quadratic function
- A function of the form , where , and are constants and ; its graph is a parabola.Taught in 2.5 Modelling with functions
- quartile
- One of the values that split ordered data into quarters: about a quarter of the data lies below the lower quartile and about three quarters below the upper quartile ; methods differ, so a GDC and a hand method can give slightly different values.Taught in 4.1 Sampling, data quality and outliers
- quota sampling
- Fixing how many members to take from each group, then letting the collector choose anyone who fits until each quota is filled; it is not random, so it can be biased.Taught in 4.1 Sampling, data quality and outliers
- quotient rule
- The rule for differentiating one function divided by another: if , then , with the two terms on top in that order.Taught in 5.9 Differentiation rules and related rates
R
- radian
- A unit of angle: one radian is the angle at the centre of a circle when the arc it cuts off is as long as the radius, so a full turn is radians and radians .Taught in 3.7 Radians, arc length and sector area
- random sample
- A sample chosen so that every member of the population has the same chance of being selected.Taught in 4.1 Sampling, data quality and outliers
- random variable
- A quantity whose value is decided by the outcome of a random trial, such as the number of cars a randomly chosen household owns. It is named with a capital letter, such as ; a lower-case is one value it can take.Taught in 4.7 Discrete random variables and expected value
- range
- The set of output values a function takes over its domain; this is not the range of a data set, which is the largest value minus the smallest.Taught in 2.2 Function concepts, domain and range
- range of a data set
- The largest data value minus the smallest, a single number that measures spread; it is not the range of a function.Taught in 4.2 Data presentation
- rate of change
- How fast one quantity changes for each unit change in another at a given point, given by a derivative such as or ; its units are units of the first quantity per unit of the second, and it is negative when the first quantity is decreasing.Taught in 5.1 Limits and the derivative as a rate of change
- rational exponent
- An exponent that is a fraction: for , an integer and a positive integer , , so the denominator gives the root and the numerator the power.Taught in 1.10 Rational exponents
- real part
- For with and real, the real part is .Taught in 1.12 Complex numbers in Cartesian form
- real value
- What a future amount of money is worth in today's prices once inflation, the yearly percentage rise in prices, is allowed for; it is less than the future value whenever inflation is positive.Taught in 1.4 Compound interest and depreciation
- reflection
- A transformation that flips a graph over a mirror line, sending each point to the point the same distance away on the other side; is the reflection of in the -axis and is its reflection in the -axis.Taught in 2.8 Transformations of graphs
- regression line
- The least-squares line of on , , used to predict from a value of inside the range of the data when the correlation is strong; it cannot reliably predict from .Taught in 4.4 Correlation and regression (y on x)
- regular Markov chain
- A Markov chain whose transition matrix has some power with every entry strictly positive; such a chain has exactly one steady state, and the state matrix approaches it from any initial state.Taught in 4.19 Transition matrices and Markov chains
- relative frequency
- The number of times an event happened divided by the number of trials: an experimental estimate of its probability, unlike the theoretical , which needs equally likely outcomes.Taught in 4.5 Probability foundations and expected value
- relative position
- The position of B relative to A is the vector from A to B, (B's position minus A's, not the other way round); for two moving objects it is at the same time , and its magnitude is the distance between them.Taught in 3.12 Kinematics with vectors
- reliability
- How consistently a method gives the same results when it is repeated under the same conditions; a reliable method is not necessarily valid, because it can consistently measure the wrong thing.Taught in 4.12 Data collection, reliability and validity
- residual
- For one data point, the observed -value minus the value the model predicts at the same ; it is positive when the point lies above the curve and negative when it lies below.Taught in 4.13 Non-linear regression and R²
- root
- A value of the unknown that makes an equation true; the roots of are the zeros of .Taught in 1.8 Solving equations with technology
S
- saddle point
- An equilibrium point of a linear system whose eigenvalues are real with opposite signs: trajectories come in alongside the negative eigenvalue's eigenvector line and leave alongside the positive one's, so it is unstable.Taught in 5.17 Phase portraits for coupled equations
- sample
- The part of a population that data is actually collected from, used to draw conclusions about the whole population.Taught in 4.1 Sampling, data quality and outliers
- sample space
- The set of all possible outcomes of a trial, written ; is the number of outcomes in it.Taught in 4.5 Probability foundations and expected value
- sampling bias
- A built-in tendency of a sampling method to include some kinds of member of the population more often than others, so the sample misrepresents the population; a bigger sample chosen the same way does not remove it.Taught in 4.1 Sampling, data quality and outliers
- scalar product
- The number , found by multiplying matching components and adding, which also equals where is the angle between the vectors; for non-zero vectors it is exactly when they are perpendicular.Taught in 3.13 Scalar and vector products
- scatter diagram
- A graph that plots each pair of bivariate data as one point, to show how the two variables are related.Taught in 4.4 Correlation and regression (y on x)
- second derivative
- The derivative of the derivative, written or ; it measures how fast the gradient is changing.Taught in 5.10 Second derivative and concavity
- second derivative test
- A way to classify a stationary point at : if it is a local minimum, if it is a local maximum, and if the test decides nothing.Taught in 5.10 Second derivative and concavity
- second-order differential equation
- A differential equation whose highest derivative is a second derivative, such as ; putting turns it into the coupled first-order equations and .Taught in 5.18 Second-order differential equations
- sector
- The region of a circle between two radii and the arc joining their ends; with radius and angle degrees at the centre, its area is .Taught in 3.4 Arc length and sector area
- semi-log graph
- A graph with a logarithmic scale on one axis only, usually the vertical one, on which data from an exponential model with lie on a straight line.Taught in 2.10 Logarithmic scales and linearizing data
- separation of variables
- A method for solving where : rearrange to , then integrate both sides with one constant.Taught in 5.14 Setting up and separating differential equations
- sequence
- An ordered list of numbers, called terms; is the th term itself, not the sum of the terms up to it.Taught in 1.2 Arithmetic sequences and series
- series
- The sum of the terms of a sequence; is the sum of the first terms, not the th term.Taught in 1.2 Arithmetic sequences and series
- sigma notation
- A short way to write a sum: means put every whole number from to , both included, into and add the results.Taught in 1.2 Arithmetic sequences and series
- significance level
- The probability threshold, such as , chosen before a hypothesis test: is rejected when the p-value is less than it.Taught in 4.11 Chi-squared tests and the t-test
- significant figures
- The digits of a number counted from its first non-zero digit, so has significant figures; zeros between non-zero digits count, and so does a zero kept at the end after rounding (), but zeros at the end of a whole number may only hold places ( to s.f.); IB answers are exact or given to significant figures unless the question says otherwise.Taught in 1.6 Rounding, bounds and percentage error
- simple graph
- A graph with no loops and no multiple edges, so each pair of vertices is joined by at most one edge.Taught in 3.14 Graph theory basics
- simple interest
- Interest worked out each period on the original amount only, so the same sum is added every period and the balances form an arithmetic sequence rather than a geometric one.Taught in 1.2 Arithmetic sequences and series
- simple random sampling
- Choosing a sample so that every possible group of the required size is equally likely, for example by picking numbers at random from a full list of the population.Taught in 4.1 Sampling, data quality and outliers
- sine rule
- In any triangle , , where each side is opposite the angle with the same letter.Taught in 3.2 Triangle trigonometry
- sinusoidal function
- A wave-shaped function or with ; its period is when is in degrees and when it is in radians.Taught in 2.5 Modelling with functions
- site
- One of the given points a Voronoi diagram is built from, such as a shop or a weather station; each site has its own cell.Taught in 3.6 Voronoi diagrams
- slant height
- On a right cone, the slant height is the distance from the vertex to the edge of the base, measured along the sloping surface; , so it is longer than the vertical height .Taught in 3.1 3D distance, midpoint and measurement
- slope field
- A diagram for a differential equation with a short line segment at each grid point , drawn with gradient ; every solution curve is tangent to the segments it passes through.Taught in 5.15 Slope fields
- spanning tree
- A subgraph of a connected graph that is a tree and includes every vertex of the graph.Taught in 3.16 Spanning trees, postman and salesman problems
- Spearman's rank correlation coefficient
- The number , with , found by calculating Pearson's on the ranks of the data (tied values each take the mean of the ranks they share); it measures how strongly one variable always rises, or always falls, as the other rises, straight-line or curved, and is less affected by outliers than Pearson's .Taught in 4.10 Spearman's rank correlation
- speed
- How fast an object moves, whatever its direction: the magnitude of its velocity, a scalar that is never negative.Taught in 3.10 Vectors in 2D and 3D
- stable equilibrium
- An equilibrium point that all nearby solutions move towards as time increases; for , the origin is stable when both eigenvalues are negative or complex with negative real part.Taught in 5.17 Phase portraits for coupled equations
- standard deviation
- The square root of the variance, measuring how far data values typically lie from the mean; adding a constant to every value leaves it unchanged, and multiplying every value by multiplies it by .Taught in 4.3 Central tendency and dispersion
- standard form
- A way of writing a number as , where and is an integer, such as ; calculator notation such as 3.4E21 is not accepted.Taught in 1.1 Standard form
- stationary point
- A point on a curve where , so the tangent is horizontal; it may be a local maximum, a local minimum or neither.Taught in 5.2 Increasing and decreasing functions
- steady state
- A column of non-negative entries adding up to with for the transition matrix : an eigenvector of for the eigenvalue , scaled so its entries add up to ; for a regular Markov chain it is unique and gives the long-term probabilities.Taught in 4.19 Transition matrices and Markov chains
- stratified sampling
- Splitting the population into groups that share a feature, then taking a random sample from each group in proportion to its size, with the rounded group sizes adjusted so they add up to the total sample size.Taught in 4.1 Sampling, data quality and outliers
- strongly connected graph
- A directed graph in which you can travel from every vertex to every other vertex following the directions of the edges.Taught in 3.14 Graph theory basics
- subgraph
- A graph made from some of the vertices and edges of another graph, in which every chosen edge keeps both of its end vertices.Taught in 3.14 Graph theory basics
- sum of square residuals
- , the total of the squared residuals of a model; for models fitted to the same data a smaller value means a closer fit, and means every point lies on the curve.Taught in 4.13 Non-linear regression and R²
- sum to infinity
- The value that the partial sums of an infinite geometric series get closer and closer to as grows; it exists only when the common ratio satisfies , and then .Taught in 1.11 Infinite geometric series
- system of linear equations
- Two or more linear equations in the same unknowns, solved together, where a solution makes every equation true at once; in IB AI exams a system has up to unknowns and always exactly one solution.Taught in 1.8 Solving equations with technology
- systematic sampling
- Choosing every th member of an ordered list of the population, where (rounded down if not whole) for a population of and a sample of , starting from a member picked at random among the first and stopping once there are . If doesn't divide , the last members of the list can never be picked.Taught in 4.1 Sampling, data quality and outliers
T
- t-distribution
- A symmetric, bell-shaped distribution with heavier tails than the standard normal, fixed by its degrees of freedom ( for one sample of size ); for the mean of a normal population it replaces the normal distribution whenever is unknown and estimated by , whatever the sample size.Taught in 4.16 Confidence intervals for the mean
- t-test
- A test about population means using the t-distribution; at SL it is the pooled two-sample t-test, for unpaired samples from normal populations with unknown but equal variances.Taught in 4.11 Chi-squared tests and the t-test
- table of least distances
- A table giving the weight of the shortest route, direct or not, between every pair of vertices; it turns a practical travelling salesman problem into the classical one on a complete graph.Taught in 3.16 Spanning trees, postman and salesman problems
- tangent
- The straight line that touches the curve at the point and has the curve's gradient there, so its equation is .Taught in 5.4 Tangents and normals
- test–retest reliability
- A reliability check in which the same group takes the same test at two different times; a strong positive correlation between the two sets of scores suggests the test is reliable.Taught in 4.12 Data collection, reliability and validity
- toxic waste dump problem
- Finding the point in a region whose distance to the nearest site is as large as possible; in IB exams the answer is always at a Voronoi vertex where three edges meet.Taught in 3.6 Voronoi diagrams
- trail
- A walk in which no edge is used more than once, although vertices may be repeated.Taught in 3.16 Spanning trees, postman and salesman problems
- trajectory
- The path a solution of a pair of coupled differential equations traces in the plane as increases.Taught in 5.17 Phase portraits for coupled equations
- transformation matrix
- A matrix that moves each point of the plane to its image (plus a translation vector if there is one), such as a stretch, an enlargement, a rotation about the origin or a reflection in a line through the origin; is its area scale factor.Taught in 3.9 Matrix transformations
- transition diagram
- A diagram of a Markov chain with one node per state and an arrow, labelled with its probability, for each possible one-step move (a loop for staying in the same state); the probabilities on the arrows leaving any one state add up to .Taught in 4.19 Transition matrices and Markov chains
- transition matrix
- A square matrix of the probabilities of moving between states in one step; in IB notation is the probability of moving from state to state , so each column adds up to .Taught in 3.15 Adjacency matrices and walks
- translation
- A move that slides every point of a graph the same distance in the same direction; the translation by the vector turns into , moving it units right and units up.Taught in 2.8 Transformations of graphs
- trapezoidal rule
- A way to estimate by splitting the interval into strips of equal width and treating each strip as a trapezoid, giving ; it overestimates when the curve is concave up across the whole interval and underestimates when it is concave down across the whole interval.Taught in 5.8 Trapezoidal rule
- travelling salesman problem
- Finding the Hamiltonian cycle of least total weight in a weighted complete graph; a practical problem is first turned into one with a table of least distances.Taught in 3.16 Spanning trees, postman and salesman problems
- tree
- A connected graph with no cycles; a tree with vertices has edges.Taught in 3.14 Graph theory basics
- tree diagram
- A diagram with one set of branches for each stage of an experiment, where the branches from each point add up to ; you multiply along a path and add across paths, and a later branch can carry a probability that depends on the earlier one.Taught in 4.6 Probability diagrams, rules and independence
- trigonometric ratios
- For an acute angle in a right-angled triangle, is opposite over hypotenuse, is adjacent over hypotenuse and is opposite over adjacent, and each depends only on .Taught in 3.2 Triangle trigonometry
- two-tailed test
- A test whose uses , such as , so the p-value counts results as extreme in both tails.Taught in 4.11 Chi-squared tests and the t-test
- Type I error
- Rejecting the null hypothesis when is actually true: a false alarm.Taught in 4.18 Further hypothesis tests and errors
- Type II error
- Not rejecting the null hypothesis when is actually false; its probability can only be found for a stated true value of the parameter.Taught in 4.18 Further hypothesis tests and errors
U
- unbiased estimate
- An estimate of a population parameter whose expected value over all random samples of the same size equals that parameter, such as for and (dividing by , not ) for .Taught in 4.14 Linear combinations and unbiased estimates
- union of events
- The event , read " or ": at least one of and happens, including when both happen.Taught in 4.6 Probability diagrams, rules and independence
- unit circle
- The circle of radius centred at the origin; the point on it at angle anticlockwise from the positive -axis is , which defines sine and cosine for any angle.Taught in 3.8 Unit-circle trigonometry and equations
- unit vector
- A vector of magnitude 1; the unit vector in the direction of a non-zero vector is , found by dividing every component by (normalising).Taught in 3.10 Vectors in 2D and 3D
- upper bound
- For a value rounded to the nearest , the rounded value plus , which the true value is strictly less than ( to d.p. has upper bound ); in graph theory, a value that the length of the shortest travelling salesman tour cannot be greater than.Taught in 1.6 Rounding, bounds and percentage error
V
- validity
- Whether a method measures what it claims to measure, so that its results and conclusions are accurate.Taught in 4.12 Data collection, reliability and validity
- variance
- The mean of the squared distances of the data values from the mean, equal to the square of the standard deviation; for a data set it divides by , the number of values.Taught in 4.3 Central tendency and dispersion
- variance of a random variable
- The expected squared distance of a random variable from its mean, , in squared units; for constants and , , so adding a constant does not change it.Taught in 4.14 Linear combinations and unbiased estimates
- vector
- A quantity with both a magnitude (size) and a direction, such as a displacement, velocity or force, printed in bold as or written , unlike a scalar, which has a magnitude only.Taught in 3.10 Vectors in 2D and 3D
- vector equation of a line
- An equation , , where is the position vector of one point on the line and is a direction vector of the line, so each value of gives the position vector of one point on it.Taught in 3.11 Vector equations of lines
- vector product
- The vector , where is the angle between and and is the unit vector perpendicular to both given by the right-hand screw rule (curl the fingers of your right hand from towards and your thumb points along ); its length is the area of the parallelogram with adjacent sides and , and .Taught in 3.13 Scalar and vector products
- velocity
- The rate of change of position, a vector that gives both how fast and in which direction an object moves; its magnitude is the speed, and in one dimension its sign gives the direction.Taught in 3.10 Vectors in 2D and 3D
- Venn diagram
- A picture of a sample space as a rectangle, with each event drawn as a circle inside it; where circles overlap, the outcomes belong to both events.Taught in 4.6 Probability diagrams, rules and independence
- vertex (graph theory)
- One of the points of a graph, also called a node, which edges join to other vertices.Taught in 3.14 Graph theory basics
- vertex (Voronoi diagram)
- A point where three or more edges meet; it is the same distance from the sites of all the cells that meet there, and no site is closer to it.Taught in 3.6 Voronoi diagrams
- vertex of a parabola
- The turning point of a parabola, which lies on its axis of symmetry: a minimum point when the parabola opens upwards ( in ) and a maximum point when it opens downwards ().Taught in 2.4 Key features of graphs
- vertical stretch
- For , the transformation from to , with scale factor : every -coordinate is multiplied by , every -coordinate stays the same, and the -axis is invariant.Taught in 2.8 Transformations of graphs
- volume of revolution
- The volume of the solid swept out when a region is rotated one full turn ( radians or ) about an axis: for the region between a curve and the -axis rotated about the -axis it is with -values as limits, and for the region between a curve and the -axis rotated about the -axis it is with -values as limits.Taught in 5.12 Areas and volumes of revolution
- Voronoi diagram
- A division of a region into cells, one for each site, where each cell holds the points that are closer to its site than to any other site.Taught in 3.6 Voronoi diagrams
W
- walk
- A sequence of edges in which each edge starts at the vertex where the previous edge ended; vertices and edges may be repeated, and the length of the walk is the number of edges it uses.Taught in 3.15 Adjacency matrices and walks
- weighted adjacency table
- A table with a row and a column for each vertex of a weighted graph, giving the weight (such as a cost, distance or time) of the direct edge from the row's vertex to the column's vertex, with a blank where there is no direct edge.Taught in 3.15 Adjacency matrices and walks
- weighted graph
- A graph with a number, called a weight, on each edge, standing for something such as a distance, time or cost.Taught in 3.14 Graph theory basics
- without replacement
- Choosing items one after another without putting each one back, so the total, and the probabilities for the next pick, change after every pick.Taught in 4.6 Probability diagrams, rules and independence
X
- x-intercept
- A point where a graph meets the -axis, crossing or just touching it, found by putting .Taught in 2.1 Straight-line equations
Y
- y-intercept
- The point where a graph meets the -axis, found by putting ; for the line it is .Taught in 2.1 Straight-line equations
Z
- zero of a function
- A value with : the -coordinate of a point where the graph of meets the -axis. The -intercept is a zero only if the graph passes through the origin.Taught in 1.8 Solving equations with technology
Χ
- χ² goodness of fit test
- A test of : observed frequencies fit a claimed distribution; with categories and no parameters estimated from the data it has degrees of freedom, uses the upper tail only and needs every expected frequency greater than .Taught in 4.11 Chi-squared tests and the t-test
- χ² test for independence
- A test of : two categorical variables are independent, using a contingency table; it uses the upper tail only and needs every expected frequency greater than .Taught in 4.11 Chi-squared tests and the t-test