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.

Zero of a holomorphic function

A zero of a holomorphic function ff is a point z0z_0 with f(z0)=0f(z_0) = 0, see the definition. The zeros of a holomorphic function that is not identically zero on a domain are isolated, and each has a finite order.

Direct product of groups

The direct product of two groups GG and HH is the set G×HG \times H of ordered pairs, with the operation done in each component separately. It is the simplest way to build a new group from two given groups.

Conic section

A conic section is a curve that a plane cuts from the surface of a double cone. In the plane, it is the set of zeros of a polynomial of degree 22 in two variables. The non-degenerate conics are the ellipses, the parabolas and the hyperbolas.

Lower triangular matrix

A lower triangular matrix is a square matrix whose entries above the main diagonal are all zero.

Divisibility rule

A divisibility rule is a short method to decide whether a fixed integer dd divides an integer nn. It uses the digits of nn, and it does not need a full division. Most rules for base 1010 come from the congruences of the powers 10k10^k modulo dd. For example, 10≡1(mod3)10 \equiv 1 \pmod 3, so nn and the sum of its digits have the same remainder modulo 33.

Non-uniqueness for a non-Lipschitz equation

For a real number xx, let x1/3x^{1/3} be its real cube root and let x2/3=(x1/3)2x^{2/3} = \left(x^{1/3}\right)^2. Consider the initial value problem x′(t)=3 x(t)2/3x'(t) = 3\, x(t)^{2/3}, x(0)=0x(0) = 0, on ℝ\mathbb{R}. The constant function x(t)=0x(t) = 0 is a solution. The function x(t)=t3x(t) = t^3 is also a solution, because its derivative is 3t2=3(t3)2/33t^2 = 3 \left(t^3\right)^{2/3}. More generally, for each c≥0c \ge 0, the function equal to 00 for t<ct < c and to (t−c)3(t - c)^3 for t≥ct \ge c is a solution. So the problem has infinitely many solutions on every interval that contains 00 in its interior.

Builds on Picard–Lindelöf theorem, Lipschitz condition, Initial value problem, Peano existence theorem

Intermediate value theorem

Let a<ba < b and let f ⁣:[a,b]→ℝf \colon [a, b] \to \mathbb{R} be continuous. Let yy be a real number between f(a)f(a) and f(b)f(b). Then there is c∈[a,b]c \in [a, b] with f(c)=yf(c) = y.

Builds on Continuous function

Determinant

The determinant is the unique function of square matrices that is multilinear and alternating in the rows and is 11 on the identity matrix. It is zero exactly for the singular matrices, over a field.

Prime ideal

A prime ideal of a commutative ring is a proper ideal with the following property. If it contains a product, then it contains one of the factors. The prime ideals of ℤ\mathbb{Z} are the ideals pℤp\mathbb{Z} for pp prime and the zero ideal. The definition of a prime ideal gives the conditions.

Independent and identically distributed random variables

A family of random variables is independent and identically distributed (i.i.d.) when the variables are mutually independent and all have the same distribution. It is the standard model of repeated trials of one experiment. The node i.i.d. random variables gives the precise definition.

Change of variables in multiple integrals

Let U⊆ℝnU \subseteq \mathbb{R}^n be open, and let φ ⁣:U→ℝn\varphi \colon U \to \mathbb{R}^n be injective and of class C^1 with det⁡Dφ(u)≠0\det D\varphi(u) \ne 0 for each u∈Uu \in U. Let f ⁣:φ(U)→ℝf \colon \varphi(U) \to \mathbb{R} be continuous with compact support in φ(U)\varphi(U). Then ∫φ(U)f(v) dv=∫Uf(φ(u)) ∣det⁡Dφ(u)∣ du.\int_{\varphi(U)} f(v) \, dv = \int_U f(\varphi(u)) \, \lvert \det D\varphi(u) \rvert \, du.

Builds on Jacobian determinant, Diffeomorphism, C^k function characterised by continuous derivatives, Double integral

Prior probability

A prior probability is the probability that we give to a hypothesis before we see the data. More generally, a prior distribution is the distribution that we give to an unknown quantity before we see the data. In Bayes' theorem the prior is combined with the likelihood of the data, and the result is the posterior probability.

Builds on Bayes' theorem

Complex sine and cosine

The complex sine and cosine extend the real sine and cosine to all of ℂ\mathbb{C} with the formulas sin⁡z=(eiz−e−iz)/(2i)\sin z = (e^{iz} - e^{-iz})/(2i) and cos⁡z=(eiz+e−iz)/2\cos z = (e^{iz} + e^{-iz})/2, see the definition. They are entire functions, and they are not bounded on ℂ\mathbb{C}.

Gram matrix

The Gram matrix of a finite family of vectors in an inner product space is the square matrix of all their pairwise inner products.

Exponential growth and decay

Let kk and y0y_0 be real numbers. The initial value problem y′(t)=k y(t)y'(t) = k\, y(t), y(0)=y0y(0) = y_0 has the unique solution y(t)=y0 ekt,t∈ℝ.y(t) = y_0\, e^{k t}, \qquad t \in \mathbb{R}. If k>0k > 0 and y0>0y_0 > 0, the solution grows: this is exponential growth. If k<0k < 0 and y0>0y_0 > 0, the solution decreases to 00: this is exponential decay.

Builds on Initial value problem

Little o notation

