cert-machine · spectral geometry · rebuilt from certificates at every build

Hot spots on a convex trapezoid: the extrema stay on the boundary

Not one domain but a CONTINUUM of them: for every c in [0.845, 0.85] the convex trapezoid A(0,0) B(1,0) C(c,9/10) D(1/4,9/10) — no symmetry axis, outside every analytically proven class — has a simple second Neumann eigenvalue whose eigenfunction attains its extrema on the boundary only. To our knowledge the first certified hot-spots result for a positive-measure FAMILY rather than a single specimen. The domain below, c = 17/20, is the right endpoint and is where the program started. The domain treated in full below is that endpoint: a convex trapezoid with no symmetry axis, whose second Neumann eigenfunction attains its maximum and its minimum on the boundary only. And more precisely: the maximum is attained AT VERTEX A, and only there — certified, with φ̂(A) ∈ [2.126029, 2.193158]. One domain, one theorem, one corollary: μ₁ is simple, its enclosure is [12.020976137, 12.022398349], and every interior point is excluded by a certified cell of an exact partition. Floats propose; interval and rational arithmetic decide.

the domain
A B C D
(0,0) · (1,0) · (17/20, 9/10) · (1/4, 9/10) — exact rationals; convex, side slopes 6 and 18/5, no symmetry axis, not a lip domain
μ₁ enclosure, width
1.43 × 10⁻³
μ₁ ∈ [12.020976137, 12.022398349], simple (certified spectral gap: μ₂ ≥ 13.9559)
the partition
6,962 cells
core 4690 + collar 2272 on the 1/100 grid, classes decided in exact rationals; four corner sectors close the rest — zero surviving cells
the band
c ∈ [0.845, 0.85]
17 chunks tiling the interval with shared endpoints and no gap, 738 σ-cells inside them — both ladders re-derived by an independent auditor; μ₁ ≥ 11.85157 and μ₂ ≥ 13.90773 uniformly, so μ₁ is simple for every c
band margins
2.47 × 10⁻⁴ / 6.41 × 10⁻⁴
the thinnest zone margins over all 738 cells of all 17 chunks, max and min side, as the audit records them; zero collar survivors outside the corner windows anywhere
trust base
2 inputs
two quoted lemmas of Liu (arXiv:1808.08148, pinned sha256 fb867aa5ab93…), named in every record, and the textbook facts the records list beside them (see what the theorem rests on, below); everything else re-derives here
how to read the marks

Every number on this page is decided by interval or exact rational arithmetic unless it is marked, and every printed bound is rounded outward. Underlined dashed: nothing decided it — where the float steering saw the boundary minimum, a float angle, a wall-clock time. The theorem holds given two lemmas of Liu, cited and pinned; what it rests on, and how far each premise was checked, is listed under the certificate chain.

decided
exact arithmetic backs it
computed
float, or a number someone printed; nothing decided it

