Math 2.0

Latest

The newest and the changed ideas, the newest first. Follow them in a feed reader with the Atom feed.

This build has no history of changes, so the ideas are in the order of the graph.

Integers modulo n

The integers modulo nn form the ring ℤ/nℤ\mathbb{Z}/n\mathbb{Z} of the nn residue classes modulo nn, with the addition and the multiplication of representatives. The definition of the integers modulo n gives the precise form.

Circumcircle

The circumcircle of a triangle is the circle that passes through its three vertices. Each triangle has exactly one circumcircle. Its centre is the circumcentre and its radius is the circumradius.

Complete graph

Let nn be a natural number. The complete graph KnK_n is the graph with vertex set {1,…,n}\{1, \dots, n\} in which any two distinct vertices are adjacent.

Sum of a finite geometric progression

Let xx be a real number with x≠1x \neq 1, and let nn be a natural number. Then ∑k=0n−1xk=1+x+x2+⋯+xn−1=xn−1x−1.\sum_{k=0}^{n-1} x^k = 1 + x + x^2 + \dots + x^{n-1} = \frac{x^n - 1}{x - 1}.

Builds on Mathematical induction

Sample mean

The sample mean of a sample is the arithmetic mean of its values. It is the usual estimator of the mean of the population. The node sample mean gives the precise definition.

Oriented angle

An oriented angle in the plane measures the turn from one direction to another, with a sign. Anticlockwise turns are positive and clockwise turns are negative. It is defined modulo a full turn 2π2\pi, and it changes sign when you swap the two directions.

The Dirichlet function is not Riemann integrable

Let f ⁣:[0,1]→ℝf \colon [0, 1] \to \mathbb{R} be the Dirichlet function: f(x)=1f(x) = 1 for rational xx and f(x)=0f(x) = 0 for irrational xx. Each subinterval of positive length contains both rational and irrational numbers. So for each partition PP, U(f,P)=1U(f, P) = 1 and L(f,P)=0L(f, P) = 0. The upper Darboux integral is 11 and the lower one is 00. So ff is not Riemann integrable.

Builds on Dirichlet function, Upper and lower Darboux integrals, Darboux and Riemann integrals agree

C^1 vector fields satisfy the Picard–Lindelöf hypotheses

Let UU be an open subset of ℝn\mathbb{R}^n, let f:U→ℝnf : U \to \mathbb{R}^n be continuously differentiable, let x0∈Ux_0 \in U and let t0∈ℝt_0 \in \mathbb{R}. Then there are real numbers ε>0\varepsilon > 0, a>0a > 0 and L,K≥0L, K \ge 0 with these properties. The closed ball BB of radius aa around x0x_0 lies in UU. The time-independent field (t,x)↦f(x)(t, x) \mapsto f(x), extended in any way outside BB, satisfies the Picard–Lindelöf hypotheses at (t0,x0)(t_0, x_0) on [t0−ε,t0+ε][t_0 - \varepsilon, t_0 + \varepsilon] with constants a,L,Ka, L, K.

Builds on Picard–Lindelöf hypotheses, Lipschitz condition

Lattice path

A lattice path is a finite sequence of points of the integer lattice ℤ2\mathbb{Z}^2. Each step between consecutive points is from a given finite set of steps. The most common case uses the steps E=(1,0)E = (1, 0) and N=(0,1)N = (0, 1). These are North-East lattice paths.

Rational canonical form

Let FF be a field and let AA be an n×nn \times n matrix over FF. Then there are unique monic nonconstant polynomials f1,…,fr∈F[t]f_1, \dots, f_r \in F[t] with f1∣f2∣⋯∣frf_1 \mid f_2 \mid \cdots \mid f_r and the following property. The matrix AA is similar to the block diagonal matrix (C(f1)⋱C(fr)),\begin{pmatrix} C(f_1) & & \\ & \ddots & \\ & & C(f_r) \end{pmatrix}, where C(fi)C(f_i) is the companion matrix of fif_i. This block matrix is the rational canonical form of AA.

Builds on Companion matrix, Similar matrices, Block diagonal matrix

Uniform limits of holomorphic functions are holomorphic

Let U⊆ℂU \subseteq \mathbb{C} be an open set and let f1,f2,…f_1, f_2, \dots be functions U→ℂU \to \mathbb{C} that are holomorphic on UU. Let f:U→ℂf : U \to \mathbb{C} be a function such that fn→ff_n \to f uniformly on each compact subset of UU. Then ff is holomorphic on UU. Moreover, fn′→f′f_n' \to f' uniformly on each compact subset of UU.

Builds on Holomorphic function, Morera's theorem, Cauchy's integral theorem

Multilinear map

A multilinear map is a map of several vector variables that is linear in each variable when the other variables are fixed.

Diagonal matrix

A diagonal matrix is a square matrix whose entries outside the main diagonal are all zero.

Random variable with a density

A real random variable has a density when there is a fixed nonnegative function with this property. The probability of each set of values is the integral of the function over that set. The node random variable with a density gives the precise definition.

