Search Results for ""

If A is an n×n square matrix and lambda is an eigenvalue of A, then the union of the zero vector 0 and the set of all eigenvectors corresponding to eigenvalues lambda is ...

The degree (or relative degree, or index) of an extension field K/F, denoted [K:F], is the dimension of K as a vector space over F, i.e., [K:F]=dim_FK. If [K:F] is finite, ...

f(I) is the collection of all real-valued continuous functions defined on some interval I. f^((n))(I) is the collection of all functions in f(I) with continuous nth ...

A polynomial factorization algorithm that proceeds by considering the vector of coefficients of a polynomial P, calculating b_i=P(i)/a_i, constructing the Lagrange ...

A regular local ring is a local ring R with maximal ideal m so that m can be generated with exactly d elements where d is the Krull dimension of the ring R. Equivalently, R ...

If pi on V and pi^' on V^' are irreducible representations and E:V|->V^' is a linear map such that pi^'(g)E=Epi(g) for all g in and group G, then E=0 or E is invertible. ...

A subset A of a vector space V is said to be convex if lambdax+(1-lambda)y for all vectors x,y in A, and all scalars lambda in [0,1]. Via induction, this can be seen to be ...

A linear real-valued function omega^1 of vectors v such that omega^1(v)|->R. Vectors (i.e., contravariant vectors or "kets" |psi>) and one-forms (i.e., covariant vectors or ...

Let V and W be vector spaces over a field F, and let T:V->W be a linear transformation. Assuming the dimension of V is finite, then dim(V)=dim(Ker(T))+dim(Im(T)), where ...

A linear transformation between two vector spaces V and W is a map T:V->W such that the following hold: 1. T(v_1+v_2)=T(v_1)+T(v_2) for any vectors v_1 and v_2 in V, and 2. ...