markov-blowup

At its defaults it draws the markov parameters of a 24-state model: 10 exact zeros, then thirty orders. |CAᵏB| against k. The first 10 are exactly zero — not small, zero, with no rounding in them — because A is a three-point stencil and information takes one step per grid point to travel the 10 points from the actuator to the sensor. After that they grow like ‖A‖ᵏ with ‖A‖ = (n+1)² = 625, reaching a ratio of 2.37·10³³ across the run. A Hankel matrix of these numbers has a dynamic range no rank decision can see through, which is why the textbook route to the McMillan degree returns the wrong integer while the route that reads only samples of H returns the right one.

markov-blowup is one function in lib/figures/lti.js — a model that is a rational function — the degree that is a rank, by two routes that disagree. 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.

|CAᵏB| against k. The first 10 are exactly zero — not small, zero, with no rounding in them — because A is a three-point stencil and information takes one step per grid point to travel the 10 points from the actuator to the sensor. After that they grow like ‖A‖ᵏ with ‖A‖ = (n+1)² = 625, reaching a ratio of 2.37·10³³ across the run. A Hankel matrix of these numbers has a dynamic range no rank decision can see through, which is why the textbook route to the McMillan degree returns the wrong integer while the route that reads only samples of H returns the right one.

|CAᵏB| against k. The first 10 are exactly zero — not small, zero, with no rounding in them — because A is a three-point stencil and information takes one step per grid point to travel the 10 points from the actuator to the sensor. After that they grow like ‖A‖ᵏ with ‖A‖ = (n+1)² = 625, reaching a ratio of 2.37·10³³ across the run. A Hankel matrix of these numbers has a dynamic range no rank decision can see through, which is why the textbook route to the McMillan degree returns the wrong integer while the route that reads only samples of H returns the right one.

|CAᵏB| against k. The first 4 are exactly zero — not small, zero, with no rounding in them — because A is a three-point stencil and information takes one step per grid point to travel the 4 points from the actuator to the sensor. After that they grow like ‖A‖ᵏ with ‖A‖ = (n+1)² = 81, reaching a ratio of 4.59·10²³ across the run. A Hankel matrix of these numbers has a dynamic range no rank decision can see through, which is why the textbook route to the McMillan degree returns the wrong integer while the route that reads only samples of H returns the right one.

|CAᵏB| against k. The first 20 are exactly zero — not small, zero, with no rounding in them — because A is a three-point stencil and information takes one step per grid point to travel the 20 points from the actuator to the sensor. After that they grow like ‖A‖ᵏ with ‖A‖ = (n+1)² = 2401, reaching a ratio of 2.82·10⁴⁰ across the run. A Hankel matrix of these numbers has a dynamic range no rank decision can see through, which is why the textbook route to the McMillan degree returns the wrong integer while the route that reads only samples of H returns the right one.

|CAᵏB| against k. The first 6 are exactly zero — not small, zero, with no rounding in them — because A is a three-point stencil and information takes one step per grid point to travel the 6 points from the actuator to the sensor. After that they grow like ‖A‖ᵏ with ‖A‖ = (n+1)² = 289, reaching a ratio of 2.01·10²⁹ across the run. A Hankel matrix of these numbers has a dynamic range no rank decision can see through, which is why the textbook route to the McMillan degree returns the wrong integer while the route that reads only samples of H returns the right one.

|CAᵏB| against k. The first 12 are exactly zero — not small, zero, with no rounding in them — because A is a three-point stencil and information takes one step per grid point to travel the 12 points from the actuator to the sensor. After that they grow like ‖A‖ᵏ with ‖A‖ = (n+1)² = 1089, reaching a ratio of 9.6·10³⁵ across the run. A Hankel matrix of these numbers has a dynamic range no rank decision can see through, which is why the textbook route to the McMillan degree returns the wrong integer while the route that reads only samples of H returns the right one.

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.

7 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.

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 192 of 346 generators — 174 print a residual and 18 are exempt with a published reason; 154 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.