Towards Verified Polynomial Factorisation
<|reference_start|>Towards Verified Polynomial Factorisation: Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much harder problem. This paper reports work-in-progress to do such verification in Lean.<|reference_end|>
@article{davenport2024towards,
    title={Towards Verified Polynomial Factorisation},
    author={James H. Davenport},
    journal={arXiv preprint arXiv:2409.09533},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.09533},
    primaryClass={cs.SC}
}