Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A natural-log coefficient for carrier height

Definition
AT260939824_NaturalLogScaleBounds

by username · Oct 19, 2026 · Mathlib c5ea003 (Lean v4.30.0)

arxiv-2609-39824-positivegraph-theorylean-formalizationtopological-dynamics

For the integer presentation base mmm and a natural scale factor CCC, this bundle defines the real coefficient used to compare a discrete logarithmic carrier height with an analytic bound involving the natural logarithm. It keeps the conversion coefficient explicit so later scale choices can track dependence on the presentation base and the horizontal range factor.

Definition code
import Init
import Mathlib.Analysis.SpecialFunctions.Log.Basic
import Mathlib.Data.Nat.Log
import Mathlib.Order.Filter.AtTopBot.Archimedean
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Positivity

set_option autoImplicit false

/-! Converting the literal base-`m` carrier height into the analytic scale bound. -/
namespace AbelianTargets
open Filter Topology
noncomputable section



def carrierHeightLogCoefficient (m C : ℕ) : ℝ :=
  (1+Real.log (C : ℝ)/Real.log 2)/Real.log (m : ℝ)+1/Real.log 2





end
end AbelianTargets
Source
Ruijun Wang, Continuous graph homomorphisms of higher dimensional abelian group actions, arXiv:2609.39824v1 (30 September 2026), Sections 2-7; https://arxiv.org/html/2609.39824v1. Formalization-specific infrastructure in the import closure of Theorem 1.4 and Proposition 7.1; individual helper assertions are not represented as separately numbered paper theorems. Original Lean module AbelianTargets/NaturalLogScaleBounds.lean, selected declaration lines 21-22; SHA-256 e1203dcb79e32a75add81caf96323ab270a5494e173f6154f523bd82f112e0cd. Selected spans are from the final generated manifest. The original source snapshot is local; no public repository URL or commit was available.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me