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.

Vector space

A vector space over a field is a set of vectors that can be added and multiplied by scalars, with the usual rules of arithmetic. Vector spaces are the main objects of linear algebra.

Sequential characterization of limits

Let D⊆ℝD \subseteq \mathbb{R}, let f ⁣:D→ℝf \colon D \to \mathbb{R}, let aa be a limit point of DD, and let LL be a real number. Then lim⁡x→af(x)=L\lim_{x \to a} f(x) = L if and only if the following holds. For each sequence (xn)(x_n) in D∖{a}D \setminus \{a\} with xn→ax_n \to a, f(xn)→Lf(x_n) \to L.

Builds on Limit of a function, Limit of a sequence

Singular value decomposition

Let AA be an m×nm \times n complex matrix. Then there are a unitary matrix UU of size m×mm \times m, a unitary matrix VV of size n×nn \times n, and an m×nm \times n matrix Σ\Sigma with A=UΣV∗.A = U \Sigma V^*. Here Σij=0\Sigma_{ij} = 0 for i≠ji \ne j, and Σ11≥Σ22≥⋯≥0\Sigma_{11} \ge \Sigma_{22} \ge \cdots \ge 0 are the singular values of AA.

Builds on Singular value, Unitary matrix

Quotient set

The quotient set of a set by an equivalence relation is the set of all equivalence classes.

Mutual independence of events

A family of events is mutually independent when, for each finite subfamily, the probability that all its events occur is the product of their probabilities. The node mutual independence of events gives the precise definition.

Block diagonal matrix

A block diagonal matrix is a square block matrix whose diagonal blocks are square and whose other blocks are all zero.

Power series are differentiable inside the radius of convergence

Let f(x)=∑n=0∞an(x−c)nf(x) = \sum_{n=0}^{\infty} a_n (x - c)^n be a power series with radius of convergence R>0R > 0. Then ff is differentiable on (c−R,c+R)(c - R, c + R), and f′(x)=∑n=1∞nan(x−c)n−1.f'(x) = \sum_{n=1}^{\infty} n a_n (x - c)^{n-1}. The derived series also has radius of convergence RR.

Builds on Power series, Radius of convergence, Term-by-term differentiation, Power series converge uniformly on smaller discs inside the radius of convergence

Differential equation

A differential equation is an equation that relates an unknown function to one or more of its derivatives. A solution is a function that makes the equation true at each point of its domain. If the unknown function depends on one variable, the equation is an ordinary differential equation. If it depends on several variables and the equation has partial derivatives, it is a partial differential equation.

Jump discontinuity

A jump discontinuity is a point where both one-sided limits of a function exist but are different. The graph jumps from one height to another there. The node jump discontinuity gives the precise definition.

Power set Boolean algebra

Let XX be a set, and let 𝒫(X)\mathcal{P}(X) be the set of all subsets of XX. With A∧B=A∩BA \wedge B = A \cap B, A∨B=A∪BA \vee B = A \cup B, ¬A=X∖A\neg A = X \setminus A, 0=∅0 = \varnothing and 1=X1 = X, the set 𝒫(X)\mathcal{P}(X) is a Boolean algebra. Its order is inclusion ⊆\subseteq.

Sylow p-subgroup

Let GG be a finite group, let pp be a prime number, and let pnp^n be the largest power of pp that divides ∣G∣|G|. A Sylow pp-subgroup of GG is a subgroup of order pnp^n.

Taylor's theorem with the Cauchy remainder

Let k≥0k \ge 0 and let a≠xa \ne x be real numbers. Let JJ be the closed interval with endpoints aa and xx. Let ff be a real function with f(k)f^{(k)} continuous on JJ and f(k+1)f^{(k+1)} existing on the interior of JJ. Then there is ξ\xi strictly between aa and xx with f(x)=Pk(x)+f(k+1)(ξ)k!(x−ξ)k(x−a),f(x) = P_k(x) + \frac{f^{(k+1)}(\xi)}{k!} (x - \xi)^k (x - a), where PkP_k is the Taylor polynomial of degree kk of ff at aa.

Builds on Taylor polynomial, Mean value theorem

Row equivalence

Two matrices are row equivalent when one of them can be changed into the other by a finite sequence of elementary row operations.

Quotient ring

The quotient ring of a ring by a two-sided ideal is the set of the cosets of the ideal. Its operations come from the operations of the ring. The integers modulo nn are the main example. The definition of the quotient ring gives the construction.

Least common multiple

The least common multiple of two nonzero integers is the smallest positive integer that is a multiple of both of them. We write it as lcm⁡(a,b)\operatorname{lcm}(a, b). The definition of the least common multiple gives the precise form and the convention when one of the numbers is 00.

