Sections 4.6 and 4.8 — pseudoentropy yields a uniform PRG
OpenHILL.PRG.pseudoentropy_to_uniform_prgA mildly nonuniform pseudoentropy generator yields a uniform pseudorandom generator. This combines entropy extraction with advice removal. The target generator evaluates with advice identically zero and satisfies strict stretching and computational indistinguishability in the shared model. Normalization of the seed parameter and polynomial-time implementation are part of the assertion.
This theorem is an open dependency of the proposed proof of the mission main theorem, HILL.PRG.theorem_6_3; no proof is claimed here.
Formalization credit: Wentao Li (Victor), under the Prove2Me account Victorized, with assistance from OpenAI Codex.
Retired formalization. This statement omitted the separate positive inverse-polynomial entropy-gap condition. IsFalseEntropyGen and IsPseudoentropyGen constrain the total entropy threshold, not the gap alone. The corrected replacement is HILL.PRG.pseudoentropy_to_uniform_prg_with_gap. No proof of this retired statement is claimed.
import Definitions.Def_HILL_PRG_Model
namespace HILL.PRG
/-- The existential composition of Theorem 4.14 with Proposition 4.17. -/
theorem pseudoentropy_to_uniform_prg :
(∃ (F : FunEns) (a : ℕ → ℕ) (s : ℕ → ℝ), IsPseudoentropyGen F a s) →
∃ G : FunEns, IsPRG G (fun _ => 0) := by sorry
end HILL.PRG