In a step of the quadratic sieve, the block Lanczos (“LAHN-tsoash”) algorithm is often used to find an element of this set over a finite field. One of the two possibilities given by the finite-dimensional Fredholm Alternative is that an example of this set is trivial. For nilpotent objects, the dimension of this set is equal to the number of Jordan blocks. This set and its “co-” or “left” analog are two of the “four fundamental” sets for an operator. Functionals for which this set includes a set A make up the annihilator of A. This set consists of elements orthogonal to all elements of the row space. The dimension of the domain equals the dimension of the image plus the dimension of this subspace of the domain. For 10 points, singular matrices have nontrivial examples of what subspace, which consists of the vectors mapped to zero? ■END■
ANSWER: kernel [or null space; or ker; accept cokernel or left kernel; accept null space after “subspace” is read; prompt on null until “subspace” is read; reject “null set”]
<Other Science>
= Average correct buzz position