Fibers of a linear map, the quotient map and the induced map, the first isomorphism theorem that identifies the quotient by the kernel with the image, and polynomial evaluation as a worked case.
The map T(x,y,z)=(x+y,z) from R3 to R2 sends both (3,1,2) and (5,−1,2) to (4,2). It cannot see how the sum x+y is split between x and y. After every group of inputs with a common output is merged into one object, is any further information lost? The first isomorphism theorem says that nothing more is lost, and each of its four claims has its own short proof.
Key terms
Fiber of a linear map
Definition Let T:V→W be a linear map between vector spaces over F, where F is R or C. The fiber of T over y∈W is the set of inputs with output y,
T−1(y)={v∈V∣T(v)=y}.
The notation does not assume that T has an inverse. The fiber is empty when y∈/imT. Since T(v)−T(u)=T(v−u),
T(v)=T(u)⟺v−u∈kerT,
so when T(v0)=y the fiber over y is the coset v0+kerT. The fiber over 0 is the kernel itself, and the nonempty fibers are exactly the cosets of kerT.
In plain words A fiber collects all the inputs that the map cannot tell apart from one another. Any two of them differ by a vector of the kernel.
Example For T(x,y,z)=(x+y,z) the output is zero exactly when x+y=0 and z=0, so kerT=span{(1,−1,0)}. The fiber over (4,2) is
(3,1,2)+kerT={(3+s,1−s,2)∣s∈R},
a line parallel to the kernel that contains (5,−1,2) and (4,0,2).
Quotient map
Definition For a subspace U of a vector space V over F, the quotient map is
q:V→V/U,q(v)=v+U.
It is linear, because q(av+bx)=(av+bx)+U=a(v+U)+b(x+U) by the definition of the quotient operations. It is onto, because every coset has a representative. Its kernel is U, because v+U is the zero coset exactly when v∈U. None of this needs finite dimension, an inner product or a choice of complement.
In plain words The quotient map replaces each vector by the coset it belongs to. Two vectors have the same image exactly when they differ by a vector of U.
Example For U=span{(1,−1,0)} in R3, the quotient map sends (3,1,2) and (5,−1,2) to the same coset, since their difference (−2,2,0) lies in U. It sends (1,−1,0) to the zero coset U. In this way every subspace is a kernel, namely the kernel of its own quotient map.
Induced map
Definition Let T:V→W be linear over F and let U be a subspace of V. The rule
T(v+U)=T(v)
defines a function on V/U exactly when U⊆kerT. If U⊆kerT and v+U=v′+U, then v−v′∈U, so T(v)−T(v′)=T(v−v′)=0. Conversely, if the rule is well defined, every u∈U satisfies u+U=0+U, so T(u)=T(0)=0. When U⊆kerT, the induced map T:V/U→W is linear, because
and it satisfies T=T∘q. It is the only map with that property, because q is onto.
In plain words A map can be defined on cosets only if it ignores every direction that the quotient ignores. The quotient may throw away only what the map already throws away.
Example For T(x,y,z)=(x+y,z) and U=kerT, the induced map sends the coset (x,y,z)+U, which consists of the vectors (x+s,y−s,z) with s∈R, to (x+y,z). With U the z-axis instead, the rule fails. The vectors 0 and e3 represent the same coset U, but T(0)=(0,0) and T(e3)=(0,1). Here U is not contained in kerT.
First isomorphism theorem
Definition Let V and W be vector spaces over F, where F is R or C, and let T:V→W be linear with kernel K=kerT. Then the induced map
T:V/K→imT,T(v+K)=T(v),
is a linear bijection, so V/kerT≅imT. The proof checks four things separately. The map is well defined because two representatives of one coset differ by a kernel vector. It is linear by the quotient operations and the linearity of T. It is injective because T(v)=T(u) gives v−u∈K, so v+K=u+K. It is onto imT because each y∈imT equals T(v) for some v, and then T(v+K)=y. No finite-dimensional hypothesis is needed. The original map T factors as T=ι∘T∘q, where q:V→V/K is the quotient map and ι is the inclusion of imT in W. When V is finite-dimensional, comparing dimensions gives rank-nullity, dimV−dimkerT=dimimT.
The theorem identifies the quotient with the image, not with the codomain, and the image equals the codomain only when T is onto.
In plain words Once the inputs a map cannot tell apart are merged, nothing else is lost. Each coset of the kernel matches exactly one output in the image, and each output in the image matches exactly one coset.
Example For T(x,y,z)=(x+y,z) the image is all of R2. The vectors (1,−1,0), e1 and e3 form a basis of R3, so e1+K and e3+K form a quotient basis, and the induced map sends them to (1,0) and (0,1). Because (3,1,2)−(4,0,2)=(−1,1,0) lies in K,
(3,1,2)+K=4(e1+K)+2(e3+K),
and T sends this coset to (4,2), which is T(3,1,2).
Polynomial evaluation map
Definition Fix a scalar s∈F and a whole number d≥0, and let Pd be the space of polynomials over F of degree at most d, including the zero polynomial. The evaluation map
evs:Pd→F,evs(p)=p(s),
is linear, since (p+r)(s)=p(s)+r(s) and (ap)(s)=ap(s). It is onto, because the constant polynomial with value a is sent to a. Its kernel, the polynomials with p(s)=0, has dimension d by rank-nullity, and for d≥1 it consists of the multiples (t−s)r(t) with r∈Pd−1. By the first isomorphism theorem,
Pd/kerevs≅F,p+kerevs↦p(s).
In plain words Evaluating at one point remembers a single number. Polynomials with the same value at s merge into one coset, and the quotient is a copy of the scalars.
Example Take F=R, d=2 and s=0. For p=a+bt+ct2 we get ev0(p)=a, so the kernel is span{t,t2} and each coset consists of all polynomials with one fixed constant term. The coset 1+kerev0 is a quotient basis, and the induced map sends (a+bt+ct2)+kerev0 to a. The rule that sends a coset to the coefficient of t is not well defined. The polynomials 2+t and 2+5t+t2 lie in one coset, since their difference 4t+t2 is in the kernel, but their coefficients of t are 1 and 5.
Check yourself
Let T(x,y,z)=(x+y,z). Describe the fiber over (1,5), and decide whether (0,1,5) and (2,−1,5) represent the same coset of kerT.
Show the answer
The vector (1,0,5) maps to (1,5), so the fiber is (1,0,5)+span{(1,−1,0)}, the points (1+s,−s,5) with s∈R. Both given vectors map to (1,5), and their difference (−2,2,0)=−2(1,−1,0) lies in the kernel, so they represent the same coset.
For P(x,y)=(x,0) on R2, a student concludes from the first isomorphism theorem that R2/kerP≅R2. What is wrong, and what is the correct statement?
Show the answer
The theorem gives an isomorphism onto the image, not onto the codomain. Here kerP is the y-axis and imP is the x-axis, so the quotient has dimension 2−1=1 and cannot be isomorphic to R2. The correct statement is that the induced map (x,y)+kerP↦(x,0) is a linear bijection onto the x-axis. The vector (0,1) is never reached.
Over R let T:P2→R2 be given by T(p)=(p(0),p(1)). Find kerT, show that T is onto, and state what the first isomorphism theorem gives. Is the rule p+kerT↦p(2) well defined?
Show the answer
Write p=a+bt+ct2, so that T(p)=(a,a+b+c). The output is zero when a=0 and b=−c, so kerT=span{t2−t}. Given (u,w)∈R2, the polynomial u+(w−u)t has values u at 0 and w at 1, so T is onto. The theorem gives
P2/span{t2−t}≅R2
through p+kerT↦(p(0),p(1)), in agreement with the count 3−1=2. The rule p+kerT↦p(2) is not well defined. The polynomials 0 and t2−t lie in the same coset, but their values at 2 are 0 and 2. The kernel of T is not contained in the kernel of evaluation at 2.
May we count page visits to understand which courses and learning features are useful? Cloudflare collects visit and performance statistics, without your account details or answers. Your choice does not affect access. Details