Closed curve

A closed curve is a parametrised curve on a closed interval whose end point is equal to its initial point. Its image can be seen as the image of a circle under a continuous map.

Builds on Parametrised curve

Homogeneous linear system with constant coefficients

A homogeneous linear system with constant coefficients is a system x′=Axx' = A x with a constant square matrix AA. Its solutions are given by the matrix exponential, and the eigenvalues of AA control their behaviour. See the definition.

Evaluation of real integrals by residues

The residue theorem gives the values of many definite integrals of real functions. For an integral ∫02πR(cos⁡θ,sin⁡θ) dθ\int_0^{2\pi} R(\cos \theta, \sin \theta) \, d\theta with RR a rational function of two variables, the substitution z=eiθz = e^{i\theta} changes it into a contour integral over the unit circle. This substitution uses cos⁡θ=12(z+z−1)\cos \theta = \frac{1}{2}(z + z^{-1}), sin⁡θ=12i(z−z−1)\sin \theta = \frac{1}{2i}(z - z^{-1}) and dθ=dzizd\theta = \frac{dz}{iz}. For an integral ∫−∞∞f(x) dx\int_{-\infty}^{\infty} f(x) \, dx, one closes the segment [−R,R][-R, R] with a semicircle of radius RR in the upper half-plane and lets R→∞R \to \infty. This method gives the integral when the integral over the semicircle tends to 00, for example by the estimation lemma or by Jordan's lemma.

Variance

The variance of a random variable is the expected squared distance between the variable and its mean. It measures how widely the values spread around the mean. The node variance gives the precise definition.

Jacobian matrix

Let U⊆ℝnU \subseteq \mathbb{R}^n be open. The Jacobian matrix of a map f ⁣:U→ℝmf \colon U \to \mathbb{R}^m at a point aa is the m×nm \times n matrix of all first partial derivatives ∂fi/∂xj\partial f_i / \partial x_j at aa. When ff is differentiable at aa, it is the matrix of the total derivative Df(a)Df(a) in the standard bases.

Builds on Partial derivative, Total derivative

Parseval's identity

Let VV be a finite-dimensional inner product space over ℝ\R or ℂ\C, and let (e1,…,en)(e_1, \dots, e_n) be an orthonormal basis of VV. Then, for all x,y∈Vx, y \in V, ⟨x,y⟩=∑i=1n⟨x,ei⟩⟨y,ei⟩‾and∥x∥2=∑i=1n∣⟨x,ei⟩∣2.\langle x, y \rangle = \sum_{i=1}^{n} \langle x, e_i \rangle \overline{\langle y, e_i \rangle} \qquad \text{and} \qquad \norm{x}^2 = \sum_{i=1}^{n} \abs{\langle x, e_i \rangle}^2.

Builds on Orthonormal basis, Norm induced by an inner product

Concyclic points

Points are concyclic when they all lie on one circle. A polygon with concyclic vertices is a cyclic polygon, and the circle is its circumcircle.

Open cover

An open cover of a subset of a topological space is a family of open sets whose union contains the subset. Open covers are used to define compactness.

Lagrange multiplier with one constraint

Let U⊆ℝnU \subseteq \mathbb{R}^n be open with n≥2n \ge 2, and let f,g ⁣:U→ℝf, g \colon U \to \mathbb{R} be of class C1C^1. Let c∈ℝc \in \mathbb{R}, and let aa be a point of the level set {x∈U:g(x)=c}\{x \in U : g(x) = c\} with ∇g(a)≠0\nabla g(a) \ne 0. If the restriction of ff to this level set has a local extremum at aa, then there is a unique λ∈ℝ\lambda \in \mathbb{R} with ∇f(a)=λ ∇g(a).\nabla f(a) = \lambda \, \nabla g(a).

Builds on Lagrange multipliers, Gradient, Level set, Gradient is orthogonal to level sets

Greedy colouring

Greedy colouring is a simple method that makes a colouring of a finite graph. Put the vertices in an order v1,v2,…,vnv_1, v_2, \dots, v_n, and use the colours 1,2,3,…1, 2, 3, \dots. For i=1,…,ni = 1, \dots, n, give viv_i the smallest colour that no earlier neighbour of viv_i has.

Möbius strip

Let ∼\sim be the equivalence relation on the square [0,1]×[0,1][0, 1] \times [0, 1] generated by (0,y)∼(1,1−y)(0, y) \sim (1, 1 - y) for all y∈[0,1]y \in [0, 1]. The quotient space [0,1]2/∼[0, 1]^2 / {\sim}, with the quotient topology, is the Möbius strip.

Builds on Quotient topology

Field

A field is a commutative ring in which you can divide by every nonzero element. The rational numbers, the real numbers and the complex numbers are fields. The definition of a field gives the axioms.

Real sequence

A real sequence assigns a real number to each natural number. Real sequences are the first setting for limits, convergence and series in real analysis. The node real sequence gives the precise definition.