Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 7 4 c Solution Created 2026-10-03 Updated 2026-10-14
Choose algebra generators for over . Because the extension is integral, each satisfies a monic equationRepeatedly reduce any exponent at least using this equation. Since the generators commute, every polynomial in them becomes an -linear combination of the finitely many monomialsThus is a finitely generated module over , with at most generators. This proves the relevant subalgebra generated by finitely many integral elements assertion rather than merely invoking it.
For a fixed prime ideal , form the fiber ring . Tensoring the finite generating list shows : its pure tensors with one span the fiber over the residue field . Part (b) therefore gives only finitely many primes in . By the canonical bijection in part (a), these are precisely the primes of contracting to . HenceNo Noetherian hypothesis on is needed. For an empty algebra-generating list, and the empty product gives the same conclusion.
Past exam of the mathematics course of the University of Cambridge 2024 iii Paper 101 3 i Solution Created 2026-09-24 Updated 2026-09-25
Take and identify with the space of real matrices, where pure tensors correspond to matrices of rank at most one. Letand let be the quotient map. It is not injective because its kernel is the nonzero line .
If , thenfor some . The left side has matrix rank at most two. If , the right side has rank three, which is impossible. Thus and the two pure tensors were equal. Hence is injective on the set of pure tensors while failing to be injective linearly.
Separability of a tensor 2026-10-14
In a two-factor tensor product over a field, a pure tensor is also called a separable or decomposable tensor: it can be expressed as one product . Every tensor is a finite sum of pure tensors, but a sum need not itself be a pure tensor.[ref]
Tensor Products I by Keith Conrad. §3, printed p. 9: elementary, simple, decomposable, and pure tensors; Example 2.1, printed pp. 4–5: outer products do not fill the matrix space
For finite-dimensional vector spaces, the tensor-product coefficient matrix gives a decisive test: a nonzero tensor is a pure tensor exactly when its matrix rank is one. Indeed, every column of is a scalar multiple of . Conversely, if all columns of a nonzero matrix are multiples of one nonzero column , collect their multipliers in to obtain . The zero tensor is also a pure tensor, for example , but its matrix rank is zero.
In , the tensoris nonseparable: its matrix rank is two and its determinant is one, whereas . Directly, trying requires and . The first two equations force all four scalars nonzero, contradicting the others. In contrast, products sharing a factor do combine: . Thus being written as two summands alone does not establish nonseparability.
Tensor product Created 2026-09-24 Updated 2026-10-14
A tensor product turns a bilinear map into a linear map. For vector spaces over the same field , its elements are finite sums of pure tensors , subject to bilinearity:The scalar belongs to ; writing makes this choice explicit. These rules preserve separate linearity while allowing arbitrary linear combinations of products.[ref]
Linear Algebra Done Right by Sheldon Axler (4th edition). §9D, 9.71–9.74, printed pp. 372–373: tensor products, bilinearity, and bases
For a concrete example, take , with basis vectors in the first copy and in the second. The four tensor-product basis elements areThe pure tensor made from and expands toEach basis vector in one factor can interact with each basis vector in the other. This is why dimensions multiply; the tensor-product coefficient matrix displays these four interactions as a two-by-two grid.
The tensor product is different from the Cartesian product . With componentwise vector addition and scalar multiplication, the latter contains pairs and has dimension . The map is bilinear, generally neither linear on that Cartesian product nor injective nor surjective. In our example, , and ; the separability of a tensor explains why some outputs cannot be reached at all. Both spaces happen to have dimension four when , but this coincidence does not identify their structures.
Tensor-product basis Created 2026-10-05 Updated 2026-10-14
If and are bases of finite-dimensional vector spaces over , then the products form a basis of . There is one independent coordinate for every pair of indices.[ref]
Linear Algebra Done Right by Sheldon Axler (4th edition). §9D, Theorems 9.72 and 9.74, printed pp. 372–373: dimension and tensor-product basis
For a proof outline, bilinearity expands each pure tensor asso these products form a spanning set. For linear independence, take the coordinate functionals from the two dual bases. The bilinear map induces a linear functional on the tensor product, satisfying . Applying it to a proposed zero linear combination selects just , forcing every coefficient to vanish. Thus dimensions multiply, rather than add. This finite-dimensional count includes a zero factor, whose tensor product has dimension zero.
Tensor-product coefficient matrix 2026-10-14
After choosing ordered bases, identify a tensor with its matrix . This is a linear isomorphism between and the vector space of -by- matrices: each tensor-product basis element becomes the matrix with one entry equal to one and all others zero. In particular, a pure tensor has the outer product coefficient formulaHere on the right denote column coordinate vectors. The identification depends on the chosen bases, while the tensor itself does not. Over the complex numbers, the same formula uses the ordinary transpose , with no complex conjugation; replacing it by the conjugate transpose would conjugate the scalar in the second input, violating bilinearity.
Two-factor tensor rank 2026-10-14
The two-factor tensor rank is the smallest number of pure tensors whose sum equals , with zero allowed as the empty sum. For two finite-dimensional vector spaces over the same field, it equals the matrix rank of the tensor-product coefficient matrix. A sum of outer products has column space contained in the span of their first factors, so its matrix rank is at most . Conversely, choose a basis for the column space, express each column in that basis, and collect the coefficients into row vectors . This yields , hence a sum of pure tensors.
The pure tensor therefore has two-factor tensor rank one, whereas has two-factor tensor rank two. Both have two factors: the number of factors and the minimum number of product summands are different counts. Over the real numbers, the singular value decomposition supplies a useful decomposition , with one nonzero term per matrix rank. The two-factor rank equality does not extend to three or more factors by merely choosing one matrix layout.
