The certificate reduces to these classical lemmas - each checkable by hand, independently of the engine.
schur-onto-coefficient-body
rotation-reduction
ieee754-forward-error
bisection-partition
This value over \(S^*(\varphi)\) is fixed by a published general theorem - Fekete–Szegő, \(|\gamma_2|\) and \(|A_3|\) by Ma & Minda (1994); the second Hankel determinant \(H_2(2)=(B_1/2)^2\) by Lee–Ravichandran–Supramaniam (2013). The registry re-certifies it mechanically - it is not a new result. See provenance & novelty.
Reproduce: python3 -m gft.proofs prove epicycloid_3 hankel2_2 "5/32" --slack 0.01
Recheck: python3 -m gft.proofs recheck data/proofs/epicycloid_3__hankel2_2.json
{
"status": "PROVED",
"engine": "dag",
"statement": "max over S*(epicycloid_3) of |hankel2_2| <= 5/32 + 0.01",
"class": "epicycloid_3",
"functional": "hankel2_2",
"bound": "5/32",
"slack": 0.01,
"target_sq_hex": "0x1.c4d6a161e4f75p-6",
"m": 3,
"vars": [
"x0",
"x1",
"x2",
"x3",
"x4",
"x5",
"x6"
],
"boxes_processed": 9983,
"n_leaves": 4992,
"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/epicycloid_3__hankel2_2.w1.part0.npz",
"data/proofs/epicycloid_3__hankel2_2.w3.part0.npz",
"data/proofs/epicycloid_3__hankel2_2.w2.part0.npz",
"data/proofs/epicycloid_3__hankel2_2.w0.part0.npz",
"data/proofs/epicycloid_3__hankel2_2.final.npz"
],
"sharp": {
"class": "epicycloid_3",
"functional": "hankel2_2",
"bound": "5/32",
"slack": 0.01,
"bracket_lo": 0.140625,
"bracket_hi": 0.16625,
"extremal_gammas": [
0.0,
1.0,
0.0
],
"candidate": {
"value_exact": "9/64",
"value_float": 0.140625,
"method": "attained extremal \u03c9=z\u00b2 (bracket_lo); moment-SOS-confirmed"
},
"exact": true,
"note": "Candidate = the rigorously attained extremal value (sharp.bracket_lo, at \u03c9=z\u00b2), confirmed sharp by moment-SOS (gft/sos.py, cross-checked 3 ways) and equal to the general second-Hankel value (B\u2081/2)\u00b2 for S*(\u03c6) (Lee\u2013Ravichandran\u2013Supramaniam 2013). The earlier candidate equalled the loose B&B bound and exceeded (B\u2081/2)\u00b2 \u2014 impossible as a sharp value. Rigorous enclosure (bound/slack) unchanged; exact-rational upper certificate still open (heavy box)."
}
}
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.