Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Power-Cover Roots as Finite Branch Observations

Definition
Monodromy_Radix

by Xiaoyang Liu · Nov 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

computabilitycovering-spacesmonodromy-computation

For each positive degree, defines the power covering on the circle, its canonical roots of unity and readout of a retained logarithmic branch modulo that degree. Normalized kernels give exact finite root selection used by native path routing and stopping observations.

Definition code
-- Generated by Lean-fact skeleton subtraction; original source is frozen in imports/monodromy/source.
module
public import Definitions.Def_Monodromy_Choice
public import Mathlib.Analysis.Analytic.Constructions
public import Mathlib.Analysis.Analytic.IsolatedZeros
public import Mathlib.Analysis.Calculus.DSlope
public import Mathlib.Analysis.Calculus.Deriv.Add
public import Mathlib.Analysis.Calculus.Deriv.Comp
public import Mathlib.Analysis.Calculus.Deriv.Mul
public import Mathlib.Analysis.Calculus.Deriv.Pow
public import Mathlib.Analysis.Complex.Basic
public import Mathlib.Analysis.Complex.CoveringMap
public import Mathlib.Analysis.SpecialFunctions.Complex.Circle
public import Mathlib.Data.Fin.Basic
public import Mathlib.Logic.Function.Conjugate
public import Mathlib.RingTheory.RootsOfUnity.Complex
public import Mathlib.Tactic.FieldSimp
public import Mathlib.Tactic.FunProp
public import Mathlib.Tactic.Ring
public import Mathlib.Topology.Homotopy.Lifting

@[expose] public section


/-!
# Finite-root observations

The power covering reads a finite residue of the retained logarithmic branch.
Normalized kernels select its regular roots; integer residues occur only in proofs.
-/

@[expose] public section

namespace Monodromy.Radix

variable (B : ℕ) [NeZero B]

noncomputable def omega (digit : Fin B) : Circle :=
  Circle.exp (2 * Real.pi * (digit.val : ℝ) / (B : ℝ))

theorem primitive : IsPrimitiveRoot (Circle.exp (2 * Real.pi / (B : ℝ))) B := by
  have complex : IsPrimitiveRoot ((Circle.exp (2 * Real.pi / (B : ℝ)) : Circle) : ℂ) B := by
    convert Complex.isPrimitiveRoot_exp B (NeZero.ne B) using 1
    simp only [Circle.coe_exp]
    congr 1
    push_cast
    ring
  exact complex.of_map_of_injective (f := Circle.coeHom) Subtype.val_injective

omit [NeZero B] in
theorem omega_eq_pow (digit : Fin B) :
    omega B digit = Circle.exp (2 * Real.pi / (B : ℝ)) ^ digit.val := by
  rw [← Circle.exp_natCast_mul]
  unfold omega
  congr 1
  ring

theorem omega_injective : Function.Injective (omega B) := by
  intro first second same
  rw [omega_eq_pow, omega_eq_pow] at same
  exact Fin.ext ((primitive B).pow_inj first.isLt second.isLt same)

theorem omega_pow (digit : Fin B) : omega B digit ^ B = 1 := by
  rw [omega_eq_pow, ← pow_mul, Nat.mul_comm digit.val B, pow_mul,
    (primitive B).pow_eq_one, one_pow]

theorem omega_complex_pow (digit : Fin B) : (omega B digit : ℂ) ^ B = 1 := by
  simpa only [Circle.coe_pow, Circle.coe_one] using
    congrArg (fun point : Circle => (point : ℂ)) (omega_pow B digit)

/-- The logarithmic lift factors the exponential through the finite power cover. -/
noncomputable def readRoot (x : ℝ) : Circle := Circle.exp (x / (B : ℝ))



/-- The finite root reads the lowest radix digit, without a modulus in its definition. -/
theorem readRoot_digit (n : ℤ) (digit : Fin B) :
    readRoot B ((2 * Real.pi) * (((B : ℤ) * n + digit.val : ℤ) : ℝ)) = omega B digit := by
  have split :
      (2 * Real.pi) * (((B : ℤ) * n + digit.val : ℤ) : ℝ) / (B : ℝ) =
        (n : ℝ) * (2 * Real.pi) + 2 * Real.pi * (digit.val : ℝ) / (B : ℝ) := by
    push_cast
    field_simp [show (B : ℝ) ≠ 0 by exact_mod_cast NeZero.ne B]
  unfold readRoot
  rw [split, Circle.exp_add, Circle.exp_int_mul_two_pi, one_mul]
  rfl

theorem omega_regular (digit : Fin B) :
    deriv (fun z : ℂ => z ^ B) (omega B digit : ℂ) ≠ 0 := by
  rw [deriv_pow_field]
  exact mul_ne_zero (by exact_mod_cast NeZero.ne B)
    (pow_ne_zero _ (omega B digit).coe_ne_zero)



end Monodromy.Radix

namespace Monodromy.Radix.Tower

abbrev Punctured := {z : ℂ // z ≠ 0}

def power (degree : ℕ) (point : Punctured) : Punctured :=
  ⟨point.val ^ degree, pow_ne_zero degree point.property⟩



def one : Punctured := ⟨1, one_ne_zero⟩

abbrev Roots (degree : ℕ) := Transport.Fiber (power degree) one



end Monodromy.Radix.Tower
Source
Authoritative local working-tree snapshot SHA-256 e03ce2d08e07ee663140bec213fb21e995f44153a3c556c908fcf1c8d6fefe6c; repository https://github.com/ERHUTUZI123/monodromy. The remote Git base is incomplete and is not asserted to contain these declarations. src/Monodromy/Radix.lean (file SHA-256 3df520199900e7d5f25e44df8e957416b6b1905f0e04e22eff86df976e586945): Monodromy.Radix.omega at L25-L26 [UTF-8 636:746]. Monodromy.Radix.primitive at L28-L35 [UTF-8 748:1136]. Monodromy.Radix.omega_eq_pow at L37-L43 [UTF-8 1138:1336]. Monodromy.Radix.omega_injective at L45-L48 [UTF-8 1338:1534]. Monodromy.Radix.omega_pow at L50-L52 [UTF-8 1536:1706]. Monodromy.Radix.omega_complex_pow at L54-L56 [UTF-8 1708:1910]. Monodromy.Radix.readRoot at L58-L59 [UTF-8 1912:2071]. Monodromy.Radix.readRoot_digit at L67-L77 [UTF-8 2273:2860]. Monodromy.Radix.omega_regular at L79-L83 [UTF-8 2862:3091]. Monodromy.Radix.Tower.Punctured at L102-L102 [UTF-8 3677:3717]. Monodromy.Radix.Tower.power at L104-L105 [UTF-8 3719:3840]. Monodromy.Radix.Tower.one at L110-L110 [UTF-8 3990:4033]. Monodromy.Radix.Tower.Roots at L112-L112 [UTF-8 4035:4100].
Read-back

What the Lean code literally says, in plain math · OpenAI Codex (independent agent)

For a natural base BBB and digit d∈{0,…,B−1}d\in\{0,\ldots,B-1\}d∈{0,…,B−1}, define the unit-circle point ωB(d)=e2π−1d/B\omega_B(d)=e^{2\pi\sqrt{-1}d/B}ωB​(d)=e2π−1​d/B, and for every real xxx define RB(x)=e−1x/BR_B(x)=e^{\sqrt{-1}x/B}RB​(x)=e−1​x/B on the unit circle. For every positive BBB, the bundle asserts that e2π−1/Be^{2\pi\sqrt{-1}/B}e2π−1​/B is a primitive BBBth root, that d↦ωB(d)d\mapsto\omega_B(d)d↦ωB​(d) is injective, that ωB(d)B=1\omega_B(d)^B=1ωB​(d)B=1 both in the circle group and after its inclusion into C\mathbb CC, and that the complex derivative of z↦zBz\mapsto z^Bz↦zB at ωB(d)\omega_B(d)ωB​(d) is nonzero. For every natural BBB and every digit d<Bd<Bd<B, including the vacuous digit domain at B=0B=0B=0, it asserts ωB(d)=(e2π−1/B)d\omega_B(d)=(e^{2\pi\sqrt{-1}/B})^dωB​(d)=(e2π−1​/B)d. For every positive BBB, integer nnn and digit d<Bd<Bd<B, it asserts RB(2π(Bn+d))=ωB(d)R_B(2\pi(Bn+d))=\omega_B(d)RB​(2π(Bn+d))=ωB​(d); negative integers nnn, B=1B=1B=1 and digit 000 are included. The functions themselves use total real division, so R0(x)=1R_0(x)=1R0​(x)=1 and the digit domain for ω0\omega_0ω0​ is empty; the primitive-root, nonzero-derivative and residue-readout assertions assume B≠0B\ne0B=0. Separately, on U=C∖{0}U=\mathbb C\setminus\{0\}U=C∖{0} it defines, for every natural degree kkk, the map Pk(z)=zk∈UP_k(z)=z^k\in UPk​(z)=zk∈U, the distinguished point 1∈U1\in U1∈U, and the root type {z∈U:Pk(z)=1}\{z\in U:P_k(z)=1\}{z∈U:Pk​(z)=1} as the actual fiber of PkP_kPk​. This latter degree has no nonzero hypothesis: at degree 000 the power map is the constant 111 and every point of UUU lies in its root fiber.

Human review
  • Endorsed by marwahaha · Nov 6, 2026

  • Endorsed by Xiaoyang Liu · Nov 6, 2026

    Confirmed by the mission captain (proposal self-audit).

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