AFTD Auto-Formalizing Theoretical Domains

d2_tilde_kernel_r_symm

theoremverified

For every function W : ℝ → ℝ → ℝ and all x1, x2 : ℝ, the kernel d2_tilde_kernel_r W is symmetric: d2_tilde_kernel_r W x1 x2 = d2_tilde_kernel_r W x2 x1.

Statement

theorem d2_tilde_kernel_r_symm (W : ℝ → ℝ → ℝ) (x1 x2 : ℝ) :
    d2_tilde_kernel_r W x1 x2 = d2_tilde_kernel_r W x2 x1
Source
arXiv:2611.15027 Section 5
Verified
15 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • d2_tilde_kernel_rGiven a function W : ℝ → ℝ → ℝ and real numbers x1, x2 : ℝ, the kernel d2_tilde_kernel_r W x1 x2 is the product d2_tilde_factor_p W true…
  • d2_tilde_factor_pGiven a function W : ℝ → ℝ → ℝ, boolean values eps1, eps2 : Bool, and real numbers x1, x2 : ℝ, the factor d2_tilde_factor_p W eps1 eps2 x1…

Read back from the Lean

For every function $W : ℝ → ℝ → ℝ$ and all real numbers $x_1, x_2 : ℝ$, the quantity d2_tilde_kernel_r W x1 x2 is equal to d2_tilde_kernel_r W x2 x1 (i.e., the kernel d2_tilde_kernel_r W is symmetric in its two arguments).

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 kernel R(x₁, x₂) is defined as the product of four factors P(ε₁, ε₂, x₁, x₂) over all boolean sign pairs (ε₁, ε₂). The proof first shows that each factor satisfies P(ε₁, ε₂, x₁, x₂) = P(ε₂, ε₁, x₂, x₁) by the commutativity of multiplication inside the defining integral. Expanding R(x₁, x₂) and substituting this relation exchanges the two off-diagonal factors while preserving the diagonal ones, leaving the overall product identical to R(x₂, x₁) by commutativity of multiplication.

  1. Each factor satisfies the symmetry relation P(ε₁, ε₂, x₁, x₂) = P(ε₂, ε₁, x₂, x₁).

    Unfolding the definition of d2_tilde_factor_p reveals an integral over [0, 1] of the product of two terms, one evaluated at x₁ with sign ε₁ and the other at x₂ with sign ε₂. By commutativity of multiplication (mul_comm), swapping the two integrand factors yields the factor with exchanged arguments and signs.

    lines 4–6

    uses mul_comm

      have h (eps1 eps2 : Bool) : d2_tilde_factor_p W eps1 eps2 x1 x2 = d2_tilde_factor_p W eps2 eps1 x2 x1 := by
        unfold d2_tilde_factor_p
        simp_rw [mul_comm]
  2. The kernel R(x₁, x₂) is symmetric under exchanging x₁ and x₂: R(x₁, x₂) = R(x₂, x₁).

    Unfolding the definition of d2_tilde_kernel_r expresses both R(x₁, x₂) and R(x₂, x₁) as the product of the four factors P(ε₁, ε₂, ·, ·) over all pairs of boolean signs. Rewriting each factor using the symmetry lemma h leaves the diagonal factors P(true, true) and P(false, false) invariant while swapping the two off-diagonal factors P(true, false) and P(false, true). The resulting product has the exact same four factors as R(x₂, x₁), so ring arithmetic closes the equality.

    lines 7–9

      unfold d2_tilde_kernel_r
      rw [h true true, h true false, h false true, h false false]
      ring
mul_comm
Multiplication is commutative: a * b = b * a for any elements a and b in a commutative magma.

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

/-- Symmetry of the kernel R(x₁, x₂) = R(x₂, x₁). -/theorem d2_tilde_kernel_r_symm (W : ℝ → ℝ → ℝ) (x1 x2 : ℝ) :    d2_tilde_kernel_r W x1 x2 = d2_tilde_kernel_r W x2 x1 := by  have h (eps1 eps2 : Bool) : d2_tilde_factor_p W eps1 eps2 x1 x2 = d2_tilde_factor_p W eps2 eps1 x2 x1 := by    unfold d2_tilde_factor_p    simp_rw [mul_comm]  unfold d2_tilde_kernel_r  rw [h true true, h true false, h false true, h false false]  ring
See it in the graphDiscuss this resultChallenge it