{"title":"Towards Verified Polynomial Factorisation","authors":"James H. Davenport","doi":"arxiv-2409.09533","DOIUrl":null,"url":null,"abstract":"Computer algebra systems are really good at factoring polynomials, i.e.\nwriting f as a product of irreducible factors. It is relatively easy to verify\nthat we have a factorisation, but verifying that these factors are irreducible\nis a much harder problem. This paper reports work-in-progress to do such\nverification in Lean.","PeriodicalId":501033,"journal":{"name":"arXiv - CS - Symbolic Computation","volume":"66 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Symbolic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.09533","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
