run_boundary_distinct
The free, blocked inward, and blocked outward boundary conditions on a run in the Game of Arrows are pairwise distinct.
Statement
theorem run_boundary_distinct :
RunBoundary.free ≠ RunBoundary.blocked_in ∧
RunBoundary.free ≠ RunBoundary.blocked_out ∧
RunBoundary.blocked_in ≠ RunBoundary.blocked_out- Source
- scout/2610-15145-nim-heaps-in-the-game-of-cycles-the-parity-conjecture-fails.md:397
- Verified
- 21 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 1
- RunBoundaryThe boundary condition at an end of a path segment in the Game of Arrows is either free (denoted *), blocked inward (denoted →), or…
Read back from the Lean
The three constructors of RunBoundary are pairwise distinct; specifically: RunBoundary.free ≠ RunBoundary.blocked_in, RunBoundary.free ≠ RunBoundary.blocked_out, and RunBoundary.blocked_in ≠ RunBoundary.blocked_out.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The theorem states that the three boundary values of a run—`free`, `blocked_in`, and `blocked_out`—are pairwise distinct. Since `RunBoundary` is defined as an inductive type with these three constructors and derives decidable equality, the inequalities follow directly from constructor disjointness. The proof is completed by direct computation using `decide`.
The boundary conditions `free`, `blocked_in`, and `blocked_out` are pairwise distinct. automation
Because `RunBoundary` is an inductive type whose constructors are disjoint and equipped with decidable equality, each of the three inequalities reduces to `True`. The `decide` tactic resolves the conjunction of inequalities by direct computational evaluation.
decide
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- The three boundary conditions of a run are pairwise distinct. -/theorem run_boundary_distinct : RunBoundary.free ≠ RunBoundary.blocked_in ∧ RunBoundary.free ≠ RunBoundary.blocked_out ∧ RunBoundary.blocked_in ≠ RunBoundary.blocked_out := by decide