Download data/lean/OAI/Probability/SATComputability/ExchangeableBlocks.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 1.86 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/SATComputability/ExchangeableBlocks.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/SATComputability/ExchangeableBlocks.lean
-
curl -L -o ExchangeableBlocks.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/SATComputability/ExchangeableBlocks.lean
1.86 kB
| import OAI.Probability.SATComputability.MaskPermutations | |
| import OAI.Probability.SATComputability.GridBlockLaw | |
| namespace OAI | |
| namespace FixedClauseThreshold.Computability | |
| open DilutedSpinGlass _root_.MeasureTheory _root_.OAI.MeasureTheory | |
| open scoped NNReal Classical | |
| theorem maskGrid_permutation {n k M : β} (e : Equiv.Perm (Fin n)) | |
| (c : (Fin k β SignedLiteral n) Γ Fin M β β) : | |
| (fun j => renameMask e (maskGrid clauseMask c j)) = | |
| maskGrid clauseMask (fun p => c ((clausePermutation e k).symm p.1,p.2)) := by | |
| funext j | |
| exact countsMask_permutation e (fun a => c (a,j)) | |
| theorem gridMaskLaw_permutation {n k M : β} (e : Equiv.Perm (Fin n)) (r : ββ₯0) | |
| (f : (Fin M β Finset (DeletionCandidate n)) β β) : | |
| (gridMaskLaw M r (clauseMask (n := n) (k := k))).expect | |
| (fun xs => f (fun j => renameMask e (xs j))) = | |
| (gridMaskLaw M r (clauseMask (n := n) (k := k))).expect f := by | |
| simp only [gridMaskLaw_expect, maskGrid_permutation] | |
| have h := poissonCountLaw_equiv | |
| ((clausePermutation e k).prodCongr (Equiv.refl (Fin M))) r | |
| (fun c => f (maskGrid clauseMask c)) | |
| exact h | |
| theorem candidatePath_permutation {n : β} [NeZero n] (M k : β) | |
| (e : Equiv.Perm (Fin n)) (r : ββ₯0) | |
| (f : (Fin M β Finset (DeletionCandidate n)) β β) : | |
| (FiniteLaw.pi (fun _ : Fin M => candidateBlock r k Finset.univ)).expect | |
| (fun xs => f (fun j => renameMask e (xs j))) = | |
| (FiniteLaw.pi (fun _ : Fin M => candidateBlock r k Finset.univ)).expect f := by | |
| have hc : (Fintype.card (Fin k β SignedLiteral n) : ββ₯0) β 0 := by | |
| exact_mod_cast Fintype.card_ne_zero | |
| have h := gridMaskLaw_permutation (k := k) (M := M) e | |
| (r/Fintype.card (Fin k β SignedLiteral n)) f | |
| rw [gridMaskLaw_clauses, div_mul_cancelβ _ hc] at h | |
| exact h | |
| end FixedClauseThreshold.Computability | |
| end OAI | |