Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

LeanProofs.Crypto.Equivariance

Definition
Grade4_LeanProofs_Crypto_Equivariance

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

clifford-algebraleanproofs-grade4rosetta

Foundational definitions and structural lemmas from LeanProofs.Crypto.Equivariance, required by the selected LeanProofs theorem graph.

Definition code
/-
  Equivariance of the symbolic Navier-Stokes RHS under rotor conjugation.

  The hard-homogeneous-space construction over Cl(6,0) gains
  cryptographic value if the PDE used to mix bivector states is
  equivariant under the rotor conjugation action — in particular, if
  applying the discrete PDE step k times commutes with conjugating by
  a fixed rotor R:

      pdeRHS^[k] (R · F · R̃) = R · pdeRHS^[k] F · R̃

  This file proves the algebraic core of that statement at the level
  of one symbolic Euler step, and lifts it to k-fold iteration by
  induction.

  ## Scope (CRYPTO ASSUMPTIONS LEDGER)

  MACHINE CHECKED here:
    pdeRHS (one symbolic Euler step v² · D(D F) + ⟦F, D F⟧) is
    equivariant under spatially-constant rotor conjugation, where
    `spatially-constant` is captured by the `ConstantRotorDerivation`
    structure: D commutes with conjugation by ANY rotor.

    Equivariance lifts to arbitrary k-fold iteration of the symbolic
    step (`pdeRHS_iter_equivariant`).

  ASSUMED (analytical, see NavierStokesPDE.lean):
    The continuous PDE flow ∂_t F = v² ∇²F + ⟦F, ∇F⟧ inherits
    equivariance in the limit dt → 0. This is a standard analytic
    statement (the symbol of the flow is equivariant ⇒ the flow is
    equivariant on smooth solutions) and is not re-proved here.

  ASSUMED (cryptanalytic):
    Hardness of vectorization — recovering R from F and R · F · R̃ —
    is conjectured, not proved.

  ## Protocol constraint: spatially constant rotors

  The `ConstantRotorDerivation.comm_one` axiom captures
  "D commutes with rotor conjugation". For a finite-difference
  Laplacian on a grid, this holds *only* when the rotor R is the
  SAME at every grid point. If Alice's secret rotor varies in
  space, conjugation no longer commutes with the discrete Laplacian
  stencil and equivariance breaks. Any concrete protocol built on
  this construction must apply secret rotors uniformly across the
  field, not pointwise differently.
-/
import Definitions.Def_Grade4_LeanProofs_Crypto_HardHomogeneousSpace

namespace LeanProofsGrade4P2M
namespace Cl60Conj
end Cl60Conj

namespace ConstantRotorDerivation
end ConstantRotorDerivation
end LeanProofsGrade4P2M
Source
https://github.com/MonumentalSystems/LeanProofs/blob/b656238b73d5f0f74515f6574a1dcb4e0216129f/LeanProofs/Crypto/Equivariance.lean

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me