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.

Complex logarithm

A complex logarithm of a nonzero complex number zz is a complex number ww with ew=ze^w = z, see the definition. Each z≠0z \neq 0 has infinitely many logarithms, which differ by integer multiples of 2πi2\pi i. A complex logarithm function is a continuous choice of a logarithm on an open subset of ℂ∖{0}\mathbb{C} \setminus \{0\}.

Reduction of order

Reduction of order is a method to find a second solution of a homogeneous linear equation from a known one. Let p,qp, q be continuous on an open interval II, and let y1y_1 be a solution of y′′+p(x)y′+q(x)y=0y'' + p(x) y' + q(x) y = 0 with no zero on II. Put y=v y1y = v\, y_1. Then yy is a solution if and only if y1v′′+(2y1′+p y1)v′=0y_1 v'' + (2 y_1' + p\, y_1) v' = 0, a first-order linear equation for v′v'. One solution gives y2=y1∫e−∫p dxy12 dxy_2 = y_1 \int \frac{e^{-\int p\, dx}}{y_1^2}\, dx, and (y1,y2)(y_1, y_2) is a fundamental system on II.

Builds on Homogeneous linear equation, Fundamental system of solutions, Wronskian

Cauchy mean value theorem

Let a<ba < b and let f,g ⁣:[a,b]→ℝf, g \colon [a, b] \to \mathbb{R} be continuous on [a,b][a, b] and differentiable on (a,b)(a, b). Then there is c∈(a,b)c \in (a, b) with (f(b)−f(a)) g′(c)=(g(b)−g(a)) f′(c).(f(b) - f(a)) \, g'(c) = (g(b) - g(a)) \, f'(c).

Builds on Rolle's theorem, Mean value theorem

Riemann mapping theorem

Let UU be a nonempty open subset of ℂ\mathbb{C} with U≠ℂU \neq \mathbb{C}. Suppose that UU is simply connected: UU is connected, and each closed path in UU can be continuously deformed in UU to a constant path. Let 𝔻={z∈ℂ:∣z∣<1}\mathbb{D} = \{ z \in \mathbb{C} : |z| < 1 \}. Then there is a biholomorphic map ff from UU onto 𝔻\mathbb{D}, that is, a bijective holomorphic map with a holomorphic inverse. Moreover, for each z0∈Uz_0 \in U there is exactly one such ff with f(z0)=0f(z_0) = 0 and f′(z0)f'(z_0) a positive real number.

Builds on Holomorphic function, Conformal map

Branch of the logarithm

A branch of the logarithm on an open set U⊆ℂ∖{0}U \subseteq \mathbb{C} \setminus \{0\} is a continuous function LL on UU with eL(z)=ze^{L(z)} = z, see the definition. On a domain, two branches differ by a constant integer multiple of 2πi2\pi i.

Centraliser

The centraliser of a subset SS of a group is the set of elements that commute with each element of SS. It is a subgroup.

One-form

A one-form is a differential form of degree one. At each point it gives a linear function of tangent vectors. One-forms are the natural integrands of line integrals, and the differential of a function is the basic example.

Builds on Differential form

Partial fraction decomposition

Partial fraction decomposition writes a rational function as a sum of a polynomial and simple fractions. Let KK be a field, and let P/QP/Q be a rational function with P,Q∈K[X]P, Q \in K[X] and Q≠0Q \neq 0. Assume that Q=∏i=1rqimiQ = \prod_{i=1}^{r} q_i^{m_i}, where the qiq_i are distinct monic irreducible polynomials. Then there are unique polynomials BB and AijA_{ij}, with deg⁡Aij<deg⁡qi\deg A_{ij} < \deg q_i, such that PQ=B+∑i=1r∑j=1miAijqi j.\frac{P}{Q} = B + \sum_{i=1}^{r} \sum_{j=1}^{m_i} \frac{A_{ij}}{q_i^{\,j}}.

The real part of a holomorphic function is harmonic

