pith. sign in
theorem

embed_strictMono_of_one_lt

proved
show as:
module
IndisputableMonolith.Foundation.ArithmeticFromLogic
domain
Foundation
line
684 · github
papers citing
387 papers (below)

plain-language theorem explainer

The declaration shows that the orbit embedding of the recovered natural numbers into positive reals is strictly monotone when the generator value exceeds one. Workers reconstructing arithmetic structures from the Law of Logic would reference this result to guarantee order preservation under the embedding. The argument reduces immediately to the right-to-left direction of the companion iff statement for the same embedding.

Claim. Let $γ$ be a generator with value greater than 1. The embedding map from the Peano structure on the orbit to the positive reals is strictly monotone.

background

Generator denotes a positive real number distinct from 1, extracted from the non-triviality of any comparison operator satisfying the Law of Logic. The embed function maps the identity element of the recovered naturals to 1 and each successor step to multiplication by the generator value, producing the orbit under repeated multiplication. The recovered naturals themselves arise as the abstract Peano structure on the orbit of any such generator, as constructed in the preceding lemmas of this module.

proof idea

The proof is a one-line wrapper that invokes the right-to-left implication of the companion iff lemma on the given strict inequality between embedded values.

why it matters

This result secures the order-preserving property required for the recovery of natural-number arithmetic from the functional equation. It directly supports the module summary that the Peano axioms become theorems once the orbit structure is in hand. The declaration leaves open the generator-free characterization of the orbit and the direct definition of order on the recovered naturals, both flagged for later modules.

Switch to Lean above to see the machine-checked source, dependencies, and usage graph.