Generator

directed cycle on 18: a Laplacian whose eigenvalues need a plane

One function in the digraph library, called 21 times across 2 essays. Below: what it draws at its defaults, what it draws at every value an essay asks for, the 13 claims it put to the test while drawing them, and where it stands against the rule this site is named for.

At its defaults it draws directed cycle on 18: a laplacian whose eigenvalues need a plane. The spectrum of L = D_out − A for a directed cycle on 18, drawn in the complex plane. The row sums are exactly zero — measured at 0, not at the rounding level — so 1 is a right null vector and 0 is an eigenvalue, computed here at 7.53·10⁻¹⁶. The column sums are not: the worst is 0, and the left null vector is the stationary distribution rather than 1. The largest imaginary part is 0.9848 and the matrix is 100 per cent asymmetric in the Frobenius norm — and those two numbers are not the same statement: asymmetry permits a complex spectrum and does not force one, which this family demonstrates at small sizes by being asymmetric and real. The ring is the closed form 1 − exp(2πik/n), which every computed eigenvalue lands on to 1.3·10⁻¹⁵.

directed-spectrum is one function in lib/figures/digraph.js — arrows — a laplacian that is not symmetric, and the walk that has to be computed before it can be. Everything below came out of it during this build, at arguments taken from the essays rather than invented for this page. A figure here is the figure a reader meets in an essay, and if the generator changes, this page changes with it.

At its defaults

Drawn even though every essay passes arguments — which on this site is every essay, at 100% of placements since the standard pass. A default nothing exercises is a trap for the next essay to call this with none, and this is the page where a default that has drifted from the figures around it becomes visible.

directed cycle on 18: a Laplacian whose eigenvalues need a planeThe spectrum of L = D_out − A for a directed cycle on 18, drawn in the complex plane. The row sums are exactly zero — measured at 0, not at the rounding level — so 1 is a right null vector and 0 is an eigenvalue, computed here at 7.53·10⁻¹⁶. The column sums are not: the worst is 0, and the left null vector is the stationary distribution rather than 1. The largest imaginary part is 0.9848 and the matrix is 100 per cent asymmetric in the Frobenius norm — and those two numbers are not the same statement: asymmetry permits a complex spectrum and does not force one, which this family demonstrates at small sizes by being asymmetric and real. The ring is the closed form 1 − exp(2πik/n), which every computed eigenvalue lands on to 1.3·10⁻¹⁵.Re λIm λwhat survives the arrowsvertices18arcs18worst row sum0worst column sum0largest |Im λ|0.98asymmetry1the null vector is still exactand nothing else about the spectrum is real

The spectrum of L = D_out − A for a directed cycle on 18, drawn in the complex plane. The row sums are exactly zero — measured at 0, not at the rounding level — so 1 is a right null vector and 0 is an eigenvalue, computed here at 7.53·10⁻¹⁶. The column sums are not: the worst is 0, and the left null vector is the stationary distribution rather than 1. The largest imaginary part is 0.9848 and the matrix is 100 per cent asymmetric in the Frobenius norm — and those two numbers are not the same statement: asymmetry permits a complex spectrum and does not force one, which this family demonstrates at small sizes by being asymmetric and real. The ring is the closed form 1 − exp(2πik/n), which every computed eigenvalue lands on to 1.3·10⁻¹⁵.

family: "blocks", n: 24

The arguments are the ones A conductance the arcs do not measure passes. A value drawn at the generator's defaults instead would be a picture no essay asked for and no assertion has been run against.

two blocks with 1 arc back: a Laplacian whose eigenvalues need a planeThe spectrum of L = D_out − A for a two blocks with 1 arc back, drawn in the complex plane. The row sums are exactly zero — measured at 0, not at the rounding level — so 1 is a right null vector and 0 is an eigenvalue, computed here at 1.03·10⁻¹⁵. The column sums are not: the worst is 2, and the left null vector is the stationary distribution rather than 1. The largest imaginary part is 0.1864 and the matrix is 24 per cent asymmetric in the Frobenius norm — and those two numbers are not the same statement: asymmetry permits a complex spectrum and does not force one, which this family demonstrates at small sizes by being asymmetric and real. There is no closed form for this family; the degenerate check is the symmetric one, where every imaginary part is exactly zero.Re λIm λwhat survives the arrowsvertices24arcs53worst row sum0worst column sum2largest |Im λ|0.19asymmetry0.24the null vector is still exactand nothing else about the spectrum is real

