cas-internal-taylor-quartic-lagrange-witness
- Kind
- witness-replay
- Status
- checked
Supports: the Taylor-with-Lagrange-remainder certificate (Taylor polynomial T_1, (n+1)-th derivative p'', the witness equation's interior root, named exactly as xi = sqrt(2/3)) is independently re-derived and accepted by a checker (verify_taylor_certificate) that shares no code with the search that produced it (polynomial_taylor)
cargo test -p axeyum-cas --lib taylor::tests::quartic_irrational_witness -- --exact 2>/dev/null | grep -cE '^test taylor::tests::quartic_irrational_witness \.\.\. ok$' Evidence notes
THIS EVIDENCE IS cas-internal, NOT kernel-reconstructed (ADR-0601 SS2): the checker_command only ever names the axeyum-cas package (never axeyum-lean-kernel), so scripts/validate-facts.py's classify_cas_certificate_checker classifies this fact's evidence as cas-internal. verify_taylor_certificate is independently re-derived and is itself mutation-tested in the same module (verify_rejects_corrupted_taylor_poly, verify_rejects_a_wrong_remainder_coefficient, verify_rejects_a_wrong_witness_unrelated_to_the_equation, verify_rejects_an_exterior_root_that_satisfies_the_value_equation, verify_rejects_an_exterior_witness_in_the_degenerate_branch, verify_rejects_a_corrupted_bracket -- 6 dedicated adversarial fixtures). IMPORTANT, and stated explicitly per this task's instruction: crates/axeyum-lean-kernel/src/rat_prelude/taylor.rs's Rat.taylor_deg1 is NOT a reconstruction of this claim and is materially weaker -- it is exact but limited to degree <= 1 (n=0 only, per that file's own module doc: 'degree 1 has no square to factor'), carries NO remainder term, and produces NO witness xi at all; it establishes only the trivial identity that a degree-<=1 polynomial equals its own linear approximation. This fact's claim -- a general-degree Taylor polynomial, an exact Lagrange remainder, and a NAMED real-root witness xi -- has no kernel counterpart today, and none is claimed here. Bridging it (as ADR-0601 anticipates for the polynomial-identity slice generally) would need, at minimum, a kernel construction of exact polynomial long division with remainder and a kernel-reconstructed Sturm root count -- neither exists yet (see F:cas-ivt-sign-bracket-cbrt2-kernel-checked's own notes sizing the same two prerequisites for the IVT certificate's unreconstructed root-containment/Sturm-count items). The test asserts p := x^4 (poly_from([0,0,0,0,1])), a=0, n=1, b=2, cert := polynomial_taylor(&p,a,n,b).unwrap(), verify_taylor_certificate(&cert) == Some(true), cert.xi.rational_value() == None (irrational), cert.xi.degree() == 2, and 0 < xi < 1 via exact algebraic comparison against the lifted RealAlgebraic.