Machine-derived; published from this repository; not peer-reviewed; not independently rerun. The claim is fenced: Judge–Mondal proved all triangles (Annals 2020, after partial acute-triangle results, Siudeja arXiv:1308.3005), lip domains are Atar–Burdzy, certain non-convex L-tiled polygons are Hatcher (arXiv:2405.19508), and symmetric quadrangle subcases are Deng–Gui–Jiang–Yang–Yao–Zou (arXiv:2604.19003) — this domain sits outside each class. In the other direction, in sufficiently high dimension the conjecture is FALSE for convex sets (de Dios Pont, arXiv:2412.06344), so the planar convex case is exactly where it remains expected — and where this domain lives. A validated-numerics route to acute triangles was developed in the Polymath7 project before the analytic triangle proof; it is lineage here, not a fence. The claim is ONE domain, never the quadrilateral conjecture. Race watch: arXiv, weekly. Every number on this page comes from a VERIFIED record in certs/ember-*.json; the chain re-runs in about 2 minutes (its records' own timings).

the zone map

Every interior point is somebody's problem

The interior is partitioned on the 1/100 grid, and the classes are decided in EXACT RATIONALS — depth is concave on a convex domain, so a cell's minimum depth sits at a corner and the core test is exact; a cell goes to a corner sector only when it lies ENTIRELY inside that vertex's 0.11-disk (the max-corner test is exact because distance is convex); domain membership is a separating-axis decision. The theorem record re-decides the whole partition at assembly time, and this figure is drawn from those same decisions — not from an artist's sketch.

A (0, 0) B (1, 0) C (17/20, 9/10) D (1/4, 9/10) w₊ · φ̂ ≥ 2.1260 w₊ · φ̂ ≥ 2.1260 w₋′ · −φ̂ ≥ 1.9938 w₋′ · −φ̂ ≥ 1.9938 boundary max (at A) boundary min (float steering) → CORE — 4690 cells, depth ≥ 3/40 everywhere (killed by witness vs sup + solid-mean bound) COLLAR — 2272 cells (killed with reflected boundary bounds) CORNER SECTORS r ≤ 0.11 — 498 cells, closed by the four tip lemmas
Core cells die by comparison against the interior witnesses (diamonds): certified sup + solid-mean error stays below the witness value on both sides (margins at least 3.93 × 10⁻² max side, 5.61 × 10⁻⁴ min side). Collar cells die the same way with REFLECTED error bounds across their nearest open edge. The four corner sectors, the brightest grey, are where the corner expansions take over; they are decided too, so they are drawn as a body and not hatched, which on this site marks a void. Zero cells survive anywhere.
the certificate chain

Six stages, two cross-checks, one record each

Every stage reads its inputs from the upstream record — no constant travels by hand — and each is a falsifiable claim: the batteries mutate a vertex, forge the kernel norm, flip the ladder identity's sign, inflate the flux, and the chain must refuse each one. The two literature inputs (Liu's framework theorem and the Crouzeix–Raviart constant 0.1893·h_K) are assumptions, named in every record's trust base, with the source PDF pinned and re-hashed at certify time.

stagewhat it certifiesthe numberrecord
1 · spectrumtwo-sided localization; μ₁ SIMPLE by the certified gapμ₁ ∈ [11.892662, 12.041820], μ₂ ≥ 13.955936certs/ember-spectrum.json
2 · defectthe frozen Helmholtz trial's boundary flux, by interval Taylor jets‖∂νu‖ ≤ 1.24 × 10⁻⁵certs/ember-defect.json
3 · eigenpairμ₁ tightened more than 104×; the eigenfunction enclosureμ₁ ∈ [12.020976137, 12.022398349] · ‖u − c₁φ₁‖ ≤ 6.54 × 10⁻⁵certs/ember-eigenpair.json
4 · pointwisesolid-mean lemma (I₀ = 5/48 exact); witnesses; every core cell killedφ̂(w₊) ≥ 2.126029 · −φ̂(w₋′) ≥ 1.993810certs/ember-pointwise.json
5 · collarevery collar cell killed with reflected boundary bounds2272 cells, 0 survivorscerts/ember-collar.json
6 · cornersthe four tip sectors, by certified corner expansionsb-coefficients enclosed at TWO annuli; all four tips closedcerts/ember-corner.json
crossindependent re-derivations: I₀ rational, C_tr on bigfloat, μ₁ upper on a P1 basisC_tr ∈ [2.6426189449, 2.6426189450] · P1 upper 12.0642certs/ember-cross.json
theoremchain consistency + the partition re-decided in rationals + assembly23 checks, all greencerts/ember-theorem.json

What the theorem rests on, as every record's trust base names it, in the order the chain uses it:

  1. assumed
    Liu's framework theorem (Thm 2.4, 2015), behind every lower eigenvalue bound as quoted in You–Xie–Liu, arXiv:1808.08148 §2; the PDF pinned by sha256 (fb867aa5ab93…) and re-hashed at certify time; read, not machine-checked
  2. assumed
    The Crouzeix–Raviart interpolation constant 0.1893·h_K Liu's Lemma 3.2, quoted on p. 8 of the same pin; read
  3. assumed
    Neumann separation in a sector, H¹ regularity, Green's identity, the spectral theorem, Courant textbook facts, listed in every record's trust base (“classical facts”); H¹ regularity is what excludes the singular Bessel family at the corners

