exists_plane_rotation_system_complete_four
K_4 has a plane rotation system: 4 vertices, 6 edges, 4 faces (sanity check of simple_graph_is_plane_rotation_system).
Statement
theorem exists_plane_rotation_system_complete_four :
∃ σ : Equiv.Perm (⊤ : SimpleGraph (Fin 4)).Dart,
simple_graph_is_plane_rotation_system (⊤ : SimpleGraph (Fin 4)) σ- Source
- Sanity lemma for simple_graph_is_plane_rotation_system (OP-541)
- Verified
- 27 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- simple_graph_is_plane_rotation_systemFor a finite simple graph G and a permutation σ : Equiv.Perm G.Dart of its darts, σ is a plane embedding of G given combinatorially,…
- simple_graph_is_rotation_systemA rotation system of G is a permutation σ of the darts (directed edges) of G that fixes the tail of every dart and permutes the darts at…
- simple_graph_rotation_face_countFor a finite simple graph G (explicit argument) and a permutation σ : Equiv.Perm G.Dart of its darts, the number of faces of σ is the…
- simple_graph_rotation_face_permFor a simple graph G (explicit argument) and a rotation system given as a permutation σ : Equiv.Perm G.Dart of the darts of G, the face…
The proof, explained
The proof constructs an explicit plane rotation system on the complete graph K_4, corresponding to its standard embedding on the sphere with 4 triangular faces. A dart permutation σ is defined by specifying a cyclic ordering of the three outgoing edges at each vertex, and verified to be a rotation system by finite evaluation (`decide`). The face permutation σ ∘ symm is shown to partition the 12 darts into 4 cycles of length 3 by establishing an explicit bijection between the quotient set of face orbits and Fin 4. Finally, Euler's planar formula |V| - |E| + F = 4 - 6 + 4 = 2 is checked arithmetically.
The rotation map sends each dart (u, v) of K_4 to a valid dart (u, next(u, v)).
We define `exists_plane_rotation_system_complete_four_next` giving a cyclic order of the three neighbors at each vertex of K_4. The function `exists_plane_rotation_system_complete_four_rot` maps each dart d = (u, v) to (u, next(u, v)). To prove that this pair forms an edge in K_4 (which requires u ≠ next(u, v)), we generalize the endpoints to variables u, v ∈ Fin 4 and perform exhaustive case analysis over all 16 pairs using `fin_cases` and `decide`.
open SimpleGraph private def exists_plane_rotation_system_complete_four_next : Fin 4 → Fin 4 → Fin 4 := ![![0, 3, 1, 2], ![2, 1, 3, 0], ![3, 0, 2, 1], ![1, 2, 0, 3]] private def exists_plane_rotation_system_complete_four_rot (d : (⊤ : SimpleGraph (Fin 4)).Dart) : (⊤ : SimpleGraph (Fin 4)).Dart := ⟨(d.fst, exists_plane_rotation_system_complete_four_next d.fst d.snd), by have hd : d.fst ≠ d.snd := d.adj revert hd generalize d.fst = u generalize d.snd = v fin_cases u <;> fin_cases v <;> decide⟩
The dart rotation map is a permutation σ of the darts of K_4.
Since the dart type of K_4 has only 12 elements, bijectivity of `exists_plane_rotation_system_complete_four_rot` is verified by finite evaluation (`decide`). We bundle this bijection into a permutation `exists_plane_rotation_system_complete_four_sigma` using `Equiv.ofBijective`.
uses
Equiv.ofBijectiveprivate noncomputable def exists_plane_rotation_system_complete_four_sigma : Equiv.Perm (⊤ : SimpleGraph (Fin 4)).Dart := Equiv.ofBijective exists_plane_rotation_system_complete_four_rot (by decide)
Four representative darts are selected for the faces, each verified to be a valid dart.
We define `exists_plane_rotation_system_complete_four_face_idx` to assign darts indices in Fin 4, and choose four representative darts `exists_plane_rotation_system_complete_four_rep`: (0, 1), (0, 2), (0, 3), and (1, 3). For each representative pair, adjacency in K_4 (u ≠ v) is checked by `decide`.
private def exists_plane_rotation_system_complete_four_face_idx : Fin 4 → Fin 4 → Fin 4 := ![![0, 0, 1, 2], ![2, 1, 0, 3], ![0, 3, 2, 1], ![1, 2, 3, 3]] private def exists_plane_rotation_system_complete_four_rep : Fin 4 → (⊤ : SimpleGraph (Fin 4)).Dart := ![⟨(0, 1), by decide⟩, ⟨(0, 2), by decide⟩, ⟨(0, 3), by decide⟩, ⟨(1, 3), by decide⟩]
The face permutation preserves the face index of every dart.
The face permutation `exists_plane_rotation_system_complete_four_face` is defined as σ ∘ symm. Lemma `exists_plane_rotation_system_complete_four_face_idx_apply` asserts that for any dart d, face_idx(face(d)) = face_idx(d). This is verified by evaluating the equality on all 12 darts using `decide`.
private noncomputable abbrev exists_plane_rotation_system_complete_four_face : Equiv.Perm (⊤ : SimpleGraph (Fin 4)).Dart := simple_graph_rotation_face_perm (⊤ : SimpleGraph (Fin 4)) exists_plane_rotation_system_complete_four_sigma private lemma exists_plane_rotation_system_complete_four_face_idx_apply : ∀ d : (⊤ : SimpleGraph (Fin 4)).Dart, exists_plane_rotation_system_complete_four_face_idx (exists_plane_rotation_system_complete_four_face d).fst (exists_plane_rotation_system_complete_four_face d).snd = exists_plane_rotation_system_complete_four_face_idx d.fst d.snd := by decide
Each representative dart has its expected face index.
Lemma `exists_plane_rotation_system_complete_four_face_idx_rep` states that for each index i ∈ {0, 1, 2, 3}, the representative dart rep(i) evaluates to i under face_idx. This is verified for all four indices by `decide`.
private lemma exists_plane_rotation_system_complete_four_face_idx_rep : ∀ i : Fin 4, exists_plane_rotation_system_complete_four_face_idx (exists_plane_rotation_system_complete_four_rep i).fst (exists_plane_rotation_system_complete_four_rep i).snd = i := by decide
Every dart reaches the representative of its assigned face in at most two applications of the face permutation.
Lemma `exists_plane_rotation_system_complete_four_cover` states that for every dart d, either d, face(d), or face²(d) equals rep(face_idx(d)). Because the graph and permutations are finite, this disjunction is verified by `decide` on all 12 darts.
private lemma exists_plane_rotation_system_complete_four_cover : ∀ d : (⊤ : SimpleGraph (Fin 4)).Dart, d = exists_plane_rotation_system_complete_four_rep (exists_plane_rotation_system_complete_four_face_idx d.fst d.snd) ∨ exists_plane_rotation_system_complete_four_face d = exists_plane_rotation_system_complete_four_rep (exists_plane_rotation_system_complete_four_face_idx d.fst d.snd) ∨ exists_plane_rotation_system_complete_four_face (exists_plane_rotation_system_complete_four_face d) = exists_plane_rotation_system_complete_four_rep (exists_plane_rotation_system_complete_four_face_idx d.fst d.snd) := by decide
Any two darts originating at the same vertex belong to the same orbit of σ of length at most 3.
Lemma `exists_plane_rotation_system_complete_four_rot_cover` asserts that if darts d and e have the same source vertex (d.fst = e.fst), then e = d, e = σ(d), or e = σ²(d). This is verified for all pairs of darts by `decide`.
private lemma exists_plane_rotation_system_complete_four_rot_cover : ∀ d e : (⊤ : SimpleGraph (Fin 4)).Dart, d.fst = e.fst → e = d ∨ e = exists_plane_rotation_system_complete_four_sigma d ∨ e = exists_plane_rotation_system_complete_four_sigma (exists_plane_rotation_system_complete_four_sigma d) := by decide
σ is a rotation system on K_4.
To satisfy `simple_graph_is_rotation_system`, we must show two conditions: (1) σ preserves dart sources, which holds by definition (`rfl`); (2) any two darts d, e with the same source are in the same cycle of σ. By `exists_plane_rotation_system_complete_four_rot_cover`, either e = d (reflexivity via `Equiv.Perm.SameCycle.refl`), e = σ(d), or e = σ²(d). In the latter two cases, the equality is transferred to cycle equivalence by shifting along the cycle.
uses
exists_plane_rotation_system_complete_four_rot_cover,Equiv.Perm.SameCycle.reflprivate lemma exists_plane_rotation_system_complete_four_is_rotation_system : simple_graph_is_rotation_system (⊤ : SimpleGraph (Fin 4)) exists_plane_rotation_system_complete_four_sigma := by constructor · intro d; rfl · intro d e h obtain rfl | h | h := exists_plane_rotation_system_complete_four_rot_cover d e h · exact Equiv.Perm.SameCycle.refl _ _ · exact (h.symm.sameCycle exists_plane_rotation_system_complete_four_sigma).of_apply_left · exact ((h.symm.sameCycle exists_plane_rotation_system_complete_four_sigma).of_apply_left).of_apply_left
Darts in the same face cycle have the same face index.
If a and b are in the same cycle of the face permutation, there exists n ∈ ℕ such that faceⁿ(a) = b. We prove face_idx(a) = face_idx(faceⁿ(a)) by induction on n. The base case n = 0 is trivial (`rfl`). For the inductive step, we decompose faceⁿ⁺¹ = face ∘ faceⁿ using `pow_succ'` and `Equiv.Perm.mul_apply`, apply `exists_plane_rotation_system_complete_four_face_idx_apply` to remove the outermost application of the face permutation, and conclude by the induction hypothesis.
uses
pow_succ',Equiv.Perm.mul_apply,exists_plane_rotation_system_complete_four_face_idx_applyprivate lemma exists_plane_rotation_system_complete_four_face_idx_eq_of_sameCycle {a b : (⊤ : SimpleGraph (Fin 4)).Dart} (h : (exists_plane_rotation_system_complete_four_face).SameCycle a b) : exists_plane_rotation_system_complete_four_face_idx a.fst a.snd = exists_plane_rotation_system_complete_four_face_idx b.fst b.snd := by obtain ⟨n, hn⟩ := h.exists_nat_pow_eq clear h subst hn induction n with | zero => rfl | succ n ih => rw [pow_succ', Equiv.Perm.mul_apply, exists_plane_rotation_system_complete_four_face_idx_apply] exact ih
Every dart is in the same face cycle as the representative of its assigned face.
From `exists_plane_rotation_system_complete_four_cover`, every dart d satisfies d = rep(i), face(d) = rep(i), or face²(d) = rep(i), where i = face_idx(d). In each case, d and rep(i) are in the same cycle, either immediately or by shifting through applications of the permutation.
uses
exists_plane_rotation_system_complete_four_coverprivate lemma exists_plane_rotation_system_complete_four_sameCycle_rep (d : (⊤ : SimpleGraph (Fin 4)).Dart) : (exists_plane_rotation_system_complete_four_face).SameCycle d (exists_plane_rotation_system_complete_four_rep (exists_plane_rotation_system_complete_four_face_idx d.fst d.snd)) := by obtain h | h | h := exists_plane_rotation_system_complete_four_cover d · exact h.sameCycle exists_plane_rotation_system_complete_four_face · exact (h.sameCycle exists_plane_rotation_system_complete_four_face).of_apply_left · exact ((h.sameCycle exists_plane_rotation_system_complete_four_face).of_apply_left).of_apply_left
Mapping a face orbit to its index and taking the class of the representative is the identity on the quotient.
We define the quotient projection `exists_plane_rotation_system_complete_four_face_to_fun` sending an orbit ⟦d⟧ to face_idx(d) (well-defined by Step 9) and `exists_plane_rotation_system_complete_four_face_inv_fun` sending an index i to ⟦rep(i)⟧. By quotient induction (`Quotient.inductionOn`), taking an arbitrary element ⟦d⟧ yields ⟦rep(face_idx(d))⟧. By `exists_plane_rotation_system_complete_four_sameCycle_rep` and `Quotient.sound`, this class equals ⟦d⟧, proving left-inversion.
uses
Quotient.inductionOn,Quotient.sound,exists_plane_rotation_system_complete_four_sameCycle_repprivate noncomputable def exists_plane_rotation_system_complete_four_face_to_fun : Quotient (Equiv.Perm.SameCycle.setoid exists_plane_rotation_system_complete_four_face) → Fin 4 := Quotient.lift (fun d => exists_plane_rotation_system_complete_four_face_idx d.fst d.snd) (fun _ _ hab => exists_plane_rotation_system_complete_four_face_idx_eq_of_sameCycle hab) private noncomputable def exists_plane_rotation_system_complete_four_face_inv_fun : Fin 4 → Quotient (Equiv.Perm.SameCycle.setoid exists_plane_rotation_system_complete_four_face) := fun i => Quotient.mk _ (exists_plane_rotation_system_complete_four_rep i) private lemma exists_plane_rotation_system_complete_four_face_left_inv : Function.LeftInverse exists_plane_rotation_system_complete_four_face_inv_fun exists_plane_rotation_system_complete_four_face_to_fun := by intro q induction q using Quotient.inductionOn with | h d => exact Quotient.sound (exists_plane_rotation_system_complete_four_sameCycle_rep d).symm
Mapping an index to its representative orbit and reading off its face index is the identity on Fin 4.
For any i ∈ Fin 4, applying `exists_plane_rotation_system_complete_four_face_inv_fun` gives ⟦rep(i)⟧, and `exists_plane_rotation_system_complete_four_face_to_fun` extracts face_idx(rep(i)). By `exists_plane_rotation_system_complete_four_face_idx_rep`, this equals i, proving right-inversion.
uses
exists_plane_rotation_system_complete_four_face_idx_repprivate lemma exists_plane_rotation_system_complete_four_face_right_inv : Function.RightInverse exists_plane_rotation_system_complete_four_face_inv_fun exists_plane_rotation_system_complete_four_face_to_fun := by intro i exact exists_plane_rotation_system_complete_four_face_idx_rep i
The quotient of darts by the face cycles has cardinality 4.
The left and right inverse maps establish an equivalence (bijection) between the quotient set of face orbits and Fin 4. By `Fintype.card_congr` and `Fintype.card_fin`, the cardinality of the quotient is 4.
uses
Fintype.card_congr,Fintype.card_finprivate lemma exists_plane_rotation_system_complete_four_face_card : Fintype.card (Quotient (Equiv.Perm.SameCycle.setoid exists_plane_rotation_system_complete_four_face)) = 4 := by have e : Quotient (Equiv.Perm.SameCycle.setoid exists_plane_rotation_system_complete_four_face) ≃ Fin 4 := ⟨exists_plane_rotation_system_complete_four_face_to_fun, exists_plane_rotation_system_complete_four_face_inv_fun, exists_plane_rotation_system_complete_four_face_left_inv, exists_plane_rotation_system_complete_four_face_right_inv⟩ rw [Fintype.card_congr e, Fintype.card_fin]
The number of faces in the rotation system is 4.
Unfolding the definition of `simple_graph_rotation_face_count`, the face count is precisely the cardinality of the face cycle quotient, which is 4 by `exists_plane_rotation_system_complete_four_face_card`.
uses
exists_plane_rotation_system_complete_four_face_cardprivate lemma exists_plane_rotation_system_complete_four_face_count : simple_graph_rotation_face_count (⊤ : SimpleGraph (Fin 4)) exists_plane_rotation_system_complete_four_sigma = 4 := by unfold simple_graph_rotation_face_count exact exists_plane_rotation_system_complete_four_face_card
K_4 has a plane rotation system.
We witness the existential with σ. The complete graph K_4 is connected by `connected_top`, σ is a rotation system by `exists_plane_rotation_system_complete_four_is_rotation_system`, and the face count is 4 by `exists_plane_rotation_system_complete_four_face_count`. The edge count is 6 by finite evaluation (`decide`). Finally, Euler's formula |V| - |E| + F = 4 - 6 + 4 = 2 is verified by `norm_num`.
uses
connected_top,exists_plane_rotation_system_complete_four_is_rotation_system,exists_plane_rotation_system_complete_four_face_counttheorem exists_plane_rotation_system_complete_four : ∃ σ : Equiv.Perm (⊤ : SimpleGraph (Fin 4)).Dart, simple_graph_is_plane_rotation_system (⊤ : SimpleGraph (Fin 4)) σ := by refine ⟨exists_plane_rotation_system_complete_four_sigma, connected_top, exists_plane_rotation_system_complete_four_is_rotation_system, ?_⟩ rw [exists_plane_rotation_system_complete_four_face_count] have hedge : (⊤ : SimpleGraph (Fin 4)).edgeFinset.card = 6 := by decide rw [hedge] norm_num
Equiv.ofBijective- A bijective function between types can be promoted to an equivalence (bijection).
Equiv.Perm.SameCycle.refl- Cycle equivalence for a permutation is reflexive: every element is in the same cycle as itself.
Equiv.Perm.mul_apply- Applying a composed permutation (f * g) to an element x is given by f (g x).
Fintype.card_congr- Equivalent finite types have the same cardinality.
Fintype.card_fin- The cardinality of Fin n is n.
Quotient.inductionOn- To prove a statement for all elements of a quotient, it suffices to prove it for representatives.
Quotient.sound- Equivalent representatives yield equal elements in the quotient.
connected_top- The complete graph on a nonempty vertex set is connected.
exists_plane_rotation_system_complete_four_cover- Every dart reaches the representative of its assigned face within two applications of the face permutation.
exists_plane_rotation_system_complete_four_face_card- The quotient of darts by the face permutation cycles has cardinality 4.
exists_plane_rotation_system_complete_four_face_count- The rotation face count of the constructed rotation system on K_4 is 4.
exists_plane_rotation_system_complete_four_face_idx_apply- Applying the face permutation to a dart leaves its face index unchanged.
exists_plane_rotation_system_complete_four_face_idx_rep- The representative dart of face i has face index i.
exists_plane_rotation_system_complete_four_is_rotation_system- The constructed permutation σ is a valid rotation system on K_4.
exists_plane_rotation_system_complete_four_rot_cover- Any dart e sharing the same origin vertex as d is reachable from d within two steps of σ.
exists_plane_rotation_system_complete_four_sameCycle_rep- Every dart belongs to the same face cycle as the representative dart of its face.
pow_succ'- Powers in a monoid satisfy a^(n + 1) = a * a^n.
- Several combinatorial properties (such as bijectivity of the rotation permutation, edge validity of darts, and orbit coverings of length 3) are established by exhaustive finite verification using the `decide` tactic over the 12 darts and 16 vertex pairs of K_4.
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 SimpleGraphprivate def exists_plane_rotation_system_complete_four_next : Fin 4 → Fin 4 → Fin 4 := ![![0, 3, 1, 2], ![2, 1, 3, 0], ![3, 0, 2, 1], ![1, 2, 0, 3]]private def exists_plane_rotation_system_complete_four_rot (d : (⊤ : SimpleGraph (Fin 4)).Dart) : (⊤ : SimpleGraph (Fin 4)).Dart := ⟨(d.fst, exists_plane_rotation_system_complete_four_next d.fst d.snd), by have hd : d.fst ≠ d.snd := d.adj revert hd generalize d.fst = u generalize d.snd = v fin_cases u <;> fin_cases v <;> decide⟩private noncomputable def exists_plane_rotation_system_complete_four_sigma : Equiv.Perm (⊤ : SimpleGraph (Fin 4)).Dart := Equiv.ofBijective exists_plane_rotation_system_complete_four_rot (by decide)private def exists_plane_rotation_system_complete_four_face_idx : Fin 4 → Fin 4 → Fin 4 := ![![0, 0, 1, 2], ![2, 1, 0, 3], ![0, 3, 2, 1], ![1, 2, 3, 3]]private def exists_plane_rotation_system_complete_four_rep : Fin 4 → (⊤ : SimpleGraph (Fin 4)).Dart := ![⟨(0, 1), by decide⟩, ⟨(0, 2), by decide⟩, ⟨(0, 3), by decide⟩, ⟨(1, 3), by decide⟩]private noncomputable abbrev exists_plane_rotation_system_complete_four_face : Equiv.Perm (⊤ : SimpleGraph (Fin 4)).Dart := simple_graph_rotation_face_perm (⊤ : SimpleGraph (Fin 4)) exists_plane_rotation_system_complete_four_sigmaprivate lemma exists_plane_rotation_system_complete_four_face_idx_apply : ∀ d : (⊤ : SimpleGraph (Fin 4)).Dart, exists_plane_rotation_system_complete_four_face_idx (exists_plane_rotation_system_complete_four_face d).fst (exists_plane_rotation_system_complete_four_face d).snd = exists_plane_rotation_system_complete_four_face_idx d.fst d.snd := by decideprivate lemma exists_plane_rotation_system_complete_four_face_idx_rep : ∀ i : Fin 4, exists_plane_rotation_system_complete_four_face_idx (exists_plane_rotation_system_complete_four_rep i).fst (exists_plane_rotation_system_complete_four_rep i).snd = i := by decideprivate lemma exists_plane_rotation_system_complete_four_cover : ∀ d : (⊤ : SimpleGraph (Fin 4)).Dart, d = exists_plane_rotation_system_complete_four_rep (exists_plane_rotation_system_complete_four_face_idx d.fst d.snd) ∨ exists_plane_rotation_system_complete_four_face d = exists_plane_rotation_system_complete_four_rep (exists_plane_rotation_system_complete_four_face_idx d.fst d.snd) ∨ exists_plane_rotation_system_complete_four_face (exists_plane_rotation_system_complete_four_face d) = exists_plane_rotation_system_complete_four_rep (exists_plane_rotation_system_complete_four_face_idx d.fst d.snd) := by decideprivate lemma exists_plane_rotation_system_complete_four_rot_cover : ∀ d e : (⊤ : SimpleGraph (Fin 4)).Dart, d.fst = e.fst → e = d ∨ e = exists_plane_rotation_system_complete_four_sigma d ∨ e = exists_plane_rotation_system_complete_four_sigma (exists_plane_rotation_system_complete_four_sigma d) := by decideprivate lemma exists_plane_rotation_system_complete_four_is_rotation_system : simple_graph_is_rotation_system (⊤ : SimpleGraph (Fin 4)) exists_plane_rotation_system_complete_four_sigma := by constructor · intro d; rfl · intro d e h obtain rfl | h | h := exists_plane_rotation_system_complete_four_rot_cover d e h · exact Equiv.Perm.SameCycle.refl _ _ · exact (h.symm.sameCycle exists_plane_rotation_system_complete_four_sigma).of_apply_left · exact ((h.symm.sameCycle exists_plane_rotation_system_complete_four_sigma).of_apply_left).of_apply_leftprivate lemma exists_plane_rotation_system_complete_four_face_idx_eq_of_sameCycle {a b : (⊤ : SimpleGraph (Fin 4)).Dart} (h : (exists_plane_rotation_system_complete_four_face).SameCycle a b) : exists_plane_rotation_system_complete_four_face_idx a.fst a.snd = exists_plane_rotation_system_complete_four_face_idx b.fst b.snd := by obtain ⟨n, hn⟩ := h.exists_nat_pow_eq clear h subst hn induction n with | zero => rfl | succ n ih => rw [pow_succ', Equiv.Perm.mul_apply, exists_plane_rotation_system_complete_four_face_idx_apply] exact ihprivate lemma exists_plane_rotation_system_complete_four_sameCycle_rep (d : (⊤ : SimpleGraph (Fin 4)).Dart) : (exists_plane_rotation_system_complete_four_face).SameCycle d (exists_plane_rotation_system_complete_four_rep (exists_plane_rotation_system_complete_four_face_idx d.fst d.snd)) := by obtain h | h | h := exists_plane_rotation_system_complete_four_cover d · exact h.sameCycle exists_plane_rotation_system_complete_four_face · exact (h.sameCycle exists_plane_rotation_system_complete_four_face).of_apply_left · exact ((h.sameCycle exists_plane_rotation_system_complete_four_face).of_apply_left).of_apply_leftprivate noncomputable def exists_plane_rotation_system_complete_four_face_to_fun : Quotient (Equiv.Perm.SameCycle.setoid exists_plane_rotation_system_complete_four_face) → Fin 4 := Quotient.lift (fun d => exists_plane_rotation_system_complete_four_face_idx d.fst d.snd) (fun _ _ hab => exists_plane_rotation_system_complete_four_face_idx_eq_of_sameCycle hab)private noncomputable def exists_plane_rotation_system_complete_four_face_inv_fun : Fin 4 → Quotient (Equiv.Perm.SameCycle.setoid exists_plane_rotation_system_complete_four_face) := fun i => Quotient.mk _ (exists_plane_rotation_system_complete_four_rep i)private lemma exists_plane_rotation_system_complete_four_face_left_inv : Function.LeftInverse exists_plane_rotation_system_complete_four_face_inv_fun exists_plane_rotation_system_complete_four_face_to_fun := by intro q induction q using Quotient.inductionOn with | h d => exact Quotient.sound (exists_plane_rotation_system_complete_four_sameCycle_rep d).symmprivate lemma exists_plane_rotation_system_complete_four_face_right_inv : Function.RightInverse exists_plane_rotation_system_complete_four_face_inv_fun exists_plane_rotation_system_complete_four_face_to_fun := by intro i exact exists_plane_rotation_system_complete_four_face_idx_rep iprivate lemma exists_plane_rotation_system_complete_four_face_card : Fintype.card (Quotient (Equiv.Perm.SameCycle.setoid exists_plane_rotation_system_complete_four_face)) = 4 := by have e : Quotient (Equiv.Perm.SameCycle.setoid exists_plane_rotation_system_complete_four_face) ≃ Fin 4 := ⟨exists_plane_rotation_system_complete_four_face_to_fun, exists_plane_rotation_system_complete_four_face_inv_fun, exists_plane_rotation_system_complete_four_face_left_inv, exists_plane_rotation_system_complete_four_face_right_inv⟩ rw [Fintype.card_congr e, Fintype.card_fin]private lemma exists_plane_rotation_system_complete_four_face_count : simple_graph_rotation_face_count (⊤ : SimpleGraph (Fin 4)) exists_plane_rotation_system_complete_four_sigma = 4 := by unfold simple_graph_rotation_face_count exact exists_plane_rotation_system_complete_four_face_cardtheorem exists_plane_rotation_system_complete_four : ∃ σ : Equiv.Perm (⊤ : SimpleGraph (Fin 4)).Dart, simple_graph_is_plane_rotation_system (⊤ : SimpleGraph (Fin 4)) σ := by refine ⟨exists_plane_rotation_system_complete_four_sigma, connected_top, exists_plane_rotation_system_complete_four_is_rotation_system, ?_⟩ rw [exists_plane_rotation_system_complete_four_face_count] have hedge : (⊤ : SimpleGraph (Fin 4)).edgeFinset.card = 6 := by decide rw [hedge] norm_num