The lines of the Lean statement that state the theorem, then the definitions in the file that it uses.
Local definitions the statement names, followed through the definitions they name in turn. The match is by name in the source text, so a name reached only through notation can be missed; the full file is below.
abbreviation OAI.HarmonicCounterexample.Space line 11
abbrev Space (n : ℕ) := Fin n → ℝ
abbreviation OAI.HarmonicCounterexample.Mat line 12
abbrev Mat (n : ℕ) := Matrix (Fin n) (Fin n) ℝ
structure OAI.HarmonicCounterexample.SmoothMetric line 15
structure SmoothMetric (n : ℕ) where coeff : Space n → Mat n smooth : ∀ i j, ContDiff ℝ ∞ (fun x => coeff x i j) positive : ∀ x, (coeff x).PosDef
definition OAI.HarmonicCounterexample.coordDeriv line 21
def coordDeriv {n : ℕ} (i : Fin n) (f : Space n → ℝ) (x : Space n) : ℝ := fderiv ℝ f x (Pi.single i 1)
definition OAI.HarmonicCounterexample.christoffel line 25
def christoffel {n : ℕ} (g : SmoothMetric n) (x : Space n) (k i j : Fin n) : ℝ := (1 / 2 : ℝ) * ∑ l, (g.coeff x)⁻¹ k l * (coordDeriv i (fun y => g.coeff y j l) x + coordDeriv j (fun y => g.coeff y i l) x - coordDeriv l (fun y => g.coeff y i j) x)
definition OAI.HarmonicCounterexample.ricci line 33
def ricci {n : ℕ} (g : SmoothMetric n) (x : Space n) (i j : Fin n) : ℝ := (∑ k, (coordDeriv k (fun y => christoffel g y k i j) x - coordDeriv j (fun y => christoffel g y k i k) x)) + ∑ k, ∑ l, (christoffel g x k i j * christoffel g x l k l - christoffel g x l i k * christoffel g x k j l)
definition OAI.HarmonicCounterexample.RicciNonnegative line 39
def RicciNonnegative {n : ℕ} (g : SmoothMetric n) : Prop := ∀ (x v : Space n), 0 ≤ ∑ i, ∑ j, ricci g x i j * v i * v j
definition OAI.HarmonicCounterexample.laplaceBeltrami line 43
def laplaceBeltrami {n : ℕ} (g : SmoothMetric n) (u : Space n → ℝ) (x : Space n) : ℝ := ∑ i, ∑ j, (g.coeff x)⁻¹ i j * (coordDeriv i (coordDeriv j u) x - ∑ k, christoffel g x k i j * coordDeriv k u x)
definition OAI.HarmonicCounterexample.pathLength line 49
def pathLength {n : ℕ} (g : SmoothMetric n) (γ : ℝ → Space n) : ℝ := ∫ t in (0 : ℝ)..1, Real.sqrt (∑ i, ∑ j, g.coeff (γ t) i j * deriv γ t i * deriv γ t j)
definition OAI.HarmonicCounterexample.distance line 54
def distance {n : ℕ} (g : SmoothMetric n) (x y : Space n) : ℝ := sInf {L : ℝ | ∃ γ : ℝ → Space n, ContDiff ℝ 1 γ ∧ γ 0 = x ∧ γ 1 = y ∧ L = pathLength g γ}
definition OAI.HarmonicCounterexample.Complete line 59
def Complete {n : ℕ} (g : SmoothMetric n) : Prop := ∀ z : ℕ → Space n, (∀ ε : ℝ, 0 < ε → ∃ N : ℕ, ∀ p ≥ N, ∀ q ≥ N, distance g (z p) (z q) < ε) → ∃ x : Space n, ∀ ε : ℝ, 0 < ε → ∃ N : ℕ, ∀ p ≥ N, distance g (z p) x < ε
definition OAI.HarmonicCounterexample.EuclideanNearOrigin line 64
def EuclideanNearOrigin {n : ℕ} (g : SmoothMetric n) : Prop := ∃ ε : ℝ, 0 < ε ∧ ∀ x : Space n, (∑ i, x i ^ 2) < ε ^ 2 → g.coeff x = 1
definition OAI.HarmonicCounterexample.ballVolume line 68
def ballVolume {n : ℕ} (g : SmoothMetric n) (R : ℝ) : ℝ≥0∞ := ∫⁻ x in {x : Space n | distance g 0 x < R}, ENNReal.ofReal (Real.sqrt (g.coeff x).det) ∂volume
definition OAI.HarmonicCounterexample.omega line 73
def omega (n : ℕ) : ℝ≥0∞ := volume {x : Space n | (∑ i, x i ^ 2) < 1}
definition OAI.HarmonicCounterexample.PositiveSubunitAVR line 77
def PositiveSubunitAVR {n : ℕ} (g : SmoothMetric n) : Prop := ∃ a : ℝ, 0 < a ∧ a < 1 ∧ Tendsto (fun R : ℝ => ballVolume g R / (omega n * ENNReal.ofReal (R ^ n))) atTop (𝓝 (ENNReal.ofReal a))
definition OAI.HarmonicCounterexample.HarmonicGrowth line 83
def HarmonicGrowth {n : ℕ} (g : SmoothMetric n) (k : ℕ) (u : Space n → ℝ) : Prop := ContDiff ℝ ∞ u ∧ (∀ x, laplaceBeltrami g u x = 0) ∧ ∃ C : ℝ, 0 ≤ C ∧ ∀ x, |u x| ≤ C * (1 + distance g 0 x) ^ k
definition OAI.HarmonicCounterexample.euclideanDimension line 88
def euclideanDimension (n k : ℕ) : ℕ := (n + k - 1).choose k + (n + k - 2).choose (k - 1)
A note on how this file states its claim
Line 100 of this statement file writes axiom mainStatement : MainClaim where other statement files write sorry. It stands in for the proof on the statement side only. OpenAI’s solution proves main directly, in the solution file. A successful Comparator replay checks the solution against the allowed axioms: propext, Quot.sound, Classical.choice.