Take any finite selection of distinct indices and a relationThe coordinate at on the left is exactly , while the zero vector has coordinate zero. Hence for each . Every finite subset of is therefore linearly independent, which is the definition of linear independence for an infinite set. Thus is linearly independent in the vector space of finitely supported sequences.
Write . Since , necessarily . Rearranging givesAll generators of therefore belong to , proving one set inclusion. Conversely, all belong to the linear subspace , proving the other set inclusion. ThusThis linear span exchange does not require linear independence of the original vectors.
Suppose . If , thencontrary to the hypothesis. Hence . The assumed linear independence of then gives . Therefore are linearly independent. Adding a vector outside the previous linear span creates no nontrivial relation.
Put . Taking all coefficients zero puts the zero vector in . If , lie in and , thenThus is closed under vector addition and scalar multiplication, contains the zero vector, and is therefore a linear subspace of . This is precisely why the linear span is a linear subspace.
Use the linear mapIt is well defined because , and it is a linear map by distributivity of polynomial multiplication. If for a nonzero pair, ii would give a common root of a polynomial of and . The hypothesis therefore implies , so is injective.
By i, the domain and codomain both have dimension : a basis of the domain is for , and a basis of the codomain is . The stated finite-dimensional result makes surjective. In particular has a preimage, proving the degree bound in polynomial Bézout's identity:Indeed, injectivity also proves uniqueness of this pair under the stated degree of a polynomial bounds.
Suppose, for a contradiction, that and have no common root of a polynomial. Since the polynomial ring has no zero divisors and , the relation with not both zero forces both and to be nonzero.
By the fundamental theorem of algebra, writewhere the are distinct. For each , . The equality implies that divides . The multiplicity of a root in polynomial multiplication is the sum of its multiplicities in the factors: factor out the largest powers of and note that the two remaining factors have nonzero values at . Since , must contain .
Thus has at least roots of a polynomial counted with multiplicity of a root, so . This contradicts . ConsequentlyCounting multiplicity of a root is necessary: counting only distinct roots of a polynomial would miss repeated factors.
The monomials form a basis of : they span every polynomial of degree of a polynomial at most , and equality of polynomials forces equality of every coefficient, proving linear independence. ThereforeThe zero polynomial is included in even though its degree of a polynomial need not be assigned an ordinary nonnegative value.
The transpose is a linear map, so is a linear map on the -dimensional vector space . Let denote a matrix unit. The answer depends on the characteristic of a field.
If , then means . Such skew-symmetric matrices have zero diagonal, and their entries above the diagonal can be chosen freely. A basis of the kernel of a linear map is for , giving nullity . The image of a linear map consists of all symmetric matrices: is symmetric, and every symmetric matrix is . Its basis comprises and for , giving rank of a linear map .
If , then , so consists of all symmetric matrices, with dimension . Every is symmetric with zero diagonal, and every symmetric zero-diagonal matrix arises by taking for and all other entries zero. The image of a linear map therefore has basis for , and dimension . This is the symmetrization map in characteristic two.
In both cases the rank-nullity theorem is verified explicitly:
Over the finite field , a basis of the hyperplane has vectors by ii. Each vector on the hyperplane has a unique expression as a linear combination of that basis, and each coefficient has possibilities. ThusEquivalently, choose freely all coordinates except , where , and solve uniquely for . For this counts just the zero vector, consistently with .
Define the linear functional by . The given hyperplane is . Choose with . For any , the vector whose only nonzero coordinate is satisfies . Hence is surjective and has rank of a linear map equal to .
Applying the rank-nullity theorem to this particular linear map givesThe nonzero-coefficient hypothesis is essential: if all were zero, the kernel of a linear map would instead be all of .
The rank-nullity theorem for a linear map , with a finite-dimensional vector space over a field , isHere the nullity is the dimension of the kernel of a linear map, and the rank of a linear map is the dimension of its image of a linear map.
Matrix similarity transports commuting operators: with ,By ii, all such matrices are thereforeFor completeness, matrix multiplication givesThe parameterization is injective, since matrix multiplication by and recovers the parameter diagonal matrix. Thus there are infinitely many choices. Already the distinct scalar matrices , , give an infinite family.
Write and . Because is a diagonal matrix,Thus exactly when for every . The three eigenvalues are distinct, so every off-diagonal entry of must be zero; diagonal entries are unrestricted. Consequently the centralizer of a diagonal matrix here isEvery displayed matrix indeed commutes with , since diagonal matrices multiply entry by entry on the diagonal.
For the given real matrix , direct matrix multiplication gives the eigenvectorsPut these eigenvectors into the columns ofSince , is an invertible matrix. The three column identities give , soIn particular, the matrix similarity is established by an explicit change-of-basis matrix.
For any matrix and compatible invertible matrix , the linear map maps onto : a linear combination of rows of is sent to the same linear combination of rows of . Its inverse function is , so these row spaces have equal dimensions. Hence right matrix multiplication by also preserves row rank.
If , ii now givesThis proves the required matrix similarity invariant without needing to assume equality of row rank and column rank.
When is an invertible matrix, . Apply i first to and then to :Thus the two row spaces are equal. In particular, invertible left matrix multiplication preserves row rank.
Write as an matrix and as an matrix, with rows . The rule for matrix multiplication givesEvery row of is therefore a linear combination of rows of . Taking linear spans gives
First let . Substitute in the negative half of the integral. Since is an odd function,The two halves cancel, soFor both limits coincide. For , reverse the limits and apply the result with . Thus the identity holds for every real .
Write , where is an integer and . The change of variables and the fact that is a periodic function giveSplit at , then substitute in the second piece:ThereforeThis proves translation invariance of an integral over one period without assuming that is differentiable.
The core contributes no change in , since there. Integrating the radial gravitational field across the shell, with , givesUsing the supplied antiderivative,HenceThe negative sign agrees with in the material shell under the paper's gravitational potential sign conventions.
There are unlisted articles, also show them or only show them.