Download data/lean/OAI/Combinatorics/MatchingPSD/CrossSelection.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 3.07 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/MatchingPSD/CrossSelection.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Combinatorics/MatchingPSD/CrossSelection.lean
-
curl -L -o CrossSelection.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/MatchingPSD/CrossSelection.lean
3.07 kB
| import OAI.Combinatorics.MatchingPSD.TableGeometry | |
| namespace OAI | |
| namespace MatchingSmoothing | |
| open scoped BigOperators | |
| attribute [local instance] Classical.propDecidable | |
| lemma simultaneous_cross_approximation (K : β) : | |
| β d H : β, 0 < d β§ β h : β, H β€ h β | |
| β (V G I T : Type) [Fintype V] [Fintype G] [Group G] [Fintype I] [Fintype T] | |
| (_e : V β Vertices h) (z : I β V β Fin 3), (β i c, 0 < histogram (z i) c) β | |
| β (M : I β T β Pairing V) | |
| (lift : I β Equiv.Perm V β G) | |
| (g : I β G β Pairing V β β), | |
| (β i a p, g i (a * lift i p) = fun N => g i a (Pairing.relabel p N)) β | |
| β B : β, (β i a N, (g i a N)^2 β€ B^2) β | |
| β a : G, β P : I β (Fin 3 β β) β β, | |
| (β i, P i β lowDegree (fun c (v : Fin 3 β β) => v c) d) β§ | |
| (β i, β t : T, | |
| (predicateAverage (fun N => crossVector (z i) N = crossVector (z i) (M i t)) (g i a) - | |
| P i (crossVector (z i) (M i t)))^2) | |
| β€ (Fintype.card I : β) * Fintype.card T * ((2*h : β)^(2*K))β»ΒΉ * B^2 := by | |
| classical | |
| obtain β¨d,H,hd,hmainβ© := simultaneous_table_approximation K | |
| refine β¨d,H,hd,?_β© | |
| intro h hh V G I T _ _ _ _ _ e z hz M lift g hcov B hB | |
| let ev := Pairing.transportEquiv e.symm | |
| let z' := fun i => z i β e.symm | |
| let M' := fun i t => Pairing.transport e (M i t) | |
| let lift' := fun i (p : Equiv.Perm (Vertices h)) => lift i (e.trans (p.trans e.symm)) | |
| let g' := fun i a N => g i a (ev N) | |
| have hc (i : I) (a : G) (p : Equiv.Perm (Vertices h)) : | |
| g' i (a * lift' i p) = fun N => g' i a (Pairing.relabel p N) := by | |
| funext N | |
| change g i (a * lift' i p) (ev N) = _ | |
| rw [hcov] | |
| change g i a (Pairing.relabel (e.trans (p.trans e.symm)) (Pairing.transport e.symm N)) = | |
| g i a (Pairing.transport e.symm (Pairing.relabel p N)) | |
| rw [Pairing.transport_relabel] | |
| rfl | |
| obtain β¨a,P,hP,hboundβ© := hmain h hh G I T z' | |
| (fun i c => by | |
| have he : histogram (z' i) = histogram (z i) := histogram_comp_equiv (z i) e.symm | |
| rw [he] | |
| exact hz i c) | |
| M' lift' g' hc B (fun i a N => hB i a (ev N)) | |
| refine β¨a,P,hP,?_β© | |
| have hvec (i : I) (t : T) : crossVector (z' i) (M' i t) = crossVector (z i) (M i t) := by | |
| rw [crossVector_transport] | |
| have he : z' i β e = z i := by funext v; simp [z'] | |
| rw [he] | |
| have hav (i : I) (t : T) : | |
| predicateAverage (fun N => N.table (z' i) = (M' i t).table (z' i)) (g' i a) = | |
| predicateAverage (fun N => crossVector (z i) N = crossVector (z i) (M i t)) (g i a) := by | |
| apply predicateAverage_equiv ev | |
| intro N | |
| rw [table_eq_iff_cross, hvec] | |
| change _ β crossVector (z i) (Pairing.transport e.symm N) = _ | |
| rw [crossVector_transport] | |
| have htvec (i : I) (t : T) : | |
| (fun c => ((M' i t).table (z' i) (threeEdgeType (crossPair c)) : β)) = | |
| crossVector (z i) (M i t) := by | |
| rw [β hvec] | |
| funext c | |
| exact (crossCoordinate_eq_table _ _ _).symm | |
| simpa only [hav, htvec] using hbound | |
| end MatchingSmoothing | |
| end OAI | |