embed_injective
plain-language theorem explainer
Distinct elements of the inductive natural-number type map to distinct points under the orbit embedding generated by any non-trivial positive real γ. Workers on realizing the Law of Logic in real-number models cite this result to guarantee faithful representation of abstract numbers. The argument reduces equality of embedded values to equality of exponents by taking logarithms and canceling the nonzero factor log γ.
Claim. Let γ be a positive real not equal to one. The map from the inductive natural numbers (built from an identity element and a successor step) to the positive reals, sending the identity to 1 and each successor step to multiplication by γ, is injective.
background
The Generator structure consists of a positive real value distinct from one, extracted from the non-triviality condition in the Law of Logic. The inductive type of natural numbers is the smallest set containing the identity and closed under the step operation, corresponding to the orbit under multiplication by the generator. The embedding function is defined recursively to realize this orbit in the positive reals.
proof idea
The tactic proof assumes two logic naturals map to the same real under the embedding. It rewrites both sides using the power equivalence, takes the real logarithm of both sides, cancels the common nonzero multiplier log of the generator value, casts the resulting equality back to natural numbers, and applies the round-trip property of fromNat and toNat to recover equality of the original elements.
why it matters
This result is invoked by the injectivity theorem for the positive-ratio orbit interpretation in the LogicRealization module. It completes the demonstration that the abstract Peano structure forced by the Law of Logic embeds injectively into the multiplicative group of positive reals. Within the Recognition Science framework, the construction supports the transition from the abstract forcing chain to concrete numerical realizations used in mass and astrophysical derivations.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.
papers checked against this theorem (showing 30 of 470)
-
Attributes replace category lists for remote sensing pre-training
"Random Shuffling... Random Dropout... approximates sampling from the attribute power set... Attribute Replacement... hard antagonist from the same dimension"
-
r-value scores shrink conformal sets by excluding unstable candidates
"the r-value estimates how likely a candidate’s latent score belongs to the top-ranked group after accounting for both its mean score and its uncertainty"
-
VLMs fail to ground numbers in spatial layouts
"current VLMs rely heavily on shallow spatial cues, struggle to build stable coordinate-aware representations"
-
Generative edits answer what-if questions for neural net predictions
"We use both of these formulations in our framework depending on whether actionable attributes are known or unknown, where the latter uses the latent representations as our attributes (§3.1)"
-
Gravitational radiation produces vorticity tied to super-energy flux
"the vorticity vector Ω... super-Poynting vector Pα = ηαβγδ Eβρ Hγρ uδ... non-vanishing component of the latter associated to a state of gravitational radiation"
-
Three views explain information flow and loss in distributed systems
"Theorem 1 (Observability of X at S by R): ... π+ : Si +Xi→ Rj, π− : Rj −Xj→ Si, Xj ⊆ Xi"
-
Upper bound derived for radar interference from massive MIMO cells
"While these worst-case elevation angles are correlated for neighboring BSs due to the structure of the PV tessellation, it does not explicitly appear in our analysis because of our focus on the average interference."
-
Sum of fractional-part differences ~ (2/π)ζ(3/2) sqrt(c x)
"van der Corput estimates on {x/k−a}−{x/k−b}"
-
Explicit solutions derived for Levi-Civita equation on monoids
"Proposition 1.1 … any set of distinct nonzero multiplicative functions is linearly independent"
-
ChebNets stabilize deep RePU nets via Chebyshev series
"Theorem 1. For n ≥ 1, assume p(x) = ∑ cj Tj(x) ... there exists a σ2 neural network with at most ⌊log2 n⌋ + 1 hidden layers ... O(n) neurons and total non-zero weights."
-
P-adic valuation increments get independent arithmetic
"The arithmetic of the p-adic increments is proposed... Δv_p(n!)=(1-Δs_p(n))/(p-1)... Δs_p(n)=1-(p-1)v_p(n+1)"
-
Sensitivity decays exponentially with distance in graph NLPs
"graph-induced bandwidth ... inverse of a graph-induced banded matrix (Theorem 3.6)"
-
Spin fluctuations create residual resistivity linked to Tc in heavy fermions
"A(ℓ) = F²_ℓ |λ(ℓ)–μ*/(1+λ(ℓ))|² and Tc(ℓ)=θ exp(–1–λ(ℓ))/(λ(ℓ)–μ*)"
-
Perturbation in doping parameters solves Hubbard sign problem
"The first order for the vertex in particle-hole (PH) channel is given by the diagram shown in Fig.7 ˜Σ(1)12 = −∑s−QMC ∑3,4 γd1234(s) ˜G034"
-
Listwise model with boosted trees tops review helpfulness benchmarks
"Theorem 4 … E(f listD) ≤ E(f pairD)"
-
Grid module mediates both external interaction and internal reinforcement
"strange-loop theory... self-referential feedback loop... two-way circulation... interaction (high-level) ... self-reinforcement (low-level)"
-
Banakh spaces realize any distance set without embedding in the reals
"Theorem 7.2: complete Banakh space with G+ subset d[X^2] for non-cyclic G subset Q is isometric to R."
-
Milnor invariants now defined for links in any 3-manifold
"Theorem D... µn(L′)=µn(L) iff (n+1)-basing... Stallings-Dwyer Theorem"
-
Crazy Knight's Tour exists exactly when n and k are both odd
"Theorem 3.6 ... (k−1−|E|)-knight is a solution to T(D)"
-
K-theory removes semi-simplicity from zeta-value formula
"Theorem 2.14. We have that K₀(Arith_{S¹}(R)) ≃ (⊕_{p∈Spec(R)(0)} Z) ⊕ Z, where the extra copy of Z is the image of a canonical splitting K₀(C(S¹,F)) → K₀(Arith_{S¹}(R)). Each copy of Z indexed by a height 1 prime p ... generated by the class of R/p."
-
Alternating permutations give Betti numbers for chordal nestohedra
"Theorem 1.1. ... β_k(X^R_B) = sum_{I in [n+1] choose 2k} #alternating B|I-permutations"
-
Siamese fine-tuning boosts CLIP attack resistance
"Sim-CLIP adopts a Siamese training architecture with a cosine similarity objective … without requiring large batch sizes or additional momentum encoders"
-
Squeezed reservoir both creates and destroys quantum synchronization
"dθ/dt = ... dϕ/dt = ... θs = arccos(−1/(2N+1)) ... all states evolve onto a cycle"
-
Quantum geometry maps scalar fields to non-identical anyons
"compact-phase quantum geometry... nonuniform first-Chern matrix... non-identical anyons"
-
RDJSCC improves multi-view image recovery over fading channels
"Theorem 1 (Mutual Information Non-Increasing Theorem)... I(sa1; sa2) ≥ I(sb1; sb2)"
-
Green's function Laplace transforms computed for degenerate reflected BM
"points (a_n,b_n) on parabola P constructed by successive automorphisms ... (ηζ)^n ... Martin harmonic functions h_α = sum κ_m(α) exp(z0·(a_m,b_m))"
-
Wasserstein depth ranks distributions by centrality
"Properties: [0,1]-valued, transformation invariance under isometries of (P_2,W_2), vanishing at infinity, maximality at spatial median"
-
Benchmark shows vision models hallucinate more on attributes
"Our evaluation shows that models are prone to hallucinations on object existence, and even more so on fine-grained attributes."
-
Generalized free energy governs driven nonequilibrium systems
"excess EPR vanishes in steady state; housekeeping quantifies nonconservative forces; dual form min D(j'∥˜j) s.t. ∇^T j'=ẋ"
-
Linear dot-attention replaces quadratic self-attention in time series transformers
"Lemma 1 ... continuous multivariate function f that ... is permutation-invariant ... approximated using Dot-attention"