Let U⊆ℂU \subseteq \mathbb{C} be an open set and let f:U→ℂf : U \to \mathbb{C} be holomorphic on UU. Let u=Re⁡fu = \operatorname{Re} f and v=Im⁡fv = \operatorname{Im} f, as real functions of (x,y)(x, y) on UU, with z=x+iyz = x + iy. Then uu and vv are twice continuously differentiable, and ∂2u∂x2+∂2u∂y2=0,∂2v∂x2+∂2v∂y2=0\frac{\partial^2 u}{\partial x^2} + \frac{\partial^2 u}{\partial y^2} = 0, \qquad \frac{\partial^2 v}{\partial x^2} + \frac{\partial^2 v}{\partial y^2} = 0 on UU. Thus uu and vv are harmonic functions on UU.

Builds on Holomorphic function, Cauchy–Riemann equations, Holomorphic functions are infinitely differentiable, Real and imaginary parts

A tangent is perpendicular to the radius

Let CC be a circle with the centre OO and the radius r>0r > 0 in the Euclidean plane ℝ2\mathbb{R}^2. Let TT be a point of CC, and let ℓ\ell be a line through TT. Then ℓ\ell is tangent to CC at TT if and only if ℓ\ell is perpendicular to the radius OTOT. That is, (X−T)⋅(T−O)=0(X - T) \cdot (T - O) = 0 for each point XX of ℓ\ell.

Builds on Tangent line to a circle, Circle, Vectors are perpendicular if and only if their dot product is zero

Order of a cyclic subgroup equals the order of its generator

Let GG be a group and let g∈Gg \in G. If gg has finite order nn, then ⟨g⟩={e,g,g2,…,gn−1}\langle g \rangle = \{e, g, g^2, \ldots, g^{n-1}\}, these nn elements are distinct, and thus ∣⟨g⟩∣=n|\langle g \rangle| = n. If gg has infinite order, then the powers gkg^k for k∈ℤk \in \mathbb{Z} are distinct, and ⟨g⟩\langle g \rangle is infinite.

Builds on Cyclic subgroup generated by an element, Order of an element, Order of a group, g to the n equals 1 iff the order divides n

Event

An event is a set of outcomes of a random experiment to which we give a probability. The event happens when the outcome of the experiment is in the set. The node event gives the precise definition.

Polyhedron

A polyhedron is a three-dimensional figure with flat polygonal faces, straight edges and corner points, the vertices. The word names the solid or its boundary surface. Cubes, pyramids and prisms are polyhedra.

Residue theorem

Let U⊆ℂU \subseteq \mathbb{C} be a simply connected open set. This means that UU is connected, and each closed path in UU can be continuously deformed in UU to a constant path. Let a1,…,ana_1, \dots, a_n be distinct points of UU, and let ff be holomorphic on U∖{a1,…,an}U \setminus \{a_1, \dots, a_n\}. Let γ\gamma be a closed, continuous and piecewise continuously differentiable path in U∖{a1,…,an}U \setminus \{a_1, \dots, a_n\}. Then ∮γf(z) dz=2πi∑k=1nn(γ,ak)Res⁡(f,ak),\oint_\gamma f(z) \, dz = 2 \pi i \sum_{k=1}^{n} n(\gamma, a_k) \operatorname{Res}(f, a_k), where n(γ,ak)n(\gamma, a_k) is the winding number of γ\gamma around aka_k and Res⁡(f,ak)\operatorname{Res}(f, a_k) is the residue of ff at aka_k.

Builds on Residue, Winding number, Contour integral, Holomorphic function

Matrix multiplication

Matrix multiplication is the operation that takes an m×nm \times n matrix and an n×pn \times p matrix and gives an m×pm \times p matrix. Entry (i,k)(i, k) of the product combines row ii of the first matrix with column kk of the second matrix.

Projection

A projection is a linear map from a vector space to itself that is equal to its own square. It projects the space onto its image along its kernel.

Nine-point circle

The nine-point circle of a triangle is the circle through the midpoints of its three sides. It also passes through the three feet of the altitudes and through the midpoints of the segments from the vertices to the orthocentre.

