wild_three_partial_involution_classification
On three vertices, two symmetric partial partner maps, each with at most one fixed point, are isomorphic whenever the existence of a fixed point and of a non-loop internal edge agree. This is a finite classification checked by Lean kernel reduction.
Statement
theorem wild_three_partial_involution_classification :
∀ f g : Fin 3 → Option (Fin 3),
(∀ j k, f j = some k ↔ f k = some j) →
(∀ j k, g j = some k ↔ g k = some j) →
(∀ j k, f j = some j → f k = some k → j = k) →
(∀ j k, g j = some j → g k = some k → j = k) →
((∃ j, f j = some j) ↔ ∃ j, g j = some j) →
((∃ j k, j ≠ k ∧ f j = some k) ↔ ∃ j k, j ≠ k ∧ g j = some k) →
∃ r : Fin 3 → Fin 3, Function.Bijective r ∧
∀ j k, f j = some k ↔ g (r j) = some (r k)- Source
- IN-382 / OP-306 campaign9, 2026-10-30. Standard finite matching symmetry supporting the mixed-moment route for https://arxiv.org/html/2610.22142v1. Exact experiment9566 exposed the missing parity assumption. The original false helper remains retired and its proof record is preserved. No wild-number bound or research advance is claimed.
- Verified
- 30 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 1
- wild_involution_three_set_isomorphismFor two finite involutions with unique fixed points, two three-element subsets can be carried to one another by a global intertwining…
The proof, explained
The theorem classifies partial partner maps (degree at most 1) on three vertices with at most one fixed point, asserting that any two such maps with matching counts of fixed points (0 or 1) and non-loop edges (0 or 1) are isomorphic under a permutation of the vertices. The proof expands the definition of bijectivity into elementary quantifiers over the finite set of three vertices, rendering the entire theorem a bounded first-order sentence over finite domains. Lean's kernel then verifies the statement completely by exhaustive computational decision (`decide +kernel`).
The requirement that the vertex permutation r is bijective is expanded into explicit quantifiers for injectivity and surjectivity.
Unfolding the definitions of Function.Bijective, Function.Injective, and Function.Surjective rewrites the bijection condition into first-order statements over Fin 3: ∀ a₁ a₂, r a₁ = r a₂ → a₁ = a₂ and ∀ b, ∃ a, r a = b.
uses
Function.Bijective,Function.Injective,Function.Surjectiveunfold Function.Bijective Function.Injective Function.SurjectiveThe classification holds for all symmetric partial maps on three vertices with at most one fixed point. automation
Because Fin 3 is a finite set of three elements, the function space Fin 3 → Option (Fin 3) has only 4³ = 64 elements, and the permutation space Fin 3 → Fin 3 has 3³ = 27 elements. With every quantifier bounded over a finite domain equipped with decidability instances, Lean's kernel evaluates the truth value of the entire statement by exhaustive computational search.
decide +kernel
Function.Bijective- A function is bijective if it is both injective and surjective.
Function.Injective- A function is injective if distinct inputs map to distinct outputs, or equivalently, if f(a₁) = f(a₂) implies a₁ = a₂.
Function.Surjective- A function is surjective if every element in the codomain has a pre-image in the domain.
- The entire mathematical classification is established by computational brute force: Lean evaluates the decidable proposition directly in the kernel by checking all 64 × 64 pairs of maps and searching for an isomorphism among the 27 maps on three vertices.
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.
open Finsetopen scoped BigOperatorsset_option maxHeartbeats 6000000set_option maxRecDepth 100000set_option synthInstance.maxSize 10000attribute [local instance] Fintype.decidableForallFintype Fintype.decidableExistsFintypetheorem wild_three_partial_involution_classification : ∀ f g : Fin 3 → Option (Fin 3), (∀ j k, f j = some k ↔ f k = some j) → (∀ j k, g j = some k ↔ g k = some j) → (∀ j k, f j = some j → f k = some k → j = k) → (∀ j k, g j = some j → g k = some k → j = k) → ((∃ j, f j = some j) ↔ ∃ j, g j = some j) → ((∃ j k, j ≠ k ∧ f j = some k) ↔ ∃ j k, j ≠ k ∧ g j = some k) → ∃ r : Fin 3 → Fin 3, Function.Bijective r ∧ ∀ j k, f j = some k ↔ g (r j) = some (r k) := by unfold Function.Bijective Function.Injective Function.Surjective decide +kernel