OAI/Computability/MaxCut/PCP/ProfileCorrection.lean
29 declarations, 0 contain sorry, 0 declared as axioms
Replacing the input marginal of an actual conditional profile.
- def
OAI.MaxCutGames.Foundations.Repetition.ProfileCorrection.seedQuestionMarginalline 16 - theorem
OAI.MaxCutGames.Foundations.Repetition.ProfileCorrection.seedQuestionMarginal_isProbabilityline 19 - theorem
OAI.MaxCutGames.Foundations.Repetition.ProfileCorrection.seedQuestionMarginal_firstline 30 - theorem
OAI.MaxCutGames.Foundations.Repetition.ProfileCorrection.totalVariation_triangleline 35 - theorem
OAI.MaxCutGames.Foundations.Repetition.ProfileCorrection.left_profile_correctionline 44 - def
OAI.MaxCutGames.Foundations.Repetition.revealEndpointline 99 - def
OAI.MaxCutGames.Foundations.Repetition.revealLawline 103Source documentation
Independently reveal either endpoint with probability one half.
def revealLaw (μ : FiniteDistribution (X × Y)) : FiniteDistribution ((X × Y) × (X ⊕ Y)) := … - theorem
OAI.MaxCutGames.Foundations.Repetition.revealLaw_weightline 108 - def
OAI.MaxCutGames.Foundations.Repetition.revealFirstLawline 118 - theorem
OAI.MaxCutGames.Foundations.Repetition.revealFirstLaw_weightline 123 - def
OAI.MaxCutGames.Foundations.Repetition.revealFallbackline 129Source documentation
The default row still preserves the displayed endpoint if that endpoint has zero probability in the base question law.
def revealFallback (μ : FiniteDistribution (X × Y)) (r : X ⊕ Y) : FiniteDistribution (X × Y) := … - def
OAI.MaxCutGames.Foundations.Repetition.revealProfileline 135 - theorem
OAI.MaxCutGames.Foundations.Repetition.revealProfile_inl_supportline 139 - theorem
OAI.MaxCutGames.Foundations.Repetition.revealProfile_inr_supportline 151 - def
OAI.MaxCutGames.Foundations.Repetition.revealInputLawline 163 - theorem
OAI.MaxCutGames.Foundations.Repetition.revealInputLaw_weightline 166 - theorem
OAI.MaxCutGames.Foundations.Repetition.reveal_profile_recombinationline 174Source documentation
The conditional product representation is proved from the sampled law, including reveal values with zero probability.
theorem reveal_profile_recombination (μ : FiniteDistribution (X × Y)) (r : X ⊕ Y) (q : X × Y) : (revealInputLaw μ).weight r * (revealProfile μ r).weight q = (revealLaw μ).weight (q,r) := by …Mentions: OAI.MaxCutGames.Foundations.Repetition.revealInputLaw, OAI.MaxCutGames.Foundations.Repetition.revealProfile, OAI.MaxCutGames.Foundations.Repetition.revealLaw
- theorem
OAI.MaxCutGames.Foundations.Repetition.reveal_profile_inl_recombinationline 181 - theorem
OAI.MaxCutGames.Foundations.Repetition.reveal_profile_inr_recombinationline 188 - theorem
OAI.MaxCutGames.Foundations.Repetition.revealInputLaw_inlline 195 - theorem
OAI.MaxCutGames.Foundations.Repetition.revealInputLaw_inrline 204 - theorem
OAI.MaxCutGames.Foundations.Repetition.revealProfile_inl_diagonalline 211 - theorem
OAI.MaxCutGames.Foundations.Repetition.revealProfile_inr_diagonalline 233 - theorem
OAI.MaxCutGames.Foundations.Repetition.revealLaw_sum_leftline 259 - theorem
OAI.MaxCutGames.Foundations.Repetition.revealLaw_sum_rightline 264 - theorem
OAI.MaxCutGames.Foundations.Repetition.revealLaw_forgetline 269 - theorem
OAI.MaxCutGames.Foundations.Repetition.reveal_product_factorizationline 281Source documentation
A conditional product of independently revealed coordinates has its exact point weight. This is the product identity used by the information bound, derived from the single-coordinate sampled distribution.
theorem reveal_product_factorization {ι : Type*} [Fintype ι] (μ : FiniteDistribution (X × Y)) (r : ι → X ⊕ Y) (q : ι → X × Y) : (∏ i, (revealInputLaw μ).weight (r i)) * (∏ i, (revealProfile μ (r i)).weight (q i)) = ∏ i, (revealLaw μ).weight (q i,r i) := by …Mentions: OAI.MaxCutGames.Foundations.Repetition.revealInputLaw, OAI.MaxCutGames.Foundations.Repetition.revealProfile, OAI.MaxCutGames.Foundations.Repetition.revealLaw
- theorem
OAI.MaxCutGames.Foundations.Repetition.reveal_product_forgetline 291 - theorem
OAI.MaxCutGames.Foundations.Repetition.reveal_product_expectationline 310Source documentation
Marginalizing the reveal «variables» restores the original independent question law for every observable, including the selected-win likelihood.
theorem reveal_product_expectation {ι : Type*} [Fintype ι] [DecidableEq ι] (μ : FiniteDistribution (X × Y)) (f : (ι → X × Y) → ℝ) : (∑ r : ι → X ⊕ Y, (∏ i, (revealInputLaw μ).weight (r i)) * ∑ q : ι → X × Y, (∏ i, (revealProfile μ (r i)).weight (q i)) * f q) = ∑ q : ι → X × Y, (∏ i, μ.weight (q i)) * f q := by …Mentions: OAI.MaxCutGames.Foundations.Repetition.revealInputLaw, OAI.MaxCutGames.Foundations.Repetition.revealProfile