Id: palomar/PALOMAR-2026-11-09-000001 Url: https://github.com/gsidoine/coprime-adjacencies-lean/tree/4ccf4a1d94ccf83473bcacf87ddd9117274ec945 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-09-000001-v1.json Repo: https://github.com/gsidoine/coprime-adjacencies-lean Tags: math.CO, msc:05C38, msc:11A41 Score: 0 Title: The Minimum Number of Coprime Adjacencies in a Permutation Trust: high Domain: math.CO Source: palomar Authors: Guillaume Sidoine Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-09 Formalized: true Formalizes: title=The Minimum Number of Coprime Adjacencies in a Permutation identifier=https://github.com/gsidoine/the-scottish-book/blob/f73a76cd5e33ee822ae572953195f9549efec4ed/theorems/P010-exact-coprime-adjacencies.md relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-09-000001 A Lean 4 formalization of the exact minimum number of coprime adjacent pairs over all permutations of the first n positive integers, valid unconditionally for every n at least four. The proof constructs optimal paths in the graph joining noncoprime integers.