Arousal counts the signals off
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.
Arousal counts: each further signal off raises it by one.
Proposition
[[true, true, true], [true, true, false], [true, false, false], [false, false, false]].map arousal = [0, 1, 2, 3]Proof
By decide in feeling.lean. Checked by the Lean kernel.
- Debit
arousal_counts_the_signals_off— 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/feeling.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
- The state space has six states
- Three turns return
- No corner is fixed
- Turning back undoes the turn
- Turning back is two turns forward
- The flip returns in two
- The flip fixes no valence
- The flip commutes with the turn
- The six symmetries are distinct
- The orders are one three three two six six
- Exactly one pure flip
- The group is cyclic generated by flip and turn
- Not the dihedral group
- All holding is pleasant and calm
- One signal off is unpleasant
- Unpleasant exactly when aroused
- Unanimous signals flip the feeling