Invert is an involution
NOT A NOVELTY CLAIM. This is a machine-checked formalisation, checked by the Lean 4 kernel and depending on no axiom. It is dated and citable. Prior art, where it exists, is cited below. No discovery is claimed.
Proposition
∀ r : Ratio, invert (invert r) = rProof
By fun _ => rfl in fallback.lean. Checked by the Lean kernel.
- Debit
invert_is_an_involution— this theorem- Credit
of_decide_eq_true:∀ {p : Prop} [inst : Decidable p], decide p = true → p— the kernel itself: the statement reduces to true by computation, and the rule that turns that reduction into a proof rests on no axiom
Sources and identifiers
- Lean source · src/pair/lean/proofs/fallback.lean
- Typeset paper · src/research/lean-theorems.tex
- Repository deposit · doi:10.5281/zenodo.21787144
- Author · ORCID 0009-0000-7312-9778
Proved in the same file
- Inversion swaps zero and infinity
- Dividing by zero is infinity
- Zero over zero is the fixed point that names nothing
- Inversion fixes exactly plus and minus one
- Negation is an involution
- Negation fixes exactly zero
- A negative reflects to a positive
- The reflected root squares back
- A digit over zero falls back to its mirror