Every stage is interval or exact rational arithmetic over these premises, and the record walk and live re-proofs of instruments/hotspots/battery.js ran at this build; the weakest premise is assumed: two cited lemmas and the textbook facts, which no machine here checked.

the corner sectors

The tips, and the ladder identity

In each corner sector the eigenfunction is EXACTLY a Bessel–Fourier series φ̂ = Σ b_k J_{kν}(√μ₁ r) cos(kνθ) (Neumann separation; H¹ regularity excludes the singular family). The b-coefficients are certified by annulus L² extraction and — the chain's most delicate step — re-extracted at a SECOND annulus: the two enclosures of every coefficient must intersect, and do.

cornerb₀b₁b₂value range on the tipthe argument
A[2.109, 2.194][2.682, 2.988][-2.974, 12.761][2.015, 2.194]max: ∂rφ̂ < 0 (worst ≤ −4.98 × 10⁻²) · min: value
B[0.831, 0.878][-4.596, -4.273][0.319, 6.552][0.756, 0.897]value kill, both sides
C[-2.021, -1.978][-2.046, -1.893][-5.305, -3.679][-2.027, -1.846]max: value · min: |∇φ̂| > 0 on the sector + φ̂_nn ≥ 13.0 on the wedge
D[-1.571, -1.546][3.418, 3.634][-1.525, -0.364][-1.665, -1.351]value kill, both sides

At corner C — where the float steering puts the boundary minimum, 0.0195 from the vertex — the wedge along the top edge is closed by normal monotonicity, and the second tangential derivative comes from the Bessel ladder:

∂t²[J_ν(kr)cos(νθ)] = (k²/4)[ J_{ν+2}cos((ν+2)θ) + J_{ν−2}cos((ν−2)θ) − 2 J_ν cos(νθ) ]

The polar-split pieces diverge individually like r^{ν−2} with cancelling signs interval arithmetic cannot see; the ladder form is exact and sign-explicit — and the singular term arrives with b₁ < 0 (certified at both annuli), so it HELPS: φ̂_nn ≥ 13.03 on the wedge from r = 0.12 down to r = 10⁻⁶, and ≥ 11.64 inside r ≤ 10⁻⁶; and the exact second-order Taylor from the Neumann edge (the first-order term vanishes by the boundary condition) forces every interior wedge point strictly above the boundary minimum. J_{ν−2} at ν − 2 ≈ −0.19 is a NEGATIVE-ORDER Bessel evaluation — the reason the instrument layer carries fractional and negative orders with their own falsifier battery.

the corollary, and its open twin

The hot spot is vertex A — certified. The witness w₊ sits inside A's sector (decided in exact rationals); ∂rφ̂ < 0 on the whole punctured sector means φ̂ strictly decreases along every ray from A, so φ̂(A) > φ̂(w₊) ≥ 2.126029; and every point outside the sector — core, collar, tips B/C/D — is certified strictly below that. At the vertex the expansion collapses to φ̂(A) = b₀(A), so φ̂(A) ∈ [2.126029, 2.193158]. For triangles, extrema-only-at-vertices is Judge–Mondal's refinement; the maximum-side analogue now holds, certified, for this quadrilateral.

The cold spot is an open question of enclosure width. φ̂(C) = b₀(C) ∈ [-2.0204, -1.9789] overlaps the observed boundary minimum (float −1.9998, sitting 0.0195 from C along the top edge). Whether the minimum is at vertex C or strictly inside the edge is undecided; a tighter corner extraction would decide it — and an off-vertex answer would contrast with the triangle behaviour, where extrema occur only at vertices.

why these numbers stand as they do
  • computed — float steering — the record says "no claim": computed, not decided
  • computed — π over the interior angle at C, in floats: computed, not decided
the method

Rules the instruments enforce

§B · the band

From one domain to a continuum