The spectrum of L = D_out − A for a two blocks with 1 arc back, drawn in the complex plane. The row sums are exactly zero — measured at 0, not at the rounding level — so 1 is a right null vector and 0 is an eigenvalue, computed here at 1.03·10⁻¹⁵. The column sums are not: the worst is 2, and the left null vector is the stationary distribution rather than 1. The largest imaginary part is 0.1864 and the matrix is 24 per cent asymmetric in the Frobenius norm — and those two numbers are not the same statement: asymmetry permits a complex spectrum and does not force one, which this family demonstrates at small sizes by being asymmetric and real. There is no closed form for this family; the degenerate check is the symmetric one, where every imaginary part is exactly zero.

family: "strong", n: 30

The arguments are the ones A conductance the arcs do not measure passes. A value drawn at the generator's defaults instead would be a picture no essay asked for and no assertion has been run against.

random strongly connected on 30: a Laplacian whose eigenvalues need a planeThe spectrum of L = D_out − A for a random strongly connected on 30, drawn in the complex plane. The row sums are exactly zero — measured at 0, not at the rounding level — so 1 is a right null vector and 0 is an eigenvalue, computed here at 5.98·10⁻¹⁶. The column sums are not: the worst is 3, and the left null vector is the stationary distribution rather than 1. The largest imaginary part is 1.174 and the matrix is 70 per cent asymmetric in the Frobenius norm — and those two numbers are not the same statement: asymmetry permits a complex spectrum and does not force one, which this family demonstrates at small sizes by being asymmetric and real. There is no closed form for this family; the degenerate check is the symmetric one, where every imaginary part is exactly zero.Re λIm λwhat survives the arrowsvertices30arcs72worst row sum0worst column sum3largest |Im λ|1.2asymmetry0.7the null vector is still exactand nothing else about the spectrum is real

The spectrum of L = D_out − A for a random strongly connected on 30, drawn in the complex plane. The row sums are exactly zero — measured at 0, not at the rounding level — so 1 is a right null vector and 0 is an eigenvalue, computed here at 5.98·10⁻¹⁶. The column sums are not: the worst is 3, and the left null vector is the stationary distribution rather than 1. The largest imaginary part is 1.174 and the matrix is 70 per cent asymmetric in the Frobenius norm — and those two numbers are not the same statement: asymmetry permits a complex spectrum and does not force one, which this family demonstrates at small sizes by being asymmetric and real. There is no closed form for this family; the degenerate check is the symmetric one, where every imaginary part is exactly zero.

family: "balanced", n: 24

The arguments are the ones A conductance the arcs do not measure passes. A value drawn at the generator's defaults instead would be a picture no essay asked for and no assertion has been run against.

balanced digraph on 24: a Laplacian whose eigenvalues need a planeThe spectrum of L = D_out − A for a balanced digraph on 24, drawn in the complex plane. The row sums are exactly zero — measured at 0, not at the rounding level — so 1 is a right null vector and 0 is an eigenvalue, computed here at 3.89·10⁻¹⁶. The column sums are not: the worst is 0, and the left null vector is the stationary distribution rather than 1. The largest imaginary part is 1.505 and the matrix is 82.5 per cent asymmetric in the Frobenius norm — and those two numbers are not the same statement: asymmetry permits a complex spectrum and does not force one, which this family demonstrates at small sizes by being asymmetric and real. There is no closed form for this family; the degenerate check is the symmetric one, where every imaginary part is exactly zero.Re λIm λwhat survives the arrowsvertices24arcs45worst row sum0worst column sum0largest |Im λ|1.5asymmetry0.82the null vector is still exactand nothing else about the spectrum is real

The spectrum of L = D_out − A for a balanced digraph on 24, drawn in the complex plane. The row sums are exactly zero — measured at 0, not at the rounding level — so 1 is a right null vector and 0 is an eigenvalue, computed here at 3.89·10⁻¹⁶. The column sums are not: the worst is 0, and the left null vector is the stationary distribution rather than 1. The largest imaginary part is 1.505 and the matrix is 82.5 per cent asymmetric in the Frobenius norm — and those two numbers are not the same statement: asymmetry permits a complex spectrum and does not force one, which this family demonstrates at small sizes by being asymmetric and real. There is no closed form for this family; the degenerate check is the symmetric one, where every imaginary part is exactly zero.

family: "cycle", n: 24

The arguments are the ones A conductance the arcs do not measure passes. A value drawn at the generator's defaults instead would be a picture no essay asked for and no assertion has been run against.

