The fixed-family nonlogarithmic approximation factor is at most its modulus
ProvedInfoLossLAR.WorstCase.fixed_family_approximation_boundfixed-familylattice-approximationparameter-bound
For every natural security parameter λ, the fixed family satisfies N(λ) q(λ)/σ(λ) ≤ q(λ). This is an exact arithmetic inequality using N(λ)=λ and σ(λ)=λ+2. It supplies the nonlogarithmic factor simplification used after the DGS-to-lattice reductions, and makes no algorithm-existence claim.
Preamble
import Definitions.Def_InfoLossLAR_WorstCase_Family set_option autoImplicit false
Formal statement
namespace InfoLossLAR.WorstCase
theorem fixed_family_approximation_bound (lam : ℕ) :
(famN lam : ℝ) * (famq lam : ℝ) / (famσ lam : ℝ) ≤ famq lam := by sorry
end InfoLossLAR.WorstCaseSource
Complete checked proof reused verbatim from Solutions/RegevBridgeLatticeInterfaces.lean, theorem InfoLossLAR.WorstCase.fixed_family_approximation_bound. Only the declaration name is changed to the required global solution. No new mathematical argument.