OAI/Computability/MaxCut/Encoding/BinaryRowTransport.lean
15 declarations, 0 contain sorry, 0 declared as axioms
Exact transport from genuine binary linear maps to the complete private rows used by the conditional game.
- def
OAI.MaxCutGames.Soundness.BinaryRowTransport.rowBitsline 18 - theorem
OAI.MaxCutGames.Soundness.BinaryRowTransport.rowBits_zeroline 20 - theorem
OAI.MaxCutGames.Soundness.BinaryRowTransport.rowBits_addline 25 - theorem
OAI.MaxCutGames.Soundness.BinaryRowTransport.rowBits_smulline 29 - theorem
OAI.MaxCutGames.Soundness.BinaryRowTransport.rowBits_list_sumline 33 - theorem
OAI.MaxCutGames.Soundness.BinaryRowTransport.rowBits_sumline 40 - def
OAI.MaxCutGames.Soundness.BinaryRowTransport.rowBitsEquivline 45 - theorem
OAI.MaxCutGames.Soundness.BinaryRowTransport.rowBits_eq_zeroline 51 - def
OAI.MaxCutGames.Soundness.BinaryRowTransport.rowCoefficientsline 60 - theorem
OAI.MaxCutGames.Soundness.BinaryRowTransport.zeroSet_rowCoefficientsline 63 - theorem
OAI.MaxCutGames.Soundness.BinaryRowTransport.actual_pullbackRowline 74 - theorem
OAI.MaxCutGames.Soundness.BinaryRowTransport.actual_partnerRowline 106 - def
OAI.MaxCutGames.Soundness.BinaryRowTransport.rawBitsEquivline 135 - def
OAI.MaxCutGames.Soundness.BinaryRowTransport.bitsMapEquivline 139 - theorem
OAI.MaxCutGames.Soundness.BinaryRowTransport.uniform_bit_coefficients_mapsline 146Source documentation
Uniform raw bit coefficients are exactly uniform genuine partner row maps.
theorem uniform_bit_coefficients_maps {P : Type} [Fintype P] [DecidableEq P] [Fintype Q] [DecidableEq Q] (rhs : P → Bool) (J : Finset P) (H : (PartnerProjection.PartnerPoint rhs (activeOf J) →ₗ[F2] (Q → F2)) → ℝ) : (𝔼 gamma : RawCoefficients J (ZeroInformation.Bits Q), H (bitsMapEquiv rhs J gamma)) = 𝔼 Y, H Y := …Mentions: OAI.MaxCutGames.Soundness.PartnerProjection.PartnerPoint, OAI.MaxCutGames.Soundness.ZeroInformation.Bits, OAI.MaxCutGames.Soundness.BinaryRowTransport.bitsMapEquiv