Work

Constructive reachability, cycles and shortest paths on generated finite graphs

Year: 2026
Type: preprint
Abstract: Complete constructive path witnesses, exact cycle-return equivalence and shortest-path minimality on generated finite graphs. Maria Smith derives both directions of reachability, reconstructs complete return paths, and proves discovery and shortestness for the original ordered undirected search using explicit queue invariants. Includes cuts, token balance, boundary-depth dimension, finite open-family closure and inverse-image continuity; full 512/1,024-candidate classifications; 408 empty-axiom audited definitions and theorems; pinned V3/V4 proofs and portable exhaustive reproduction. Correspondence: [email protected]. SFT community and invitation: https://discord.gg/QCNkzq6kZC. Includes the complete fresh-node pair-support construction, preservation of paths and returns, exact cut-update equations and necessary-and-sufficient token-balance successor argument. All arguments identify their original V3 operations and existing V4 proof declarations. Native Lean source and verification on GitHub.
Author: Smith, Maria
Language: English
Open Access status: green
OpenAlex ID: W7236071558
Cites:
Cited by:
Related to: 10