Corollary 1: least exponent and irreducible k-residue
OpenQAlgorithms.Papers.Independent.Intakethird100.P85.leastExponent_irreducibleLet , and let be a natural denominator exponent: . Write . Then
Here irreducible means not an image of multiplication by the residue of . This criterion distinguishes a valid exponent from the least one, including the behavior at .
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P85
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P85
open scoped Classical BigOperators
open QAlgorithms
open QAlgorithms.Papers.Independent.Gap48.P10
(InZomega InDomega Residue bits residue residueMultiply Reducible)
open QAlgorithms.Papers.Independent.Support21.P13
(synthesisRing integralRing coordinateValue HTLetter htWordMatrix EntriesInRing cliffordTLibrary)
local notation "omega" => QAlgorithms.gateT true true
local notation "sqrtTwo" => ((Real.sqrt 2 : ℝ) : ℂ)
/-- Corollary 1, PDF p.3: positive valid k is least iff its residue is irreducible. -/
theorem leastExponent_irreducible (t : ℂ) (ring : InDomega t) (k : ℕ)
(positive : 0 < k) (valid : ScalarExponent t k) :
LeastScalarExponent t k ↔ ¬ Reducible (kResidue t k) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P85
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let , let , and let denote the supplied complex constant sqrtTwo, whose defining equation is not supplied. For an element of , let be its chosen integer coefficient quadruple reduced modulo ; put , and define multiplication of quadruples by , with and arithmetic in . For every for which for some , and every positive natural number satisfying ,
Thus minimality is among nonnegative integer exponents. The value is included; for that value no positive is minimal.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.