directed cycle on 24: a Laplacian whose eigenvalues need a planeThe spectrum of L = D_out − A for a directed cycle on 24, drawn in the complex plane. The row sums are exactly zero — measured at 0, not at the rounding level — so 1 is a right null vector and 0 is an eigenvalue, computed here at 2.37·10⁻¹⁶. The column sums are not: the worst is 0, and the left null vector is the stationary distribution rather than 1. The largest imaginary part is 1 and the matrix is 100 per cent asymmetric in the Frobenius norm — and those two numbers are not the same statement: asymmetry permits a complex spectrum and does not force one, which this family demonstrates at small sizes by being asymmetric and real. The ring is the closed form 1 − exp(2πik/n), which every computed eigenvalue lands on to 1.3·10⁻¹⁵.Re λIm λwhat survives the arrowsvertices24arcs24worst row sum0worst column sum0largest |Im λ|1asymmetry1the null vector is still exactand nothing else about the spectrum is real

The spectrum of L = D_out − A for a directed cycle on 24, drawn in the complex plane. The row sums are exactly zero — measured at 0, not at the rounding level — so 1 is a right null vector and 0 is an eigenvalue, computed here at 2.37·10⁻¹⁶. The column sums are not: the worst is 0, and the left null vector is the stationary distribution rather than 1. The largest imaginary part is 1 and the matrix is 100 per cent asymmetric in the Frobenius norm — and those two numbers are not the same statement: asymmetry permits a complex spectrum and does not force one, which this family demonstrates at small sizes by being asymmetric and real. The ring is the closed form 1 − exp(2πik/n), which every computed eigenvalue lands on to 1.3·10⁻¹⁵.

family: "cycle", n: 18

The arguments are the ones A Laplacian that is not symmetric passes. A value drawn at the generator's defaults instead would be a picture no essay asked for and no assertion has been run against.

directed cycle on 18: a Laplacian whose eigenvalues need a planeThe spectrum of L = D_out − A for a directed cycle on 18, drawn in the complex plane. The row sums are exactly zero — measured at 0, not at the rounding level — so 1 is a right null vector and 0 is an eigenvalue, computed here at 7.53·10⁻¹⁶. The column sums are not: the worst is 0, and the left null vector is the stationary distribution rather than 1. The largest imaginary part is 0.9848 and the matrix is 100 per cent asymmetric in the Frobenius norm — and those two numbers are not the same statement: asymmetry permits a complex spectrum and does not force one, which this family demonstrates at small sizes by being asymmetric and real. The ring is the closed form 1 − exp(2πik/n), which every computed eigenvalue lands on to 1.3·10⁻¹⁵.Re λIm λwhat survives the arrowsvertices18arcs18worst row sum0worst column sum0largest |Im λ|0.98asymmetry1the null vector is still exactand nothing else about the spectrum is real

The spectrum of L = D_out − A for a directed cycle on 18, drawn in the complex plane. The row sums are exactly zero — measured at 0, not at the rounding level — so 1 is a right null vector and 0 is an eigenvalue, computed here at 7.53·10⁻¹⁶. The column sums are not: the worst is 0, and the left null vector is the stationary distribution rather than 1. The largest imaginary part is 0.9848 and the matrix is 100 per cent asymmetric in the Frobenius norm — and those two numbers are not the same statement: asymmetry permits a complex spectrum and does not force one, which this family demonstrates at small sizes by being asymmetric and real. The ring is the closed form 1 − exp(2πik/n), which every computed eigenvalue lands on to 1.3·10⁻¹⁵.

What it checked while drawing

Every figure above asserted its own claims on the way to being drawn, and a claim that failed would have failed the build rather than drawn a wrong picture. Those assertions used to leave no trace at all: a passing one returned true and the only evidence the figure had checked anything was that nothing crashed. The list below is what they actually said, collected by running this generator with an observer installed — not a description of what it is believed to check.

13 distinct claims across 6 sets of arguments, grouped below by shape — because most of them are one sentence with a different number in it, and how many separate times that sentence was put to the test is the informative part.

a digraph small enough to draw a spectrum of

a digraph with at least two vertices

a family the library builds

a symmetric digraph's Laplacian has a real spectrum

and an asymmetric one is permitted a complex spectrum, which the directed cycle attains

arcs inside the vertex set

every row of the directed Laplacian sums to exactly zero

matmul shapes agree

no repeated arc

no self-loops

positive arc weights

the assertion refuses a counterexample

zero is an eigenvalue, because 1 is still a right null vector

Against the rule

The rule does not apply to it. It factorises nothing, so there is no residual it could be withholding. That is worth stating rather than leaving blank: a site that reported the rule as satisfied by every generator would be counting mostly generators the rule never reached.

Across the library: the rule bites on 214 of 397 generators — 194 print a residual and 20 are exempt with a published reason; 183 factorise nothing. Read from lib/residual-rule.js, which is the same body the gate enforces from, and the gate's last check fails the build if this page and it disagree about any generator.

Where it is called

Changing this generator changes every figure on this list. That is what makes the list worth publishing rather than keeping in a check script.

The whole library · All essays · What must fail