is_perm_cover_one
The singleton set {1} satisfies is_perm_cover 1 {1} for the symmetric group on 1 element.
Statement
theorem is_perm_cover_one : is_perm_cover 1 {1}- Source
- folklore, sanity lemma for is_perm_cover
- Verified
- 25 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- is_perm_coverFor a natural number k and a finite set C of natural numbers, is_perm_cover k C holds if every d in C is strictly positive (0 < d), and…
Read back from the Lean
The singleton set {1} is a permutation cover for 1, meaning that every element of {1} is strictly positive and every permutation of Fin 1 has an order dividing some element in {1}.
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
To show that $\{1\}$ is a permutation cover for the symmetric group on 1 element, we unpack the definition and choose the candidate order $d = 1$. The permutation group on a 1-element set is trivial, so any permutation is the identity permutation. Because the identity has order 1, its order divides 1, completing the proof.
To show $\{1\}$ is a permutation cover, it suffices to show that $\operatorname{orderOf}(\sigma) \mid 1$ for every permutation $\sigma$ of a 1-element set.
By definition, $\{1\}$ is a permutation cover if every element in $\{1\}$ is strictly positive and every permutation $\sigma \in \operatorname{Equiv.Perm}(\operatorname{Fin} 1)$ has order dividing some element in $\{1\}$. The positivity condition $0 < 1$ holds immediately. For any permutation $\sigma$, choosing $d = 1 \in \{1\}$ reduces the claim to $\operatorname{orderOf}(\sigma) \mid 1$.
refine ⟨by simp, fun σ => ⟨1, by simp, ?_⟩⟩
For any permutation $\sigma \in \operatorname{Equiv.Perm}(\operatorname{Fin} 1)$, $\operatorname{orderOf}(\sigma) \mid 1$.
Since $\operatorname{Fin} 1$ has only one element, the group of permutations $\operatorname{Equiv.Perm}(\operatorname{Fin} 1)$ has a unique element. By `Subsingleton.elim`, $\sigma$ is equal to the identity permutation $1$. Replacing $\sigma$ with $1$ and rewriting with `orderOf_one` ($\operatorname{orderOf}(1) = 1$) simplifies the goal to $1 \mid 1$, which holds reflexively.
uses
Subsingleton.elim,orderOf_onerw [Subsingleton.elim σ 1, orderOf_one]
Subsingleton.elim- In any type with at most one element (a subsingleton), any two terms are equal.
orderOf_one- The order of the identity element in a monoid is 1.
- The `rw` tactic closes the final goal $1 \mid 1$ automatically by reflexivity.
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 singleton {1} is a cover for the symmetric group on 1 element. -/theorem is_perm_cover_one : is_perm_cover 1 {1} := by refine ⟨by simp, fun σ => ⟨1, by simp, ?_⟩⟩ rw [Subsingleton.elim σ 1, orderOf_one]