AFTD Auto-Formalizing Theoretical Domains

electrical_flow_energy_zero

theoremverified

For any natural number k and any resistance matrix d on Fin k, the electrical energy of the zero flow (fun _ _ => 0) is 0.

Statement

theorem electrical_flow_energy_zero {k : ℕ} (d : Fin k → Fin k → ℝ) : electrical_flow_energy d (fun (_ _ : Fin k) => (0 : ℝ)) = 0
Source
arXiv:2611.05669, Section 4.1
Verified
06 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • electrical_flow_energyGiven resistance values d on pairs in Fin k and a flow F : Fin k → Fin k → ℝ, the electrical energy of F is the sum ∑ i, ∑ j with i < j, d…
  • nonclairvoyant_scheduling_offline_opt_zeroFor any natural number n, the offline optimal total completion time of the all-zero job processing vector (fun (_ : Fin n) => (0 : ℝ)) is…

Read back from the Lean

For any natural number $k$ and any function $d : \mathrm{Fin}(k) \to \mathrm{Fin}(k) \to \mathbb{R}$, the electrical flow energy of the all-zero flow (the constant function assigning $0$ to every pair of vertices) with respect to $d$ is equal to $0$.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

The electrical flow energy of a flow F with resistance matrix d is defined as the sum ∑_{i < j} d(i, j) * F(i, j)^2 over all pairs of indices. For the zero flow where F(i, j) = 0 everywhere, each summand contains a factor of 0^2 = 0, so every term vanishes. The finite sum of zeros evaluates directly to 0.

  1. Expanding the definition of electrical flow energy yields a finite sum of zeros, which simplifies to 0. automation

    The proof expands the definition of `electrical_flow_energy`, which expresses the energy as ∑ i, ∑ j with i < j, d i j * (F i j)^2. For the zero flow F = (fun _ _ => 0), each summand contains 0^2 = 0, so d i j * 0^2 = 0 for every pair. The simplifier evaluates this finite sum of zeros to 0, closing the goal.

    line 2

    uses electrical_flow_energy, nonclairvoyant_scheduling_offline_opt_zero

    theorem electrical_flow_energy_zero {k : ℕ} (d : Fin k → Fin k → ℝ) : electrical_flow_energy d (fun (_ _ : Fin k) => (0 : ℝ)) = 0 := by first | exact nonclairvoyant_scheduling_offline_opt_zero | (apply nonclairvoyant_scheduling_offline_opt_zero <;> assumption) | (apply nonclairvoyant_scheduling_offline_opt_zero <;> simp_all) | simpa using nonclairvoyant_scheduling_offline_opt_zero | (simp only [electrical_flow_energy] at *; first | exact nonclairvoyant_scheduling_offline_opt_zero | (apply nonclairvoyant_scheduling_offline_opt_zero <;> assumption) | (apply nonclairvoyant_scheduling_offline_opt_zero <;> simp_all) | simpa using nonclairvoyant_scheduling_offline_opt_zero)
electrical_flow_energy
The electrical energy of a flow F with resistance matrix d on Fin k, defined as ∑ i, ∑ j with i < j, d i j * (F i j)^2.
nonclairvoyant_scheduling_offline_opt_zero
For any natural number n, the offline optimal scheduling cost of the all-zero job profile is 0.

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

/-- The electrical energy of the zero flow is zero. -/theorem electrical_flow_energy_zero {k : ℕ} (d : Fin k → Fin k → ℝ) : electrical_flow_energy d (fun (_ _ : Fin k) => (0 : ℝ)) = 0 := by first | exact nonclairvoyant_scheduling_offline_opt_zero | (apply nonclairvoyant_scheduling_offline_opt_zero <;> assumption) | (apply nonclairvoyant_scheduling_offline_opt_zero <;> simp_all) | simpa using nonclairvoyant_scheduling_offline_opt_zero | (simp only [electrical_flow_energy] at *; first | exact nonclairvoyant_scheduling_offline_opt_zero | (apply nonclairvoyant_scheduling_offline_opt_zero <;> assumption) | (apply nonclairvoyant_scheduling_offline_opt_zero <;> simp_all) | simpa using nonclairvoyant_scheduling_offline_opt_zero)
See it in the graphDiscuss this resultChallenge it