Redheffer matrix
Redheffer matrix
Main page

Redheffer matrix

logo
Community Hub0 subscribers
What are your thoughts?
Be the first to start a discussion here.
Be the first to start a discussion here.
Redheffer matrix

In mathematics, a Redheffer matrix, often denoted as studied by Redheffer (1977), is a square (0,1) matrix whose entries aij are 1 if i divides j or if j = 1; otherwise, aij = 0. It is useful in some contexts to express Dirichlet convolution, or convolved divisors sums, in terms of matrix products involving the transpose of the Redheffer matrix.

Since the invertibility of the Redheffer matrices are complicated by the initial column of ones in the matrix, it is often convenient to express where is defined to be the (0,1) matrix whose entries are one if and only if and . The remaining one-valued entries in then correspond to the divisibility condition reflected by the matrix , which plainly can be seen by an application of Mobius inversion is always invertible with inverse . We then have a characterization of the singularity of expressed by

If we define the function

then we can define the Redheffer (transpose) matrix to be the nxn square matrix in usual matrix notation. We will continue to make use this notation throughout the next sections.

The matrix below is the 12 × 12 Redheffer matrix. In the split sum-of-matrices notation for , the entries below corresponding to the initial column of ones in are marked in blue.

A corresponding application of the Mobius inversion formula shows that the Redheffer transpose matrix is always invertible, with inverse entries given by

where denotes the Moebius function. In this case, we have that the inverse Redheffer transpose matrix is given by

The determinant of the n × n square Redheffer matrix is given by the Mertens function M(n). In particular, the matrix is not invertible precisely when the Mertens function is zero (or is close to changing signs). As a corollary of the disproof of the Mertens conjecture, it follows that the Mertens function changes sign, and is therefore zero, infinitely many times, so the Redheffer matrix is singular at infinitely many natural numbers.

See all
User Avatar
No comments yet.