Limit inferior

The limit inferior of a sequence is the limit of the infima of its tails. It describes the smallest value near which the sequence lies infinitely often. The node limit inferior gives the precise definition.

Formal power series

A formal power series is an infinite sum ∑anXn\sum a_n X^n treated as an algebraic object, without any convergence condition. Formal power series form a ring that is the natural home of generating functions. The node formal power series gives the precise definition.

Triangularisation

Let FF be a field and let AA be an n×nn \times n matrix over FF. Then AA is similar to an upper triangular matrix over FF if and only if the characteristic polynomial of AA splits over FF. Here, to split means to be a product of linear factors. In particular, over an algebraically closed field, such as ℂ\C, each square matrix is similar to an upper triangular matrix.

Builds on Characteristic polynomial, Upper triangular matrix, Similar matrices

Hyperbolic cosine

The hyperbolic cosine is the average of exe^x and e−xe^{-x}. It is an even function with minimum value 11 at 00. The node hyperbolic cosine gives the precise definition.

Gauss's lemma on quadratic residues

Let pp be an odd prime and let aa be an integer with p∤ap \nmid a. Reduce each of the integers a,2a,…,p−12aa, 2a, \dots, \frac{p-1}{2} a to its least positive residue modulo pp. Let nn be the number of these residues that are greater than p/2p/2. Then (ap)=(−1)n\left(\frac{a}{p}\right) = (-1)^n, where the left side is the Legendre symbol.

Builds on Legendre symbol

Leibniz formula for pi

The series ∑n=0∞(−1)n2n+1\sum_{n=0}^{\infty} \frac{(-1)^n}{2n + 1} converges, and 1−13+15−17+⋯=π4.1 - \frac{1}{3} + \frac{1}{5} - \frac{1}{7} + \cdots = \frac{\pi}{4}.

Builds on Alternating series test, pi

System of linear differential equations

A system of linear differential equations is an equation x′=A(t)x+b(t)x' = A(t) x + b(t) for a vector-valued function xx, with a matrix A(t)A(t) of coefficients. Its theory extends that of a single linear equation. See the definition.

Arzelà–Ascoli theorem

Let XX be a compact metric space and let C(X)C(X) be the set of continuous functions X→ℝX \to \mathbb{R}, with the uniform metric d∞(f,g)=sup⁡x∈X∣f(x)−g(x)∣d_\infty(f, g) = \sup_{x \in X} |f(x) - g(x)|. Let ℱ⊆C(X)\mathcal{F} \subseteq C(X). Then the closure of ℱ\mathcal{F} in C(X)C(X) is compact if and only if ℱ\mathcal{F} is equicontinuous and uniformly bounded. Here uniformly bounded means that there is a real MM with ∣f(x)∣≤M|f(x)| \le M for all f∈ℱf \in \mathcal{F} and x∈Xx \in X.

Builds on Equicontinuity, Uniform metric on bounded functions, Compact space, Compact iff complete and totally bounded

Bernoulli distribution

The Bernoulli distribution with parameter pp is the distribution of a random variable with two values. The value 11 has probability pp and the value 00 has probability 1−p1 - p. It is the distribution of one Bernoulli trial. The node Bernoulli distribution gives the precise definition.

Parametric equation of a line

A parametric equation of a line describes its points as the values of a function of one real parameter tt. The line in ℝ3\mathbb{R}^3 through the point (x0,y0,z0)(x_0, y_0, z_0) with the nonzero direction vector (a,b,c)(a, b, c) has the parametric equations x=x0+at,y=y0+bt,z=z0+ct,t∈ℝ.x = x_0 + a t, \quad y = y_0 + b t, \quad z = z_0 + c t, \qquad t \in \mathbb{R}. In vector form, the line through the point pp with the direction vector v≠0v \neq 0 is the set of the points p+tvp + t v for t∈ℝt \in \mathbb{R}. The same form works in ℝn\mathbb{R}^n for each n≥2n \geq 2.