recognitionThetaModularIdentity_iff_prefactor

formal source

  31      recognitionTheta (1 / t) = ρ t * recognitionTheta t
  32
  33/-- Prefactor data is exactly the existing modular-identity structure. -/
  34theorem recognitionThetaModularIdentity_iff_prefactor :
  35    RecognitionThetaModularIdentity ↔ Nonempty RecognitionThetaPrefactor := by
  36  constructor
  37  · intro h
  38    rcases h.prefactor with ⟨ρ, hcont, hinv⟩
  39    exact ⟨{ ρ := ρ, continuous := hcont, inversion := hinv }⟩
  40  · intro h
  41    rcases h with ⟨p⟩
  42    exact ⟨⟨p.ρ, p.continuous, p.inversion⟩⟩
  43
  44/-- Direct constructor for the modular-identity bridge. -/
  45def recognitionThetaModularIdentity_of_prefactor
  46    (p : RecognitionThetaPrefactor) :
  47    RecognitionThetaModularIdentity :=
  48  recognitionThetaModularIdentity_iff_prefactor.mpr ⟨p⟩
  49
  50/-! ## Current A.2 attack surface -/
  51
  52/-- Machine-readable A.2 status: all downstream code only needs a continuous
  53prefactor satisfying inversion; the missing theorem is the Poisson-summation
  54construction of that prefactor. -/
  55structure RecognitionThetaModularAttackSurface where
  56  prefactor_equivalence :
  57    RecognitionThetaModularIdentity ↔ Nonempty RecognitionThetaPrefactor
  58  constructor :
  59    RecognitionThetaPrefactor → RecognitionThetaModularIdentity
  60
  61def recognitionThetaModularAttackSurface :
  62    RecognitionThetaModularAttackSurface where
  63  prefactor_equivalence := recognitionThetaModularIdentity_iff_prefactor
  64  constructor := recognitionThetaModularIdentity_of_prefactor