Read the existing enclosure with a minimum of sixteen coefficient bits.
Equations
- Hex.QAdjoin.SignApprox.initial? generator value = Hex.QAdjoin.ballSign? (Hex.PolyQuot.evalRatBall value.coeffs generator.rep.val.square (max 16 generator.rep.val.square.prec))
Instances For
A modest absolute-precision probe before constructing an evaluation eliminant.
Equations
- Hex.QAdjoin.SignApprox.refined? generator value = Hex.QAdjoin.ballSign? (Hex.PolyQuot.approx value generator.rep ⋯ 32).snd
Instances For
An integer polynomial vanishing at the selected coordinate value.
Equations
- Hex.QAdjoin.SignApprox.eliminant generator value = Hex.PolyQuot.Roots.normEliminant (Hex.DensePoly.ofList [-value, 1])
Instances For
The finite reciprocal-Cauchy endpoint. Approximation guard bits already absorb Horner error amplification, so the output-radius majorant is one.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Checked sign in the generator's real embedding; reject nonreal generators.
Equations
- One or more equations did not get rendered due to their size.
Instances For
def
Hex.QAdjoin.signApprox
{generator : AlgebraicNumber}
(value : QAdjoin generator)
(_real : generator.isReal = true)
:
Total sign for a real generator. The companion proves the fallback unreachable.
Equations
- value.signApprox _real = value.signApprox?.getD (Hex.panicWith 0 "signApprox: finite precision endpoint failed")
Instances For
Interpret an integer sign as comparison with zero.
Equations
- Hex.orderOfSign sign = compare sign 0