Search Results for ""

A theory is decidable iff there is an algorithm which can determine whether or not any sentence r is a member of the theory.

Qualitatively, a deep theorem is a theorem whose proof is long, complicated, difficult, or appears to involve branches of mathematics which are not obviously related to the ...

Given a square matrix M, the following are equivalent: 1. |M|!=0. 2. The columns of M are linearly independent. 3. The rows of M are linearly independent. 4. Range(M) = R^n. ...

A diagonal of a square matrix which is traversed in the "southeast" direction. "The" diagonal (or "main diagonal," or "principal diagonal," or "leading diagonal") of an n×n ...

Two quantities are said to be different (or "unequal") if they are not equal. The term "different" also has a technical usage related to modules. Let a module M in an ...

A test for the convergence of Fourier series. Let phi_x(t)=f(x+t)+f(x-t)-2f(x), then if int_0^pi(|phi_x(t)|dt)/t is finite, the Fourier series converges to f(x) at x.

int_0^pi(sin[(n+1/2)x])/(2sin(1/2x))dx=1/2pi, where the integral kernel is the Dirichlet kernel.

Disconnectivities are mathematical entities which stand in the way of a space being contractible (i.e., shrunk to a point, where the shrinking takes place inside the space ...

Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set ...

A generalization by Kronecker of Kummer's theory of prime ideal factors. A divisor on a full subcategory C of mod(A) is an additive mapping chi on C with values in a ...