pith. machine review for the scientific record. sign in
def

recognitionThetaModularIdentity_of_prefactor

definition
show as:
view math explainer →
module
IndisputableMonolith.NumberTheory.RecognitionTheta.ModularIdentity
domain
NumberTheory
line
45 · github
papers citing
none yet

open explainer

Read the cached plain-language explainer.

open lean source

IndisputableMonolith.NumberTheory.RecognitionTheta.ModularIdentity on GitHub at line 45.

browse module

All declarations in this module, on Recognition.

explainer page

A cached Ask Recognition explainer exists for this declaration.

open explainer

depends on

used by

formal source

  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
  65
  66end
  67
  68end ModularIdentity
  69end RecognitionTheta
  70end NumberTheory
  71end IndisputableMonolith