what is certifiedvaluewhy it is the load-bearing part
the intervalc ∈ [0.845, 0.85]a positive-measure family, not a point — the uniqueness wall is crossed on an interval
chunk ladder17 chunks, no gapshared endpoints, re-derived here; a gap of 1e-12 would make the interval claim false
σ-cell ladder738 cells, no gapevery certified quantity is per-cell, so the cells must tile [−1,0] in each stage too
uniform simplicityμ₁ ≥ 11.85157, μ₂ ≥ 13.90773the gap never closes, so μ₁ stays simple for every c and the eigenfunction is well defined
thinnest margins2.47 × 10⁻⁴ / 6.41 × 10⁻⁴max and min side, worst over every cell of every chunk — both strictly positive
collar survivors outside the corner windows0zero, everywhere; the corners are closed by exact local expansions instead
tip C genericitysup b₁ ≤ -0.8790 < 0the named condition the specimen proof leaned on, re-checked on all 17 chunks by corner position, not by sign
zero-width cells found51an audit finding, not in the producer's summary: cells the σ-refinement emitted at zero width. They certify an empty set, so they cannot affect the covering — and the covering is complete without them in every chunk and every stage

An interval theorem is a union of chunk theorems, and the way such a union fails is almost never arithmetic — it is COVERING. Two ladders carry the whole result and neither is visible inside any single certificate: the chunks must tile the interval, and inside each chunk the σ-cells must tile [−1,0] in every stage that reports per-cell numbers. Both are re-derived here from the stage records by instruments/emberband/verify-band.js, which shares no code with the producer, and the battery keeps eight red controls that each break the band in a different realistic way — a removed chunk, an endpoint nudged by 1e-5, one missing σ-cell out of 738, a single margin at −1e-9, one escaped collar survivor, a dropped stage, tip C losing its sign, and a ladder that tiles the wrong interval. All 8 must fire or the page does not build: this build ran it (24 checks, 8/8 red controls fired).

The audit also turned up something the producing summary does not mention: 51 of the σ-cells are zero-width, emitted where the ratio-1.3 refinement toward σ = 0 bottoms out and duplicates a shared endpoint. They certify an empty set, so they cannot bridge a gap or affect the conclusion — and the auditor confirms the remaining cells still tile [−1,0] in every chunk and every stage. It is reported rather than dropped because a certificate covering nothing is worth counting, and because the check that excludes them is also the check that stops one from papering over a real hole.

Scope, stated plainly. The six-stage chain was executed on the bench that produced it, not re-executed here — about 10 hours, on the producer's own figure in the band record. What this page adds is the independent audit: the covering ladders and every band-wide value re-derived from per-cell data by a checker that shares no code with the producer, over records sha-pinned in corpus/emberband. That is the genre of this repository's lower-bound audit, not of its from-scratch theorems. The convex-quadrilateral conjecture itself remains open: this is a family, not the census.

What the band rests on, beyond the premises the specimen names above:

  1. assumed
    The 85 stage records, as the producer's bench wrote them adopted: their covering and every band-wide value are re-derived here by an auditor that shares no code with the producer, but the per-cell interval arithmetic inside them is not re-run here

The audit is exact over what the records hold; the weakest premise is assumed: the per-cell arithmetic of a chain this repository did not re-execute.

why these numbers stand as they do
  • computed — a wall-clock time, measured: not decided
reproduce

Reproduce

The whole chain re-runs from this repository, deterministically:

node tools/run-ember-chain.js            # all 8 stages, ~2 min, records in certs/
node tools/run-ember-chain.js corner     # any single stage
node instruments/hotspots/battery.js     # record walk, live re-proofs: 32 checks, 8 reds
node instruments/ivspecial/battery.js    # the Γ/Bessel layer: 75 checks, 6 reds
make test                                # every battery in the machine

Sources: instruments/hotspots/ + instruments/ivspecial/ · literature input pinned at corpus/sources/liu2018_arxiv-1808-08148.pdf with its transcription beside it. Refutations and independent re-runs are invited: carlos@carlostoledo.co.

cert-machine · built 2026-10-30 · git d049222f · every number from a VERIFIED record · Liu pin fb867aa5ab93… · archived: DOI 10.5281/zenodo.22225860

all reports · the machine

contact

Write to Carlos

Sent by Web3Forms to Carlos’s inbox; nothing stored here.

Or write to carlos@carlostoledo.co, or open the public pilot form on GitHub.