Concepts
5,907Terms and methods explained by more than one lecturer. Each opens at the minute it is taught.
Mathematics
671The first 400 are shown. Search or choose a field to narrow the list.
- ConvolutionAn operation on two functions that produces a third function, representing the distribution of the sum of two independent random variables.
- FunctionAn assignment of a value to every element in the domain set .
- Matrix multiplicationComputed by taking dot products between rows of the first matrix and columns of the second matrix.
- VectorAn object that has both length (magnitude) and direction.
- Proof by contradictionA proof technique where one assumes the negation of the statement to be proven and derives a logical contradiction.
- VarianceThe variance of a random variable is the expected value of the square of the deviation from its mean.
- JacobianThe Jacobian of a change of variables is the determinant of the matrix of partial derivatives of the new coordinates with respect to the old coordinates.
- EventA subset of the sample space.
- Geometric seriesA series of the form where is a constant.
- NodeA place where at least two edges meet.
- DerivativeA derivative gives the rate of change or slope of a function at any given input point.
- Complex conjugateThe complex conjugate of a complex number is obtained by changing the sign of its imaginary part.
- Triangle inequalityThe absolute value of the sum of two real numbers is less than or equal to the sum of their absolute values.
- Integration by partsA technique for integrating products of functions based on the product rule for differentiation.
- Linear programmingOptimization problem with a linear objective function subject to linear inequality and equality constraints.
- Dot productAn operation on two vectors that yields a scalar, calculated as the sum of the products of their corresponding components or via their magnitudes and the cosine of the angle between them.
- RankThe rank of a matrix is the dimension of its column space, equal to the number of independent columns.
- Random variableA function from the sample space to the real numbers.
- Pigeonhole principleThe principle stating that if more than n items are put into n containers, then at least one container must contain more than one item.
- Vector fieldA field that assigns a vector to every point in space.
- Fixed pointPoints where the state derivative is zero, meaning the system does not change over time.
- EigenvalueA scalar lambda associated with a linear transformation (matrix Q) such that Q times the eigenvector equals lambda times the eigenvector.
- EigenvectorA non-zero vector that changes by a scalar factor when that linear transformation is applied to it.
- Critical pointA point where the derivative of a function is zero or undefined.
- Saddle pointA point on the surface of a function where the slopes in orthogonal directions are zero, with a maximum in some directions and a minimum in others.
- Singular value decompositionA factorization of a real matrix into a product of three matrices: an orthogonal matrix, a diagonal matrix of singular values, and the transpose of another orthogonal matrix.
- Completing the squareAn algebraic technique used to rewrite quadratic expressions into the square of a binomial plus a constant.
- Euler's formulaThe mathematical formula e^(iθ) = cos θ + i sin θ relating complex exponentials and trigonometric functions.
- RelationA relation on a set is any subset of the cartesian product .
- Complex numbersThe set of numbers of the form where and are real numbers and .
- GraphA mathematical structure consisting of a set of nodes (vertices) and a set of edges representing relationships between them.
- PartitionA partition of a set S is a collection of non-empty, disjoint subsets whose union is the entire set S.
- Convex functionA function for which the line segment connecting any two points on the graph lies above or on the graph.
- Spectral theoremThe theorem stating that a symmetric matrix can be factored into an orthogonal matrix of eigenvectors, a diagonal matrix of eigenvalues, and the transpose of the orthogonal matrix.
- SubspaceA subspace of a vector space is a subset of a vector space which is itself a vector space, meaning it is closed under vector addition and scalar multiplication.
- GradientA vector of all partial derivatives of a function, pointing in the direction of the greatest rate of increase of the function.
- Identity matrixA square matrix with ones on the main diagonal and zeros elsewhere that leaves any matrix unchanged when multiplied.
- Polar coordinatesA coordinate system in a plane where each point is determined by a distance from a reference point (radius r) and an angle from a reference direction (angle theta).
- StandardizationScaling a random variable by subtracting its mean and dividing by its standard deviation to have a mean of zero and variance of one.
- Binomial coefficientThe number of ways to choose k items from a set of n items, denoted as n choose k.
- Binomial theoremA formula for expanding a binomial raised to any power.
- Countable setA set is countable if it is finite or it has the same size as the natural numbers.
- Fourier seriesA representation of a periodic function as an infinite sum of sines and cosines.
- Hamming distanceHamming distance measures the number of positions at corresponding symbols are different between two strings of equal length.
- HysteresisThe phenomenon where a system does not return to its original unperturbed state after a rate constant perturbation is reversed.
- Inverse functionA function that reverses another function, such that if , then the inverse .
- Vandermonde matrixA matrix with terms of a geometric progression in each row, used here to represent the polynomial evaluation process.
- Cross productAn operation on two vectors in three-dimensional space that produces a vector.
- Prime numberA natural number greater than 1 is prime if its only divisors are 1 and itself.
- Vector additionAdding two vectors of the same dimension component-wise.
- Superposition principleA linear combination of solutions to a homogeneous linear differential equation is also a solution.
- Indicator random variableA random variable that takes value 1 if a given event occurs and 0 otherwise.
- Characteristic equationAn equation used to find the eigenvalues of a matrix.
- Injective functionAn injective function maps distinct elements of its domain to distinct elements of its codomain.
- Invertible matrixA square matrix that has a multiplicative inverse, equivalent to having a non-zero determinant.
- Power setThe power set of a set A is the set of all subsets of A.
- Surjective functionA function where every element in the codomain is mapped to by at least one element of the domain.
- Continuum hypothesisThe hypothesis that there is no set whose cardinality is strictly between that of the integers and the real numbers.
- CardinalityInformally, cardinality is a measure of the size of a set.
- Cartesian productA product of two sets formed by taking all ordered pairs of elements from each set.
- Central limit theoremA theorem stating that the sum of a large number of independent and identically distributed random variables is approximately normally distributed.
- DivergenceAn operation on a vector field that yields a scalar function defined as the sum of partial derivatives of its components.
- Mean value theoremA theorem stating that for a continuous function on a closed interval and differentiable on the open interval, there exists a point where the derivative equals the average rate of change.
- SetA collection of objects called elements or members.
- Chebyshev's inequalityAn inequality that bounds the probability that a random variable deviates from its mean by more than a certain amount using its variance.
- Equivalence classGiven an equivalence relation on a set S and an element x in S, the equivalence class of x is the subset of elements in S that are related to x.
- Equivalence relationAn equivalence relation on a set S is a relation on S x S that is reflexive, symmetric, and transitive.
- Generating functionA generating function is a formal power series whose coefficients encode a sequence of numbers.
- Linear approximationApproximating a complicated function using its tangent line or linear function based on its rate of change.
- Moment generating functionThe moment generating function of a random variable X is defined as the expectation of e to the power of bX.
- Convex setA set in which a line segment connecting any two points in the set is entirely contained within the set.
- Orthogonal complementThe subspace of all vectors orthogonal to every vector in a given subspace .
- Probability density functionA function whose integral over an interval gives the probability that the continuous random variable falls within that interval.
- TrajectoryA curve in the phase plane representing the solution of a differential system over time.
- Weak dualityThe principle that for any feasible solution to the primal problem and any feasible solution to the dual problem, the objective value of the dual is greater than or equal to that of the primal.
- AttractorA set of states toward which a dynamical system tends to evolve for a wide variety of starting conditions.
- BijectionA function that is both injective (one-to-one) and surjective (onto).
- Cantor setConstructed by starting with the closed interval and iteratively removing the open middle third of each remaining interval.
- Composition of functionsCombining two functions and such that the output of becomes the input of , written .
- CurlThe curl of a vector field is an operator that measures the rotation or angular circulation of the vector field at any given point.
- DomainThe set A on which a function f is defined.
- Information theoryA mathematical study of the quantification, storage, and communication of information.
- Lagrange multipliersA method for finding the local maxima and minima of a function subject to equality constraints.
- Linear combinationAn expression constructed by multiplying each term in a set of vectors by a constant and adding the results together.
- Linear transformationA transformation that preserves the operations of vector addition and scalar multiplication.
- Local maximumA point is a local maximum if there is a small neighborhood around it where the function's value is greater than at any nearby points.
- Mathematical inductionA proof technique used to establish that a statement is true for all natural numbers by showing a base case and an inductive step.
- MatrixA rectangular array of numbers.
- Navier-Stokes equationsNavier-Stokes equations describe fluid motion with internal viscosity or friction added to the Euler equations.
- Ordinary differential equationsAn equation involving an unknown function and its derivatives with respect to a single independent variable.
- Position vectorA vector that defines the position of a particle relative to an origin.
- Power seriesAn infinite series of the form .
- Scale invarianceA property where a function does not change when the scale or size of the system is uniformly scaled.
- Strong dualityIf the optimal value of the primal is finite, then the optimal value of the dual is also finite and they are equal.
- Telescoping sumA sum in which intermediate terms cancel out, leaving only the first and last terms.
- Velocity vectorThe velocity of a particle is the time derivative of its position vector.
- Limit cycleA closed trajectory in phase space to which neighboring trajectories converge or diverge.
- Implicit differentiationA technique used to find derivatives of implicitly defined functions by taking differentials of both sides of an equation.
- Trigonometric substitutionA technique for evaluating integrals by substituting a trigonometric function for a variable to simplify square root expressions.
- Convex optimizationOptimization of a convex objective function over a convex set, where any local minimum is a global minimum.
- Free variableVariables corresponding to columns without pivots in row-reduced echelon form, which can be assigned arbitrary values.
- Fundamental theorem of calculusIf you integrate the derivative of a function, you will get the difference between the values of the function at the endpoints.
- Green's theoremGreen's theorem relates a line integral around a simple closed curve to a double integral over the plane region bounded by the curve.
- MonadsA programming pattern that can be understood for the talk's purpose as chaining continuations together.
- Quadratic formA function that expresses the square of the distance as a sum of quadratic terms of the coordinate differentials.
- Symmetric matrixA square matrix that is equal to its transpose ().
- Uniform convergenceA sequence of functions converges uniformly on a set if for every , there exists an such that for all and all in the set, the distance between and is less than .
- Unit vectorA vector with a length of one that points in the direction of a given vector.
- Cumulative distribution functionThe function defined as the probability that a random variable is less than or equal to little .
- Directional derivativeThe rate of change of a function in any given direction vector.
- FunctorA mapping between categories that preserves the structure of objects and morphisms.
- Independence of random variablesRandom variables are independent if their joint CDF factorizes into the product of their individual marginal CDFs for all values.
- Intermediate value theoremA continuous function on a closed interval that takes on values of opposite signs at the endpoints must take on the value zero at some point in the interval.
- IsomorphismAn invertible function where composing the function with its inverse in both directions yields identity morphisms.
- Natural numbersA natural number is a member of the sequence 0, 1, 2, ... formed by starting from 0 and successively adding 1.
- NormA way to measure the size of a vector, a matrix, a tensor, or a function.
- Orthonormal basisA basis of a vector space consisting of mutually orthogonal vectors of unit length.
- Partial derivativeThe derivative of a multivariable function with respect to one variable while holding all other variables constant.
- Rank of a matrixThe dimension of the column space of the matrix, which equals the number of non-zero rows in its row echelon form.
- SubsetA set is a subset of if every element of is also an element of .
- TransitivityTransitivity states that if and , then .
- Absorbing stateA state that, once entered, cannot be left.
- Carrying capacityThe population density level denoted as K where population growth is zero and recruitment drops to zero.
- Catalan numbersA mathematical sequence representing the number of possible join orderings for an n-way join in relational databases.
- Characteristic polynomialThe polynomial whose roots are the eigenvalues of the matrix A.
- CycloidThe curve traced by a point on the rim of a circle rolling along a straight line.
- DeterminantA number associated with a square matrix that indicates whether the matrix is invertible.
- Double integralThe double integral of a function over a region in the plane is defined by summing the values of the function everywhere in the region times the area element.
- ImageThe set of all values in the codomain that are mapped to by elements in a given subset of the domain.
- Inclusion-exclusion principleA counting technique used to compute the measure of the union of multiple sets by adding individual measures and subtracting intersections.
- Integrating factorA function multiplied through a differential equation to make the left-hand side an exact derivative, facilitating integration.
- InterpolationA method of constructing new data points within the range of a discrete set of known data points using polynomials.
- Left inverseA matrix is a left inverse of if equals the identity matrix.
- Limit of a functionThe value a function approaches as its input approaches a specific point.
- Line integralAn integral of a vector field along a curve.
- Linear systemA system of differential equations is linear if all state variables on the right-hand side appear only to the first power without products, powers, or nonlinear functions.
- Normal equationsThe system of linear equations Aᵀ A x⃗ = Aᵀ b⃗ whose solutions are the least squares solutions to .
- Orthogonality of eigenvectorsEigenvectors of a symmetric matrix corresponding to distinct eigenvalues are orthogonal to each other.
- Particular solutionA particular solution is a specific solution to the inhomogeneous differential equation .
- Polar form of a complex numberA complex number represented in terms of its modulus and argument as .
- Quotient ruleThe derivative of a quotient of two functions is given by the derivative of the numerator times the denominator minus the numerator times the derivative of the denominator, all divided by the denominator squared.
- Radius of convergenceThe radius within which a power series converges absolutely.
- Simply connected regionA connected region in the plane is simply connected if any closed curve in it has its interior also contained in the region, meaning it has no holes.
- Substitution ruleA method of evaluating an application by evaluating the operator and operands, applying the procedure to the arguments, copying the body with substituted arguments, and evaluating the new body.
- Tangent lineA tangent line to a curve at a point is approximated by the secant line passing through that point and a nearby point as the second point approaches the first.
- TilingAn optimization technique that breaks down a large matrix multiplication into smaller submatrix multiplications to improve cache performance.
- TraceThe sum of the diagonal entries of a square matrix.
- Absolute convergenceA series converges absolutely if the series formed by taking the absolute value of each of its terms converges.
- Acceleration vectorThe derivative of the velocity vector with respect to time.
- Adjacency matrixA square matrix used to represent a finite graph, where the element at row i and column j is 1 if there is an edge between vertices i and j, and 0 otherwise.
- Automatic differentiationA set of techniques to numerically evaluate the derivative of a function specified by a computer program.
- Bernoulli equationA non-linear differential equation of a specific form that can be transformed into a linear equation via substitution.
- Bipartite graphA graph whose vertices can be divided into two disjoint sets such that every edge connects a vertex in one set to one in the other.
- Canonical formA standard form for a Boolean expression that provides a unique algebraic signature.
- Change of variablesA transformation of variables, such as defining , to simplify the differential equation and its analysis.
- Channel capacityThe maximum rate at which information can be transmitted reliably over a noisy channel, given by for a binary symmetric channel.
- CofactorsA way of breaking up the big formula of an determinant into determinants of order one smaller.
- Constant of integrationA constant added to an indefinite integral to represent the non-uniqueness of antiderivatives.
- Degree of a nodeThe number of edges that are incident to a node in a graph.
- Differential calculusA branch of calculus that includes functions, derivatives, second derivatives, and taking derivatives of elementary functions.
- Dirac delta functionA generalized function that is zero everywhere except at the origin where it is infinitely high, with an integral of one.
- Elliptic curveA smooth, projective, algebraic curve of genus one, given by an equation of the form .
- Function compositionCombining two functions together where the output of the first function serves as the input to the second function to create a new function.
- Gambler's ruinA mathematical model describing the probability that a gambler with a finite amount of money will eventually lose all of it when playing a series of bets.
- Inverse matrixA square matrix P is the inverse of Q if multiplying them together in either order yields the identity matrix I.
- KnotA closed loop embedded in three-dimensional space that cannot be untied without cutting.
- Mapping torusA construction that forms a fiber bundle over the circle by taking a product of a space with an interval and identifying the ends via a homeomorphism.
- Matrix inverseThe inverse of a matrix A, denoted , is a matrix that when multiplied by A yields the identity matrix.
- Multiplicative inverseAn element whose product with a given element equals the multiplicative neutral element one modulo m.
- OrbitThe time series of states generated by an iterated map.
- OrthogonalityThe inner product of two distinct quantum states being zero.
- ProbabilityThe chance of an event occurring, interpreted here as the ratio of the area of a subregion to the total area of the region.
- Riemann hypothesisZeros in an infinite series of numbers known as a zeta function form along a straight line in the complex plane.
- RotationThe movement around the long axis of a body region or an organ.
- Scalar multiplicationAn operation multiplying a vector by a scalar by multiplying each component of the vector by that scalar.
- Second derivative testA test using the second derivative at a critical point to determine whether it is a local maximum or minimum.
- Self-similarityA property where a set contains arbitrarily small copies of itself at different scales.
- Slack variableA new variable introduced to turn an inequality constraint into an equality constraint while maintaining equivalence.
- TopologyAbout shapes, arrangements of shapes, functions between shapes, and deformations of shapes.
- Total orderA partial order in which all pairs of elements are comparable.
- Orthogonal matrixA square matrix whose columns and rows are orthonormal vectors.
- Column spaceThe column space of a matrix is the subspace spanned by its column vectors, formed by taking all possible linear combinations of the columns.
- Condition numberThe ratio of the largest to the smallest singular value of a matrix, indicating how sensitive the solution of is to errors.
- Stokes' theoremA theorem relating a surface integral of the curl of a vector field to a line integral of the vector field over the boundary of the surface.
- Bijective functionA function is bijective if it is both injective and surjective.
- Conditional expectationThe expectation of a random variable computed using conditional probabilities instead of unconditional probabilities.
- Divergence theoremA theorem relating the flux of a vector field through a closed surface to the volume integral of the divergence over the region inside.
- Frobenius normA matrix norm defined as the square root of the sum of the absolute squares of its elements, treating the matrix as a vector.
- Line integral of a vector fieldThe work done by a force field along a curve, computed as the integral of the dot product between the force vector and the differential displacement vector along the curve.
- Positive semidefinite matrixA symmetric matrix Y is positive semidefinite if for any real vector c, c transpose times Y times c is non-negative.
- Quadratic programmingOptimization problem with a quadratic objective function subject to linear constraints.
- Strange attractorAn attractor that exhibits sensitive dependence on initial conditions and a complex, often fractal structure in phase space.
- Strong inductionA form of mathematical induction where the inductive step assumes the statement is true for all values up to n, rather than just for n.
- Augmented matrixA matrix representation of a linear system that includes the coefficients and the constants.
- DifferentialAn entire different object representing the linear function whose graph is the tangent line or plane.
- Fundamental matrixA square matrix whose columns are linearly independent solutions to a homogeneous system of linear differential equations.
- ImplicationA logical statement that is true in every case except when the premise is true and the conclusion is false.
- Iterated integralEvaluated by taking slices of a region to convert a multi-variable integral into sequential single-variable integrals.
- Logistic mapA polynomial mapping of degree 2 often cited as an archetypal example of how complex, chaotic behaviour can arise from very simple non-linear dynamical equations.
- Moment of inertiaThe quantity I that plays the role of mass in rotational kinetic energy, defined as the sum of mass times the square of the distance of each particle from the axis of rotation.
- MonoidAn algebraic structure that has an associative binary operation and an identity element.
- Orthogonal projectionThe projection of a vector onto a subspace spanned by orthonormal basis vectors.
- Positive semi-definite matrixA symmetric matrix whose eigenvalues are all greater than or equal to zero.
- Sample spaceThe set of all possible outcomes of an experiment.
- SubsequenceA sequence derived from another sequence by deleting some elements without changing the order of the remaining elements.
- Arc lengthThe distance along a curve or roadway between specified points, parameterized as S.
- Change of variables in double integralsA method to transform a double integral from -coordinates to -coordinates using the Jacobian determinant and coordinate substitution.
- Comparison testA test for the convergence of a series by comparing its terms to the terms of a known convergent or divergent series.
- Complement of a setThe set of all elements in the universal set that are not in the given set.
- Configuration spaceThe logical space of all possible states or configurations a system can occupy.
- Continuous functionA function is continuous if close enough points in the domain map to close points in the codomain, or equivalently if the inverse image of any open set is open.
- Denotational semanticsAn approach to semantics where programs are translated into mathematical objects.
- Diagonalizable matrixA square matrix A is diagonalizable if it is similar to a diagonal matrix.
- Disjoint setsTwo sets are disjoint if their intersection is empty.
- Eigenvalues of symmetric matricesThe eigenvalues of a real symmetric matrix are always real numbers.
- Even functionA function that satisfies f(-x) = f(x).
- FluxThe rate of flow of a property through a surface, representing field lines passing through an area.
- IntegerThe set of numbers denoted by consisting of zero, the positive integers, and the negative integers.
- Least squaresA method to find the best approximate solution to an unsolvable system of linear equations by minimizing the sum of squared errors.
- OrderingA relation that allows comparing two numbers to determine if one is less than or equal to the other.
- Orthogonal vectorsTwo vectors in Rn are orthogonal provided their dot product is zero.
- Partial fractionsA method for breaking up rational functions into simpler fractions that can always be integrated.
- Path independenceA property where a line integral depends only on the endpoints of the curve and not on the specific path taken between them.
- Pointwise convergenceA sequence of functions converges pointwise to a function if for every fixed input in the domain, the sequence of function values converges to the function value.
- Probability mass functionA function that gives the probability that a discrete random variable is exactly equal to some value.
- Proper subsetA is a proper subset of B if A is a subset of B and A does not equal B.
- Pure functionA function that is total and always returns the same output for the same input without side effects.
- Reflexive relationA relation R on A is reflexive if every element is related to itself.
- Singular valuesThe singular values of a matrix are the square roots of the eigenvalues of .
- Stirling's approximationAn approximation for factorials used to find the asymptotically dominating term of .
- Symmetric relationA relation is symmetric if whenever is related to , then is related to .
- Taylor's theoremApproximation of a function as a polynomial expanded around a point using its derivatives.
- Velocity fieldA vector field assigning a velocity vector to every position in the phase space based on the phase point's motion.
- Weighted averageCalculated by taking the integral from a to b of a function multiplied by a weighting function, divided by the integral of the weighting function over the same interval.
- Well-ordering principleEvery non-empty subset of the natural numbers has a least element.
- Analytic geometryThe marriage of algebra with geometry introduced by René Descartes.
- Antisymmetric relationA relation R is antisymmetric if whenever x is related to y and y is related to x, then x equals y.
- Area element in polar coordinatesThe infinitesimal area element in polar coordinates given approximately by .
- Arithmetic progressionA sequence of numbers which are equally spaced, where every number has the same spacing from the previous one.
- BeatsThe result of combining two pure oscillations with frequencies very close to each other, producing a curve whose envelope oscillates at a slow rate.
- Birthday problemThe problem of finding the probability that in a group of k people, at least two share the same birthday.
- BitA logical concept representing one of two states, zero or one.
- Cantor's theoremThe theorem that there is no bijection between a set and its power set, meaning the power set has a strictly larger cardinality.
- Cauchy-Schwarz inequalityAn inequality that bounds the absolute value of the inner product of two vectors by the product of their lengths.
- ClustersDividing the universe of size u into smaller chunks to speed up search operations.
- Commuting matricesMatrices A and B commute if their product is equal regardless of order, i.e., AB = BA.
- ConditioningThe soul of statistics, including conditional probability, conditional expectation, Bayes rule, and conditional independence.
- CoordinatesThe unique coefficients needed to express a vector as a linear combination of a given set of basis vectors.
- De Morgan's lawsRules relating the complement of a union or intersection to the intersection or union of the complements.
- Differentiability implies continuityIf a function is differentiable at a point, then it must also be continuous at that point.
- Dimensionless variablesVariables transformed to be pure numbers without any physical units attached to them.
- Equilibrium pointA point in the phase plane where the derivatives of all state variables are simultaneously zero.
- Exponential functionA function defined by the power series with coefficients 1 over j factorial centered at 0.
- Faraday's lawFaraday's law states that the curl of the electric field is equal to the negative time derivative of the magnetic field.
- Finite setA subset of a finite set defined via a boolean function is also a finite set.
- Flux integralThe double integral over a surface of the dot product of a vector field with the unit normal vector and the surface area element.
- Gödel's incompleteness theoremFormal theorems stating that any consistent formal system capable of elementary arithmetic contains statements that cannot be proven or disproven within the system.
- Gradient vectorA vector whose components are the partial derivatives of a function, pointing in the direction of the greatest rate of increase.
- HomogenizationThe limiting behavior of the sequence of functions as they converge to zero on smaller and smaller scales.
- Identity elementA group element that leaves any other element unchanged when the binary operation is applied.
- Improper integralA definite integral where the interval of integration is infinite or the integrand is unbounded.
- Intersection of setsThe intersection of A and B is the set of all elements that are in both A and B.
- IntervalIntervals are subsets of the real numbers defined between two real number endpoints or bounds.
- LassoA regression analysis method that performs both variable selection and regularization to enhance prediction accuracy.
- Least upper boundAn upper bound that is less than or equal to all other upper bounds of the subset.
- Least-squares regressionA historical precursor to machine learning where unknown coefficients x are found by minimizing the sum of squared errors over data.
- Linear independenceVectors are linearly independent if no combination of them gives the zero vector except the zero combination where all coefficients are zero.
- LinkAn operation that adds an edge between a node v and a node w in the represented tree, assuming v is a root.
- Local minimumA point where the function value is smaller than at all neighboring points, but not necessarily the smallest overall.
- Logistic equationA model of population growth where the per capita rate of increase declines linearly with density until it reaches zero at carrying capacity K.
- Matrix productA way of multiplying matrices where entries are obtained by taking dot products of the rows of the first matrix and the columns of the second.
- NegationAn operation that takes a type and traverses all its pairs, negating their boolean values.
- OrbifoldsA generalization of a manifold that allows for certain types of singularities.
- Partial applicationA way to function to passing only some arguments to a function, returning a new function that can be called with the rest.
- Partial sumThe sum of the first n terms of a sequence.
- Periodic orbitTrajectories of a dynamical system that return to their starting point after a certain time.
- PeriodicityThe property of a function or phenomenon to repeat its values in regular intervals or periods, closely associated with symmetry.
- Poincare conjectureThe conjecture that every closed, simply connected three-dimensional manifold is homeomorphic to the three-sphere.
- Posterior distributionThe updated probability distribution of a parameter after observing evidence using Bayes' rule.
- Posterior probabilityCalculating the probability of a query variable given a set of evidence variables.
- Pythagorean theoremA fundamental relation in Euclidean geometry among the three sides of a right triangle.
- Ratio testA test for series convergence formed by taking the limit of the ratio of consecutive terms, .
- Rational numbersNumbers that can be expressed as a quotient of two integers where the denominator is non-zero.
- Reduction formulaA recursive formula that expresses an integral with a power in terms of integrals with lower powers like or .
- RefractionThe bending of light as it travels through a medium or near an axis where it travels more slowly.
- Riemann integralA rigorous definition of the integral of a function using partitions and Riemann sums.
- Second partial derivativesDerivatives obtained by differentiating a function of multiple variables twice with respect to the same or different variables.
- Sum ruleA rule stating that a marginal probability is obtained by summing the joint probability over all values of the other variable.
- Union of setsThe union of two sets is the set of all elements that are in either the first set or the second set.
- Unit tangent vectorA vector of constant magnitude one that is tangent to a curve and shifts with position as you move along the curve.
- Upper boundAn element that is greater than or equal to every element in a given subset.
- Upper triangular matrixA square matrix in which all the entries below the main diagonal are zero.
- Variational problemA problem in which you want to maximize or minimize something where you don't know where the maximum is.
- Weierstrass functionAn example of a real-valued function that is continuous everywhere but differentiable nowhere.
- Weight functionA positive function W(x) used inside the integral to define the inner product on a space of functions.
- Well-ordering propertyEvery non-empty subset of the natural numbers has a least (or smallest) element.
- Law of total probabilityA rule that expresses the total probability of an outcome by summing conditional probabilities over a partition of the sample space.
- Level curvesSets of points where a function takes the same constant value.
- Positive definite matrixA symmetric matrix whose eigenvalues are all positive.
- Projection matrixA matrix P = A(Aᵀ A)⁻¹ Aᵀ that projects vectors onto the column space of A.
- Bolzano-Weierstrass theoremEvery bounded sequence has a convergent subsequence.
- Compact setA set is compact if every open cover of the set contains a finite subcover.
- Conservative vector fieldA vector field which is the gradient of a function.
- ForcingA method used in set theory to prove consistency and independence results by extending models of set theory using Boolean-valued models or generic filters.
- Law of the unconscious StatisticianA theorem used to calculate the expected value of a function of a random variable without needing to find the distribution of that function first.
- Limit pointA point P in a metric space X is a limit point of a set E if every neighborhood of P contains a point q in E where q is not P.
- QR factorizationA matrix factorization that decomposes a matrix into an orthogonal matrix Q and an upper triangular matrix R.
- Reduced row echelon formA matrix form with leading ones in every non-zero row and zeros above and below each leading entry.
- Similar matricesTwo square matrices A and B are similar if there exists an invertible matrix S such that .
- Archimedean propertyA property of the real numbers stating that given any positive real number, there exists a natural number whose reciprocal is smaller than it.
- Bounded sequenceA sequence is bounded if there exists some number B such that the absolute value of every element in the sequence is less than or equal to B.
- Cauchy sequenceA sequence whose elements become arbitrarily close to each other as the sequence progresses.
- ContinuityA function is continuous if for every point in its domain and every positive epsilon, there exists a delta such that all points within delta of the point map to values within epsilon of the point's image.
- Dual linear programA companion linear program derived from a primal LP that provides bounds and complementary interpretations.
- Empty setThe set that contains no elements.
- Fractal dimensionA simplification of Hausdorf dimension used to quantify roughness of self-similar shapes.
- Fundamental theorem for line integralsThe line integral of a conservative vector field can be evaluated as the difference of the potential function evaluated at the curve's endpoints.
- Hyperbolic geometryA non-Euclidean geometry with constant negative curvature.
- Indefinite integralThe traditional notation representing the set of all functions whose derivative is a given function .
- Initial value problemA differential equation together with a specified value of the unknown function at a given point.
- L1 normThe sum of the absolute values of the components of a vector.
- Nuclear normThe sum of the singular values of a matrix.
- NullclineCurves in the phase plane where one of the state variables has a time derivative equal to zero.
- Ordered fieldA field equipped with a compatible order relation where addition and multiplication play nicely with the order.
- Rank-nullity theoremA theorem stating that the sum of the dimensions of the kernel and the image of a matrix equals the number of columns of that matrix.
- Row spaceThe row space of a matrix is all combinations of its rows.
- Algebraic multiplicityThe number of times an eigenvalue appears as a root of the characteristic polynomial.
- AM-GM inequalityAn inequality stating that the geometric mean of a set of non-negative real numbers is less than or equal to their arithmetic mean.
- Autonomous systemA system of differential equations in which the independent variable (like time t) does not appear explicitly on the right-hand side.
- Back propagationAn algorithm used to compute the gradient of the loss function with respect to the model parameters for each training example.
- Binomial distributionA probability distribution representing the number of successes in n independent Bernoulli trials.
- CategoryA structure consisting of objects and arrows that can be composed and include identity arrows.
- Ceiling functionA function that maps a real number to the least integer larger than or equal to that number.
- ChaosAperiodic long-term behavior in a deterministic system that exhibits sensitive dependence on initial conditions.
- Closed orbitA trajectory in a dynamical system that is periodic, repeating its state over and over.
- Closed setA set E is closed if E contains all its limit points.
- ConcavityA curve is concave up when its second derivative is positive and concave down when its second derivative is negative.
- Cumulative hierarchyThe iterative conception of the set-theoretic universe built up in stages from sets formed out of previously existing elements.
- Diagonal matrixA square matrix in which all entries outside the main diagonal are zero.
- Difference equationAn equation defining a sequence recursively, such as .
- DifferentiabilityA function is differentiable at a point if the limit of its difference quotient exists at that point.
- Direct proofA method of proof that starts from the hypothesis and uses logical steps to arrive at the conclusion.
- Direction fieldA graphical representation of the solutions of a first-order ordinary differential equation in the form of line segments with slopes given by the differential equation at various points.
- Dissipative systemA system where areas or volumes contract under the mapping over time.
- Exact differentialA differential form that is equal to the total differential of some scalar function under the same conditions.
- Exact line searchA line search method that chooses the step size to minimize the objective function along the search direction.
- Existence and uniqueness theoremA theorem stating that a first-order differential equation has one and only one solution passing through a given point, provided certain continuity conditions are met.
- Functional equationAn equation where the unknown is a function, and the equation relates the function to its own iterates or scaled versions.
- Fundamental theorem of algebraAny complex polynomial of degree n has exactly n roots counted with multiplicity.
- General solutionA solution containing arbitrary constants whose number equals the order of the differential equation.
- Geometric multiplicityThe dimension of the eigenspace corresponding to an eigenvalue.
- Gram-Schmidt processA calculation process that takes independent vectors and produces orthonormal vectors.
- Hadamard matrixA square matrix whose entries are +1 or -1 and whose columns are orthogonal.
- Hamming codeAn early linear error-correcting code capable of detecting up to two-bit errors and correcting single-bit errors.
- HessianThe square matrix of second-order partial derivatives of a scalar-valued function.
- Hyperbolic functionsFunctions defined analogously to circular functions using a hyperbola instead of a circle.
- Identity functionThe identity function on a set is a map from the set to itself that leaves every element unchanged.
- Instantaneous speedThe speed of an object at a specific instant in time at a specific point.
- Invertible functionA function from X to Y is invertible if for each y in the codomain there is exactly one x in the domain with f(x)=y.
- IsoclineA curve along which the slope of the direction field of a differential equation is constant.
- Kirchhoff's voltage lawKirchhoff's voltage law states that the sum of the voltage drops as you move around a circuit has to be zero.
- Least upper bound propertyAn ordered set S has the least upper bound property if every nonempty subset of S that is bounded above has a supremum in S.
- Level surfaceA surface formed by all points (x, y, z) that share the same function value k for a given function of three variables.
- Logical implicationThe statement P implies Q, meaning if P is true then Q is also true.
- Matrix representation of a linear transformationA linear transformation can be represented as a matrix whose columns are applied to the standard basis vectors.
- Mean time to failureThe expected number of steps before a system fails, computed using the tail sum formula under mutually independent failure probabilities.
- Method of exhaustionAn ancient Greek method for finding areas by inscribing and circumscribing regions with rectangles and taking limits.
- Normal vector to a planeA vector that is perpendicular to a given plane.
- Odd functionA function where for all , whose graph is symmetric with respect to the origin.
- Orientation of a surfaceAn orientation of a surface specifies a consistent choice of unit normal vector field across the surface, giving two possible orientations that differ by a sign.
- Orthonormal vectorsVectors that are mutually orthogonal to each other and each have a unit length of one.
- Parametric polymorphismParametric polymorphism in Haskell means defining a function using a single formula for all types.
- Partial sumsThe sum of a finite prefix of a sequence of terms.
- Pascal's triangleA triangular array where each row corresponds to a value of and entries are binomial coefficients.
- Perfect setA closed set with no isolated points.
- Period doublingA phenomenon where the period of a stable cycle doubles as a parameter is increased.
- Phase lagThe phase angle phi that describes the shift or delay of a sinusoidal response function relative to the input.
- Poincaré-Bendixson theoremA theorem stating that if a two-dimensional dynamical system has a bounded trapping region, then every trajectory in that region either approaches a fixed point, a limit cycle, or a heteroclinic/homoclinic network.
- Polar representation of complex numbersExpressing a complex number in terms of its magnitude and angle as r(cos θ + i sin θ).
- Product typeAn algebraic type formed by multiplying or combining two types together, such as a person and a date.
- Quadratic approximationAn approximation that includes both linear and second-order terms to model functions when linear approximations are insufficient.
- Rayleigh quotientA scalar value calculated for a vector x and a matrix S as the ratio of the quadratic form to the squared norm of the vector.
- Real numbersThe number system containing rational numbers and irrationals like pi and square root of two.
- Related ratesFinding the rate at which a quantity changes by relating it to other quantities whose rates of change are known.
- Repeated eigenvaluesAn eigenvalue with an algebraic multiplicity greater than one, which can lead to a shortage of independent eigenvectors.
- Rotating reference frameA coordinate system that rotates with respect to an inertial frame, used to simplify time-dependent problems in spin dynamics.
- Row operationsOperations such as swapping rows, multiplying a row by a non-zero scalar, or adding a multiple of one row to another.
- Set differenceThe set of all elements that are in a first set but not in a second set.
- Singular matrixA matrix that does not have an inverse, meaning its determinant is zero.
- Spherical coordinatesCoordinate system in space defined by distance from the origin rho, angle down from z-axis phi, and angle around z-axis theta.
- Stable fixed pointA fixed point where nearby trajectories converge to it as time approaches infinity.
- Strictly convex functionA convex function where every line segment connecting two points on its graph lies strictly above the function.
- Sum typeA data structure that can hold one of several different types of values at a time, often implemented as tagged unions.
- Surface integralThe integral of a vector field across a membrane or surface, representing the flux through the surface.
- Tangent planeA plane determined by two tangent lines on the surface of a graph at a given point that approximates the surface locally.
- Total differentialAn expression for the total differential of a dependent variable in terms of differentials of independent variables and their partial derivatives.
- Transitive relationA relation R is transitive if whenever x is related to y and y is related to z, then x is related to z.
- Transpose of a matrixA new matrix formed by swapping the rows and columns of a given matrix.
- Triple integralsAn integral of a function of three variables over a region in space, representing the accumulation of a quantity throughout a solid volume.
- Uniform continuityA property of a function where the delta in the definition of continuity depends only on epsilon, not on the point C.