Intending to improve the teaching and learning of the notion of mathematical proof this study seeks to uncover the kinds of flaws in postgraduate mathematics education student teachers. Twenty-three student teachers responded to a proof task involving the concepts of transposition and multiplication of matrices. Analytic induction strategy that…

A second course in linear algebra that goes beyond the traditional lower-level curriculum is increasingly important for students of the mathematical sciences. Although many applications involve only real numbers, a solid understanding of complex arithmetic often sheds significant light. Many instructors are unaware of the opportunities afforded by…

An elementary proof using matrix theory is given for the following criterion: if "F"/"K" and "L"/"K" are field extensions, with "F" and "L" both contained in a common extension field, then "F" and "L" are linearly disjoint over "K" if (and only if) some…

This paper introduces a new matrix tool for the sowing game Tchoukaillon, which establishes a relationship between board vectors and move vectors that does not depend on actually playing the game. This allows for simpler proofs than currently appear in the literature for two key theorems, as well as a new method for constructing move vectors.We…

A well known result due to Laplace states the equivalence between two different ways of defining the determinant of a square matrix. We give here a short proof of this result, in a form that can be presented, in our opinion, at any level of undergraduate studies.

This note explains how Emil Artin's proof that row rank equals column rank for a matrix with entries in a field leads naturally to the formula for the nullity of a matrix and also to an algorithm for solving any system of linear equations in any number of variables. This material could be used in any course on matrix theory or linear algebra.

Cognitive diagnostic analyses have been advocated as methods that allow an assessment to function as a formative assessment to inform instruction. To use this approach, it is necessary to first identify the skills required for each item in the test, known as a Q-matrix. However, because the construct being tested and the underlying cognitive…

It is a routine matter for undergraduates to find eigenvalues and eigenvectors of a given matrix. But the converse problem of finding a matrix with prescribed eigenvalues and eigenvectors is rarely discussed in elementary texts on linear algebra. This problem is related to the "spectral" decomposition of a matrix and has important technical…

The aim of this article is to characterize the 2 x 2 matrices "X" satisfying X[superscript 2] = X + I and obtain some new identities concerning with Fibonacci and Lucas numbers. The recommendations regarding the teaching of the identities given in this article can be presented in two cases. The first is related to the pedagogical aspect. The…

We use the sum property for determinants of matrices to give a three-stage proof of an identity involving Fibonacci numbers. Cassini's and d'Ocagne's Fibonacci identities are obtained at the ends of stages one and two, respectively. Catalan's Fibonacci identity is also a special case.

A lively example to use in a first course in linear algebra to clarify vector space notions is the space of square matrices of fixed order with its subspaces of affine, coaffine, doubly affine, and magic squares. In this note, the projection theorem is illustrated by explicitly constructing the orthogonal projections (in closed forms) of any…

For over a decade it has been a common observation that a "fog" passes over the course in linear algebra once abstract vector spaces are presented. See [2, 3]. We show how this fog may be cleared by having the students translate "abstract" vector-space problems to isomorphic "concrete" settings, solve the "concrete" problem either by hand or with…

In this paper, two classes of graphs of arbitrary order are described which contain unique Hamiltonian cycles. All the graphs have mean vertex degree greater than one quarter the order of the graph. The Hamiltonian cycles are detailed, their uniqueness proved and simple rules for the construction of the adjacency matrix of the graphs are given.…