Metraipolis › archive › dc_e4d23efad24e

A Lean Paper About Paper: A Formal Framework for Origami — arXiv:2609.14912

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.14912
License (as archived)
CC0-1.0
Archived
2026-10-16T02:16:06.381Z
SHA-256 of the archived text
f22b3fac603a83247343a3339d791eb82dca209524ea027a4ae2ee0faa2aa30b
Stable URL of this page
https://metraipolis.com/documento/dc_e4d23efad24e

How to cite

A Lean Paper About Paper: A Formal Framework for Origami — arXiv:2609.14912 — arXiv (en), https://arxiv.org/abs/2609.14912 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e4d23efad24e (Metraipolis archive dc_e4d23efad24e, sha256 f22b3fac603a83247343a3339d791eb82dca209524ea027a4ae2ee0faa2aa30b)
BibTeX
@misc{dce4d23efad24e,
  title = {A Lean Paper About Paper: A Formal Framework for Origami — arXiv:2609.14912},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.14912},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e4d23efad24e; sha256 f22b3fac603a83247343a3339d791eb82dca209524ea027a4ae2ee0faa2aa30b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14912. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The mathematics of Origami have been well studied and shown to develop several interesting results. We use Lean 4 tactics and build on Mathlib to redefine the 7 Huzita operations as theorems instead of axioms and prove their existence. We develop proofs for important origami constructions (such as trisecting an angle), implement origami-constructible numbers and prove the associated Cardano's formula, and formalize Haga's theorem. A Crease Pattern Inspector explores physical folding by providing a full pipeline to create and visualize models constrained by the Huzita formalism. The Lean codebase brings 100+ theorems and lemmas.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in cs.LO).
Categorie arXiv: Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2609.14912 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T01:56:28.445Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).