{"title":"Formal verification of Zagier's one-sentence proof","related_material":{"record":[{"relation":"other","id":"9946","status":"public"}]},"status":"public","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020"}],"oa":1,"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2021-03-23T05:38:48Z","year":"2021","ec_funded":1,"citation":{"mla":"Dubach, Guillaume, and Fabian Mühlböck. “Formal Verification of Zagier’s One-Sentence Proof.” <i>ArXiv</i>, 2103.11389, doi:<a href=\"https://doi.org/10.48550/arXiv.2103.11389\">10.48550/arXiv.2103.11389</a>.","ieee":"G. Dubach and F. Mühlböck, “Formal verification of Zagier’s one-sentence proof,” <i>arXiv</i>. .","apa":"Dubach, G., &#38; Mühlböck, F. (n.d.). Formal verification of Zagier’s one-sentence proof. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2103.11389\">https://doi.org/10.48550/arXiv.2103.11389</a>","chicago":"Dubach, Guillaume, and Fabian Mühlböck. “Formal Verification of Zagier’s One-Sentence Proof.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2103.11389\">https://doi.org/10.48550/arXiv.2103.11389</a>.","ista":"Dubach G, Mühlböck F. Formal verification of Zagier’s one-sentence proof. arXiv, 2103.11389.","ama":"Dubach G, Mühlböck F. Formal verification of Zagier’s one-sentence proof. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2103.11389\">10.48550/arXiv.2103.11389</a>","short":"G. Dubach, F. Mühlböck, ArXiv (n.d.)."},"publication_status":"submitted","date_published":"2021-03-21T00:00:00Z","department":[{"_id":"LaEr"},{"_id":"ToHe"}],"language":[{"iso":"eng"}],"_id":"9281","article_number":"2103.11389","abstract":[{"lang":"eng","text":"We comment on two formal proofs of Fermat's sum of two squares theorem, written using the Mathematical Components libraries of the Coq proof assistant. The first one follows Zagier's celebrated one-sentence proof; the second follows David Christopher's recent new proof relying on partition-theoretic arguments. Both formal proofs rely on a general property of involutions of finite sets, of independent interest. The proof technique consists for the most part of automating recurrent tasks (such as case distinctions and computations on natural numbers) via ad hoc tactics."}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2103.11389"}],"type":"preprint","doi":"10.48550/arXiv.2103.11389","publication":"arXiv","author":[{"orcid":"0000-0001-6892-8137","last_name":"Dubach","first_name":"Guillaume","id":"D5C6A458-10C4-11EA-ABF4-A4B43DDC885E","full_name":"Dubach, Guillaume"},{"orcid":"0000-0003-1548-0177","first_name":"Fabian","last_name":"Mühlböck","full_name":"Mühlböck, Fabian","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425"}],"day":"21","external_id":{"arxiv":["2103.11389"]},"article_processing_charge":"No","month":"03","date_updated":"2023-05-03T10:26:45Z"}