✦ For everyone, free.

Practical knowledge for real and everyday life

Home

14.20.2 Tensor Map Product Codomain Verification

Tensor Map Product Codomain Verification ensures the correct target space for tensor map products in algebraic structures.

Tensor Map Product Codomain Verification is the stage of the verification procedure concerned with confirming that the stated codomain VW of fg is correct and that the image of fg inside that codomain is exactly what is claimed, rather than a proper subspace or a mismatched space.


Membership of Outputs in the Stated Codomain

Immediate Membership on Simple Tensors

Since f:VV and g:WW by hypothesis, the value f(v)g(w) is automatically an element of VW, so membership of individual simple-tensor outputs in the stated codomain requires no separate argument beyond confirming that f and g genuinely have the codomains claimed for them.

Extension to General Elements

Because VW is a vector space and hence closed under linear combination, sums of such simple-tensor outputs also lie in the stated codomain, so once membership is confirmed on simple tensors, it holds automatically for the image of every element of VW under fg.


Verifying the Exact Image

The Image Factorization Claim

The substantive part of codomain verification is confirming the identity

im(fg) = im(f) im(g)

where the right-hand side denotes the subspace of VW spanned by simple tensors of an image vector of f and an image vector of g. This identity is not automatic from the definition alone and must be checked in both directions.

Containment in One Direction

Every basis output element appearing with a nonzero coefficient in (fg)(t), for any t, arises as a linear combination of terms f(ei)g(fj), each of which lies in im(f)im(g), giving the containment im(fg)im(f)im(g).

Containment in the Other Direction

Conversely, any element of im(f)im(g) is a linear combination of simple tensors vw with v=f(v) and w=g(w) for some vV and wW; each such simple tensor equals (fg)(vw), giving the reverse containment and completing the equality.


Consequence for Rank as a Codomain Check

Rank Consistency

The dimension of the image, verified above to equal im(f)im(g), has dimension rank(f)rank(g), providing a numerical cross-check on codomain verification: computing rank(fg) directly from a candidate matrix and confirming it equals this product is a quick way to detect an error in the codomain identification without redoing the full containment argument.

Detecting an Overstated Codomain

If a candidate construction claims fg to be surjective onto VW whenever f and g are surjective, codomain verification confirms this directly from the image factorization: if im(f)=V and im(g)=W, then im(fg)=VW, matching the full stated codomain exactly.


Corestriction and Its Compatibility

Restricting the Codomain to the Image

If f and g are corestricted to their own images, producing surjective maps f:Vim(f) and g:Wim(g), codomain verification confirms that fg agrees with fg after the codomain of the latter is likewise corestricted to im(f)im(g), since corestriction changes only the stated codomain of a map and not its values.

Stated codomain V′ ⊗ W′ im(f) ⊗ im(g) = im(f⊗g) exact image, verified