Little o notation says that one function is negligible compared with another. The statement f=o(g)f = o(g) means that f/gf/g tends to 00 at the point in question. The node little o notation gives the precise definition.

Ramsey's theorem

Let rr and ss be positive integers. Then there is a positive integer nn with this property. Colour each edge of the complete graph KnK_n blue or red, in any way. Then there is a blue clique with rr vertices or a red clique with ss vertices.

Builds on Complete graph, Clique

Lotka–Volterra equations

Let α,β,γ,δ>0\alpha, \beta, \gamma, \delta > 0 be constants. Let x(t)>0x(t) > 0 be the size of a prey population and y(t)>0y(t) > 0 the size of a predator population at time tt. The Lotka–Volterra equations are the autonomous system x′=αx−βxy,y′=δxy−γy.x' = \alpha x - \beta x y, \qquad y' = \delta x y - \gamma y. The equilibrium points in the closed quadrant x,y≥0x, y \ge 0 are (0,0)(0, 0) and (γ/δ,α/β)(\gamma / \delta, \alpha / \beta). The function V(x,y)=δx−γln⁡x+βy−αln⁡yV(x, y) = \delta x - \gamma \ln x + \beta y - \alpha \ln y is a first integral on the open quadrant x,y>0x, y > 0.

Builds on Equilibrium point, First integral, Periodic orbit, Linearisation at an equilibrium

Linear subspace

A linear subspace of a vector space is a subset that contains the zero vector and is closed under addition and scalar multiplication. It is a vector space with the same operations.

Volume of a ball in R^n

Let n≥1n \ge 1, let R>0R > 0, and let Bn(R)={x∈ℝn:∥x∥≤R}B_n(R) = \{x \in \mathbb{R}^n : \|x\| \le R\}. Then vol⁡(Bn(R))=πn/2Γ ⁣(n2+1) Rn,\operatorname{vol}(B_n(R)) = \frac{\pi^{n/2}}{\Gamma\!\left(\frac{n}{2} + 1\right)} \, R^n, where Γ(s)=∫0∞ts−1e−t dt\Gamma(s) = \int_0^\infty t^{s - 1} e^{-t} \, dt is the gamma function.

Builds on Euclidean space, Change of variables in multiple integrals, Fubini's theorem

Arcsine

The arcsine is the inverse of the sine function restricted to [−π/2,π/2][-\pi/2, \pi/2]. It is defined on [−1,1][-1, 1]. The node arcsine gives the precise definition.

Additivity of line integrals under concatenation

Let γ1 ⁣:[a,b]→ℝn\gamma_1 \colon [a, b] \to \mathbb{R}^n and γ2 ⁣:[b,c]→ℝn\gamma_2 \colon [b, c] \to \mathbb{R}^n be piecewise C1C^1 curves with γ1(b)=γ2(b)\gamma_1(b) = \gamma_2(b). Let γ ⁣:[a,c]→ℝn\gamma \colon [a, c] \to \mathbb{R}^n be their concatenation: γ=γ1\gamma = \gamma_1 on [a,b][a, b] and γ=γ2\gamma = \gamma_2 on [b,c][b, c]. For each continuous vector field FF and each continuous function ff on the image of γ\gamma, ∫γF⋅d𝐫=∫γ1F⋅d𝐫+∫γ2F⋅d𝐫,∫γf ds=∫γ1f ds+∫γ2f ds.\int_\gamma F \cdot d\mathbf{r} = \int_{\gamma_1} F \cdot d\mathbf{r} + \int_{\gamma_2} F \cdot d\mathbf{r}, \qquad \int_\gamma f \, ds = \int_{\gamma_1} f \, ds + \int_{\gamma_2} f \, ds.

Builds on Line integral of a vector field, Line integral of a scalar field, Line integral as an integral over the parameter interval

Topological embedding

A topological embedding is a map that identifies a space with a subspace of another space, with the same topology. It is a homeomorphism onto its image.

Hensel's lemma

Let pp be a prime number, and let ff be a polynomial with integer coefficients, with derivative f′f'. Let rr be an integer such that f(r)≡0(modp)f(r) \equiv 0 \pmod p and f′(r)≢0(modp)f'(r) \not\equiv 0 \pmod p. Then for each positive integer kk there is an integer rkr_k with rk≡r(modp)r_k \equiv r \pmod p and f(rk)≡0(modpk)f(r_k) \equiv 0 \pmod{p^k}. This rkr_k is unique modulo pkp^k.

Builds on Congruence modulo n, Prime number

Jordan–Chevalley decomposition

Let FF be a perfect field, for example a field of characteristic 00 or an algebraically closed field. Let VV be a finite-dimensional vector space over FF, and let T ⁣:V→VT \colon V \to V be a linear map. Then there are unique linear maps S,N ⁣:V→VS, N \colon V \to V with these properties:

Builds on Semisimple endomorphism, Nilpotent endomorphism

Hölder continuity

A map between metric spaces is Hölder continuous with exponent α\alpha when d(f(x),f(y))≤C d(x,y)αd(f(x), f(y)) \le C \, d(x, y)^\alpha for some constant CC and all x,yx, y. For α=1\alpha = 1 this is the Lipschitz condition.

Reduction formula

A reduction formula expresses an integral that depends on an integer nn through the same integral with a smaller nn. Repeated use of the formula reduces the integral to a simple case. Integration by parts usually produces the formula.

Builds on Integration by parts