Formal Verification of Cubic Acute Set Lower Bounds (OEIS A089676) in Lean 4

Let a(n) denote the maximum cardinality of a subset S of {0,1}^n in which every three distinct points determine three strictly acute angles in R^n (OEIS A089676). Working in Lean 4.35.0, the author formalizes a dependency-free library of cubic acute sets and proves four categories of results: (1) equivalence between the Euclidean dot-product specification, the Boolean sandwich exclusion condition, the coordinate separation criterion, and an executable Boolean checker, with a soundness proof for a bit-packed binary-tree decision procedure; (2) general structural bounds (|S| <= 2^n, |S| <= 2^(n-1) for n >= 2) and the composition constructions of Bevan (2006) and Harangi (2011, case s=2); (3) complete exact optimality proofs a(n) for 0 <= n <= 7, together with certified lower-bound witnesses for 0 <= n <= 15; and (4) explicit acute sets in dimensions 16 <= n <= 24 of sizes 129, 130, 132, 133, 136, 138, 139, 140, 142, found via iterated bipartite 2-coloring lifts and certified in the Lean kernel, together with Bevan-product and monotonicity bounds at dimensions 47 <= n <= 53 (16512, 16641, 16641, 16770, 16900, 17028, 17160) that exceed the November 2, 2026 OEIS a089676_2.txt benchmark table. Upper bounds for a(8) = 10, a(9) = 16, and a(10) = 17 remain unformalized in Lean, and exact values for n >= 11 remain open mathematically.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-13
DOI
https://doi.org/10.5281/zenodo.24210869
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Formal Verification of Cubic Acute Set Lower Bounds (OEIS A089676) in Lean 4

Mar Allen Sugui
1 links
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Formal Verification of Cubic Acute Set Lower Bounds (OEIS A089676) in Lean 4

Mar Allen Sugui
preprint en

Abstract

Let a(n) denote the maximum cardinality of a subset S of {0,1}^n in which every three distinct points determine three strictly acute angles in R^n (OEIS A089676). Working in Lean 4.35.0, the author formalizes a dependency-free library of cubic acute sets and proves four categories of results: (1) equivalence between the Euclidean dot-product specification, the Boolean sandwich exclusion condition, the coordinate separation criterion, and an executable Boolean checker, with a soundness proof for a bit-packed binary-tree decision procedure; (2) general structural bounds (|S| <= 2^n, |S| <= 2^(n-1) for n >= 2) and the composition constructions of Bevan (2006) and Harangi (2011, case s=2); (3) complete exact optimality proofs a(n) for 0 <= n <= 7, together with certified lower-bound witnesses for 0 <= n <= 15; and (4) explicit acute sets in dimensions 16 <= n <= 24 of sizes 129, 130, 132, 133, 136, 138, 139, 140, 142, found via iterated bipartite 2-coloring lifts and certified in the Lean kernel, together with Bevan-product and monotonicity bounds at dimensions 47 <= n <= 53 (16512, 16641, 16641, 16770, 16900, 17028, 17160) that exceed the November 2, 2026 OEIS a089676_2.txt benchmark table. Upper bounds for a(8) = 10, a(9) = 16, and a(10) = 17 remain unformalized in Lean, and exact values for n >= 11 remain open mathematically.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon