Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The integer exponential character

Proved
IntegerWindingExponentialIndependence.exponentialCharacter

by lisamegawatts · Sep 19, 2026 · Mathlib c5ea003 (Lean v4.30.0)

linear-algebranumber-theorytranscendencewinding

For every complex β, the function χβ(n)=exp(nβ) agrees with the integer powers exp(β)ⁿ, is multiplicative with respect to addition of integer labels, and sends zero to one.

Preamble
import Definitions.Def_IntegerWindingExponentialIndependence_CoreV1

set_option autoImplicit false
Formal statement
namespace IntegerWindingExponentialIndependence

theorem exponentialCharacter (β : ℂ) :
    (∀ n : ℤ, integerPhase β n = Complex.exp β ^ n) ∧
    (∀ m n : ℤ, integerPhase β (m + n) = integerPhase β m * integerPhase β n) ∧
    integerPhase β 0 = 1 := by sorry

end IntegerWindingExponentialIndependence
Source
Mathlib.Analysis.Complex.Exponential, theorem Complex.exp_int_mul and the exponential addition law.
Read-back

What the Lean code literally says, in plain math · gpt-5.6-sol

For every complex number β\betaβ, all three of the following statements hold: for every integer nnn, exp⁡((n:C)β)=(exp⁡β)n\exp((n:\mathbb C)\beta)=(\exp\beta)^nexp((n:C)β)=(expβ)n, where the right side is the integer power and therefore includes inverse powers when n<0n<0n<0; for every pair of integers m,nm,nm,n, exp⁡(((m+n):C)β)=exp⁡((m:C)β)exp⁡((n:C)β)\exp(((m+n):\mathbb C)\beta)=\exp((m:\mathbb C)\beta)\exp((n:\mathbb C)\beta)exp(((m+n):C)β)=exp((m:C)β)exp((n:C)β); and exp⁡((0:C)β)=1\exp((0:\mathbb C)\beta)=1exp((0:C)β)=1. The theorem quantifies over every β\betaβ, including 000, and assumes neither algebraicity nor nonzeroness. Its integer quantifiers include zero and negative integers.

Human review
  • Endorsed by Shuze Chen · Sep 22, 2026

  • Endorsed by lisamegawatts · Sep 22, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me