An eigenfunction is meant to be a solution of Dirichlet’s problem

where

is the Laplacian, is a bounded smooth domain in , and is a constant (i.e. the corresponding eigenvalue).

It is well known that the first eigenfunction is positive in , and all higher eigenfunctions must change sign.

Definition. The nodal set of an eigenfunction is defined to be.

To gain a better understanding of nodal sets let us consider a few examples.

**Example 1**. Let us consider the case when where the first four eigenfunctions had been shown.

Red points are nodal sets. In this case, we simply call nodal nodes. This comes from the fact that all eigenvalues and eigenfunctions are already known

.

**Example 2**. Let us consider the case when . It is known that the eigenfunctions

and eigenvalues are

.

Functions are usually denoted by . We then write

.

Since we know what the eigenvalues and functions are, we can tabulate them in order of increasing eigenvalues. For example, the first 4 pairs of eigenvalue and eigenfunction are of the following form

- , ,
- , ,
- , ,
- , ,

where are appropriate coefficients. Let take all coefficients to be 1.

- For we have the following picture

Again, it is clear to see that the first eigenfunction is positive in the domain.

- For we have

In this case, the nodal set is a segment connected points and .

- For , we have

In this case, the nodal set is just a cross symbol.

- For , we have

In this case, the nodal set is just a small closed curve which is almost round.

**Remark**. In the pictures above, the way to recognize nodal sets is to look at part of surface which is white. For the reader’s convenience, we summarize all above nodal sets

If and then the nodal set changes. We have several nodal sets for the fourth eigenfunction as shown below.

So, how many regions can the nodal set divide a general domain into (assuming is connected)? The following theorem limits the possibilities.

Theorem(Courant Nodal Domain Theorem).

- The first eigenfunction corresponding to the smallest eigenvalue cannot have any nodes.
- For , corresponding to the th eigenvalue counting multiplicity, divides the domain into at least 2 and at most pieces.

Concerning part 2 of the theorem, the bounds 2 and are best possible as the following example shows.

The nodal set for

divides the square into 12 subregions. However, nodal set for

divides the square into 2 subregions where is near 1.

We do not know the topology of the nodal set in general, even for the simplest case . A conjecture about the nodal line (i.e. when ) of a second eigenfunction states that

Conjecture. The nodal line of a second eigenfunction divides the domain by intersecting its boundary at exactly two points if is convex.

This conjecture was partially answered by C.S. Lin [here] in 1987 when when the domain is symmetric under a rotation with angle , where are positive integers.

It is worth noticing that the nodal line has been recently used in a work of N. Ghoussoub and C.S. Lin [here] to further improve the Moser-Onofri-Aubin inequality.

Most of text in this entry comes from a book entitled Partial Differential Equations [Chapter 10] by Strauss.

## Leave a Reply