AFTD Auto-Formalizing Theoretical Domains

complex_laplacian_sector_cost_self

theoremverified

The Laplacian sector cost of a loop is zero.

Statement

theorem complex_laplacian_sector_cost_self (u : ℂ) : complex_laplacian_sector_cost u u = 0
Source
Sector-bound formalization for IN-166; arXiv:math/0508176, Theorem 5.
Verified
27 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
Used by 1

The proof, explained

The theorem states that evaluating the complex Laplacian sector cost on identical endpoints u = v yields 0. Unfolding the definition reveals that every term contains a difference of identical components (such as u.re - u.re or u.im - u.im), which simplifies to 0 and causes the entire sum to vanish.

  1. The expression `complex_laplacian_sector_cost u u` simplifies to 0. automation

    Unfolding the definition of `complex_laplacian_sector_cost` substitutes u for both arguments, yielding u.re * (u.re - u.re) + u.im * (u.im - u.im) + u.re * (u.im - u.im) - u.im * (u.re - u.re). In each term, the difference of equal real numbers simplifies to 0, which makes every product vanish and leaves 0.

    line 1

    uses complex_laplacian_sector_cost

    theorem complex_laplacian_sector_cost_self (u : ℂ) : complex_laplacian_sector_cost u u = 0 := by simp [complex_laplacian_sector_cost]
complex_laplacian_sector_cost
the real-valued cost function defined for complex numbers u and v by u.re * (u.re - v.re) + u.im * (u.im - v.im) + u.re * (u.im - v.im) - u.im * (u.re - v.re)

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

theorem complex_laplacian_sector_cost_self (u : ℂ) : complex_laplacian_sector_cost u u = 0 := by simp [complex_laplacian_sector_cost]
See it in the graphDiscuss this resultChallenge it