Dimension of the dual space

Let FF be a field and let VV be a finite-dimensional vector space over FF. Then the dual space V∗V^* is finite-dimensional, and dim⁡V∗=dim⁡V.\dim V^* = \dim V.

Builds on Dual space, Dual basis

Composite number

A composite number is a natural number greater than 11 that is not prime. Such a number is a product of two smaller natural numbers, each greater than 11. The definition of a composite number gives the precise form.

Zero ring

The zero ring is the set {0}\{0\} with the operations 0+0=00 + 0 = 0 and 0⋅0=00 \cdot 0 = 0. It is a commutative ring in which 1=01 = 0.

Builds on Ring

Scaling a row scales the determinant

Let KK be a commutative ring, let AA be an n×nn \times n matrix over KK, and let c∈Kc \in K. Let BB be the matrix that results when one row of AA is multiplied by cc. Then det⁡B=cdet⁡A\det B = c \det A, where det⁡\det is the determinant.

Builds on Determinant

Stars and bars

Let nn and kk be natural numbers with n≥1n \ge 1. Then the number of multisets of size kk with elements in an nn-element set is ( ⁣(nk) ⁣)=(n+k−1k).\left(\!\binom{n}{k}\!\right) = \binom{n + k - 1}{k}. Equivalently, this is the number of solutions (x1,…,xn)(x_1, \dots, x_n) of x1+⋯+xn=kx_1 + \dots + x_n = k in natural numbers.

Builds on Binomial coefficient, Combinations with repetition

One-sided limit

A one-sided limit is the limit of a function as the argument approaches a point from the left only or from the right only. A function has a limit at a point exactly when both one-sided limits exist and agree. The node one-sided limit gives the precise definition.

Composition of linear maps

The composition of two linear maps is the linear map that applies the first map and then the second.

Picard–Lindelöf theorem in integral form

Let J=[tmin⁡,tmax⁡]J = [t_{\min}, t_{\max}] and t0∈Jt_0 \in J, let x0∈ℝnx_0 \in \mathbb{R}^n, and let f:J×ℝn→ℝnf : J \times \mathbb{R}^n \to \mathbb{R}^n satisfy the Picard–Lindelöf hypotheses at (t0,x0)(t_0, x_0) with constants a,L,Ka, L, K. Let BB be the closed ball of radius aa around x0x_0. Then there is exactly one continuous curve α:J→B\alpha : J \to B such that α(t)=x0+∫t0tf(s,α(s))dsfor each t∈J.\alpha(t) = x_0 + \int_{t_0}^{t} f\left(s, \alpha(s)\right) ds \quad \text{for each } t \in J.

Builds on Picard–Lindelöf theorem, Integral equation form of an initial value problem, Picard operator

Finite intersection property

Let XX be a topological space and let K⊆XK \subseteq X. Then KK is compact if and only if it has the property that follows. Let (Fi)i∈I(F_i)_{i \in I} be a family of closed subsets of XX with K∩Fi1∩⋯∩Fin≠∅K \cap F_{i_1} \cap \cdots \cap F_{i_n} \neq \emptyset for all finitely many indices i1,…,in∈Ii_1, \ldots, i_n \in I. Then also K∩⋂i∈IFi≠∅K \cap \bigcap_{i \in I} F_i \neq \emptyset.

Builds on Compact set, Closed set, Compactness via open covers

Graph

A graph is a set of vertices together with a set of edges, each edge joining two distinct vertices. Graphs model networks, relations and maps, and they are the main object of graph theory. The node graph gives the precise definition.

Countably infinite set

A countably infinite set is a set that is equinumerous with the set of natural numbers.

Laws of exponents in a group

Let GG be a group with identity element ee, and let a∈Ga \in G. For an integer nn, define ana^n as follows: a0=ea^0 = e, an+1=anaa^{n+1} = a^n a for n≥0n \geq 0, and a−n=(a−1)na^{-n} = (a^{-1})^n for n>0n > 0. Then am+n=amana^{m+n} = a^m a^n and (am)n=amn(a^m)^n = a^{mn} for all integers mm and nn.

Builds on Group

Power set

The power set of a set is the set of all its subsets.

Hasse diagram

A Hasse diagram is a drawing of a finite partially ordered set. Each element is a point, and there is a line upward from aa to bb when bb covers aa. This means that a<ba < b and no cc satisfies a<c<ba < c < b. Then a≤ba \le b exactly when one can go from aa to bb by a path that goes only upward.

Builds on Partial order

Closed map

A closed map is a function between topological spaces that sends closed sets to closed sets. Continuous maps from compact spaces to Hausdorff spaces are closed maps.