🧭 New here?
Take a guided tour of the site.

← all proofs

UNDER_REVIEW
Certificate under review. This legacy or incomplete artifact is retained for audit, but cannot carry public proof wording until its v1 replay contract validates.
Stored legacy claim for 2nd-order FS (μ=2) over Janowski S*[1,0]. Its proof wording is withheld pending a valid replayable v1 certificate.

What this rests on

The certificate reduces to these classical lemmas - each checkable by hand, independently of the engine.

  1. 1. Schur parametrisation is exact
    The Schur recursion maps the closed polydisc \(\overline{\mathbb D}^{m}\) exactly onto the admissible coefficient vectors \((a_2,\dots,a_{m+1})\) of the class. Ranging the Schur parameters over \(\overline{\mathbb D}^{m}\) therefore sweeps every member's coefficients — nothing admissible is missed and nothing spurious is added.
    Schur 1917; Foias–Frazho; Simon, OPUC.  ·  schur-onto-coefficient-body
  2. 2. Rotation normalisation
    The functional is weight-homogeneous under \(f(z)\mapsto e^{-i\theta}f(e^{i\theta}z)\), so its maximum is attained on the rotation-normalised slice \((\gamma_0\ge 0\) real\()\). This removes one real dimension and is verifiable by hand.
    Elementary weight homogeneity.  ·  rotation-reduction
  3. 3. Floating-point arithmetic is sound
    Every float64 operation in the interval evaluation is widened by its IEEE-754 forward-error bound, so each computed interval rigorously encloses the true real value. The numerics are a certified enclosure, not a heuristic estimate.
    IEEE-754 rounding; standard interval arithmetic.  ·  ieee754-forward-error
  4. 4. The box partition is complete
    Boxes are bisected at exactly representable midpoints, so the two children tile the parent with no gap and no overlap. The union of the certified leaf boxes is therefore provably the entire domain — coverage is exhaustive.
    Exact dyadic subdivision.  ·  bisection-partition

In the literature

No matching publication turned up via the registry's automated keyword + reconciliation search of the 1,067-paper corpus. That search is imperfect - it can miss a result published under a differently-named class (e.g. SL* vs lemniscate) - so treat this as unconfirmed, not a novelty claim. Confirm with a manual search before claiming priority.

dag engine   m = 3 Schur params  ·  3,907 boxes  ·  1,954 certified leaves
Reproduce & raw certificate

Reproduce: python3 -m gft.proofs prove janowski_A1_B0 fs2_mu2 "5/6" --slack 1e-06
Recheck: python3 -m gft.proofs recheck data/proofs/janowski_A1_B0__fs2_mu2.json

{
 "status": "PROVED",
 "engine": "dag",
 "statement": "max over S*(janowski_A1_B0) of |fs2_mu2| <= 5/6 + 1e-06",
 "class": "janowski_A1_B0",
 "functional": "fs2_mu2",
 "bound": "5/6",
 "slack": 1e-06,
 "target_sq_hex": "0x1.638e70d01f2e2p-1",
 "m": 3,
 "vars": [
  "x0",
  "x1",
  "x2",
  "x3",
  "x4",
  "x5",
  "x6"
 ],
 "boxes_processed": 3907,
 "n_leaves": 1954,
 "terms": [],
 "evaluator": {
  "type": "factored-dag",
  "definition": "gft/dag.py (classical factored Schur formulas; symbolically verified against the expanded derivation in tests/test_proofs.py)",
  "code_commit": "see matching prove event in data/proofs/audit.jsonl"
 },
 "lemmas": [
  "schur-onto-coefficient-body",
  "rotation-reduction",
  "ieee754-forward-error",
  "bisection-partition"
 ],
 "failure": null,
 "leaves_parts": [
  "data/proofs/janowski_A1_B0__fs2_mu2.w3.part0.npz",
  "data/proofs/janowski_A1_B0__fs2_mu2.w0.part0.npz",
  "data/proofs/janowski_A1_B0__fs2_mu2.w2.part0.npz",
  "data/proofs/janowski_A1_B0__fs2_mu2.w1.part0.npz",
  "data/proofs/janowski_A1_B0__fs2_mu2.final.npz"
 ],
 "sharp": {
  "class": "janowski_A1_B0",
  "functional": "fs2_mu2",
  "bound": "5/6",
  "slack": 1e-06,
  "bracket_lo": 0.8333333333333334,
  "bracket_hi": 0.8333343333333334,
  "extremal_gammas": [
   1.0,
   0.0,
   0.0
  ],
  "candidate": {
   "value_exact": "5/6",
   "value_float": 0.8333333333333334,
   "method": "declared bound"
  },
  "exact": true,
  "proven": false,
  "note": "Candidate exact constant recognised from the certified bracket and matched to the attained extremal value. Not a proof; sharp closure requires the second-variation certificate."
 }
}
↑↓ navigate↵ openesc closeall results
✦ 278 explorers have wandered the registry - thanks for stopping by. Tell us what you'd like to see →
Usage & privacy

We use first-party site metrics to improve navigation: page visits, internal clicks, search result counts (not search terms), and approximate active time. A random tab ID groups events for seven days; GPC/DNT turns this off. The separate visitor count uses a self-hosted pseudonymous fingerprint and also respects GPC/DNT.

💬 Feedback