Download data/lean/OAI/GroupTheory/SimpleAmenable/PolygonGeometry/ClosedChartOverlap.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 9.96 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/GroupTheory/SimpleAmenable/PolygonGeometry/ClosedChartOverlap.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/GroupTheory/SimpleAmenable/PolygonGeometry/ClosedChartOverlap.lean
-
curl -L -o ClosedChartOverlap.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/GroupTheory/SimpleAmenable/PolygonGeometry/ClosedChartOverlap.lean
9.96 kB
| import Mathlib | |
| import OAI.GroupTheory.SimpleAmenable.PolygonGeometry.RectangularBound | |
| namespace OAI | |
| section | |
| section | |
| open scoped symmDiff | |
| namespace SimpleAmenable | |
| open scoped commutatorElement | |
| open scoped commutatorElement | |
| section ClosedChartOverlap | |
| theorem planar_lift_avoidsCuts {a : β} (p : GenericSquare a) (t : β Γ β) | |
| (ht : p.val = (Int.fract t.1,Int.fract t.2)) : AvoidsCuts a t := by | |
| have h := avoidsCuts_translate p.property.2.2 | |
| ((βt.1β : CutRing),(βt.2β : CutRing)) | |
| have he : p.val+(ordinary (βt.1β : CutRing),ordinary (βt.2β : CutRing)) = t := by | |
| rw [ht] | |
| apply Prod.ext | |
| Β· change Int.fract t.1+ordinary (βt.1β : CutRing) = t.1 | |
| rw [map_intCast] | |
| exact sub_add_cancel _ _ | |
| Β· change Int.fract t.2+ordinary (βt.2β : CutRing) = t.2 | |
| rw [map_intCast] | |
| exact sub_add_cancel _ _ | |
| rwa [he] at h | |
| theorem coordinateRectangle_strict_lift {a : β} (l h : Fin 2 β CutRing) | |
| (hlh : β j, ordinary (l j) β€ ordinary (h j)) | |
| (hlen : β j, ordinary (h j)-ordinary (l j) < 1) | |
| (p : GenericSquare a) (hp : p β (coordinateRectangle a l h).val) : | |
| β t : β Γ β, p.val = (Int.fract t.1,Int.fract t.2) β§ | |
| (ordinary (l 0) < t.1 β§ t.1 < ordinary (h 0)) β§ | |
| (ordinary (l 1) < t.2 β§ t.2 < ordinary (h 1)) := by | |
| obtain β¨t,ht,hx,hyβ© := coordinateRectangle_lift l h hlh hlen p hp | |
| have hx' := planar_lift_avoidsCuts p t ht 0 (l 0) | |
| have hy' := planar_lift_avoidsCuts p t ht 1 (l 1) | |
| simp only [cutForm,Matrix.cons_val_zero,Matrix.cons_val_one] at hx' hy' | |
| exact β¨t,ht,β¨lt_of_le_of_ne hx.1 (Ne.symm hx'),hx.2β©, | |
| β¨lt_of_le_of_ne hy.1 (Ne.symm hy'),hy.2β©β© | |
| theorem clippedSlope_agree_on_closed_rectangle {a : β} (r : CutRing) (j : Fin 4) | |
| (hr : 0 < ordinary r β§ ordinary r < 1/2) | |
| (u v : CutRing Γ CutRing) (l h : Fin 2 β CutRing) | |
| (hlh : β k, ordinary (l k) β€ ordinary (h k)) | |
| (hlen : β k, ordinary (h k)-ordinary (l k) < 1) | |
| (hu : β k, -ordinary r β€ ordinary (l k)-ordinary (pointCoordinate u k) β§ | |
| ordinary (h k)-ordinary (pointCoordinate u k) β€ ordinary r) | |
| (hv : β k, -ordinary r β€ ordinary (l k)-ordinary (pointCoordinate v k) β§ | |
| ordinary (h k)-ordinary (pointCoordinate v k) β€ ordinary r) | |
| (hline : integralCutForm a j u = integralCutForm a j v) : | |
| spatialTranslate u (clippedSlopePrimitive a r j) β coordinateRectangle a l h = | |
| spatialTranslate v (clippedSlopePrimitive a r j) β coordinateRectangle a l h := by | |
| apply Subtype.ext | |
| ext p | |
| change (p β (spatialTranslate u (clippedSlopePrimitive a r j)).val β§ | |
| p β (coordinateRectangle a l h).val) β | |
| (p β (spatialTranslate v (clippedSlopePrimitive a r j)).val β§ | |
| p β (coordinateRectangle a l h).val) | |
| by_cases hp : p β (coordinateRectangle a l h).val | |
| Β· obtain β¨t,ht,hx,hyβ© := coordinateRectangle_strict_lift l h hlh hlen p hp | |
| have hbox (w : CutRing Γ CutRing) | |
| (hw : β k : Fin 2, -ordinary r β€ ordinary (l k)-ordinary (pointCoordinate w k) β§ | |
| ordinary (h k)-ordinary (pointCoordinate w k) β€ ordinary r) : | |
| (-ordinary r < t.1-ordinary w.1 β§ t.1-ordinary w.1 < ordinary r) β§ | |
| (-ordinary r < t.2-ordinary w.2 β§ t.2-ordinary w.2 < ordinary r) := by | |
| have hw0 := hw 0 | |
| have hw1 := hw 1 | |
| simp only [pointCoordinate,ite_true,Fin.isValue,show (1:Fin 2) β 0 by decide,ite_false] at hw0 hw1 | |
| constructor <;> constructor <;> linarith | |
| rw [translated_clippedSlope_lift r j hr u p t ht (hbox u hu), | |
| translated_clippedSlope_lift r j hr v p t ht (hbox v hv),hline] | |
| Β· simp only [hp,and_false] | |
| end ClosedChartOverlap | |
| section FullTangentOverlap | |
| noncomputable def orderedCutMax (x y : CutRing) : CutRing := | |
| if ordinary x β€ ordinary y then y else x | |
| noncomputable def orderedCutMin (x y : CutRing) : CutRing := | |
| if ordinary x β€ ordinary y then x else y | |
| @[simp] theorem ordinary_orderedCutMax (x y : CutRing) : | |
| ordinary (orderedCutMax x y) = max (ordinary x) (ordinary y) := by | |
| unfold orderedCutMax | |
| split_ifs with h | |
| Β· exact (max_eq_right h).symm | |
| Β· exact (max_eq_left (le_of_not_ge h)).symm | |
| @[simp] theorem ordinary_orderedCutMin (x y : CutRing) : | |
| ordinary (orderedCutMin x y) = min (ordinary x) (ordinary y) := by | |
| unfold orderedCutMin | |
| split_ifs with h | |
| Β· exact (min_eq_left h).symm | |
| Β· exact (min_eq_right (le_of_not_ge h)).symm | |
| noncomputable def clippingOverlapLower (r : CutRing) (t : CutRing Γ CutRing) (j : Fin 2) : CutRing := | |
| orderedCutMax (-r) (pointCoordinate t j-r) | |
| noncomputable def clippingOverlapUpper (r : CutRing) (t : CutRing Γ CutRing) (j : Fin 2) : CutRing := | |
| orderedCutMin r (pointCoordinate t j+r) | |
| theorem clippingOverlap_bounds (r : CutRing) (t : CutRing Γ CutRing) | |
| (hr : 0 < ordinary r β§ ordinary r < 1/2) | |
| (ht : β j, |ordinary (pointCoordinate t j)| β€ 2*ordinary r) (j : Fin 2) : | |
| ordinary (clippingOverlapLower r t j) β€ ordinary (clippingOverlapUpper r t j) β§ | |
| ordinary (clippingOverlapUpper r t j)-ordinary (clippingOverlapLower r t j) < 1 β§ | |
| (-ordinary r β€ ordinary (clippingOverlapLower r t j) β§ | |
| ordinary (clippingOverlapUpper r t j) β€ ordinary r) β§ | |
| (-ordinary r β€ ordinary (clippingOverlapLower r t j)-ordinary (pointCoordinate t j) β§ | |
| ordinary (clippingOverlapUpper r t j)-ordinary (pointCoordinate t j) β€ ordinary r) := by | |
| have hh := abs_le.mp (ht j) | |
| simp only [clippingOverlapLower,clippingOverlapUpper,ordinary_orderedCutMax, | |
| ordinary_orderedCutMin,map_sub,map_neg,map_add] | |
| have h1 := le_max_left (-ordinary r) (ordinary (pointCoordinate t j)-ordinary r) | |
| have h2 := le_max_right (-ordinary r) (ordinary (pointCoordinate t j)-ordinary r) | |
| have h3 := min_le_left (ordinary r) (ordinary (pointCoordinate t j)+ordinary r) | |
| have h4 := min_le_right (ordinary r) (ordinary (pointCoordinate t j)+ordinary r) | |
| refine β¨max_le (le_min (by linarith [hr.1]) (by linarith)) | |
| (le_min (by linarith) (by linarith [hr.1])),by linarith [hr.2],β¨h1,h3β©,?_,?_β© <;> linarith | |
| theorem exists_full_overlap_window (a : β) (r u : CutRing) : | |
| β k : β, β p : Fin 2 β β€, β d : Fin 2, β e : Fin 5, β j : Fin 2, | |
| (p j β€ endpointLabel (clippingOverlapLower r (tangentOffset a d (signedShortSteps u e)) j) β§ | |
| endpointLabel (clippingOverlapLower r (tangentOffset a d (signedShortSteps u e)) j) < p j+k) β§ | |
| (p j β€ endpointLabel (clippingOverlapUpper r (tangentOffset a d (signedShortSteps u e)) j) β§ | |
| endpointLabel (clippingOverlapUpper r (tangentOffset a d (signedShortSteps u e)) j) < p j+k) := by | |
| let q (i : Fin 2 Γ Fin 5 Γ Bool) (j : Fin 2) : β€ := | |
| endpointLabel (if i.2.2 then clippingOverlapUpper r (tangentOffset a i.1 (signedShortSteps u i.2.1)) j | |
| else clippingOverlapLower r (tangentOffset a i.1 (signedShortSteps u i.2.1)) j) | |
| obtain β¨k,p,hpβ© := finite_coordinate_windows_container (fun _ : Fin 2 Γ Fin 5 Γ Bool => 1) q | |
| refine β¨k,p,fun d e j => ?_β© | |
| have hL := hp (d,e,false) j | |
| have hU := hp (d,e,true) j | |
| dsimp [q] at hL hU | |
| omega | |
| namespace InitialCoverSystem | |
| variable {a m M : β} {r : CutRing} {hm : 2 β€ m} | |
| (B : InitialCoverSystem a r m hm M) | |
| [Group.IsPerfect (alternatingGroup (Fin (m+1)))] | |
| theorem tangentSign_step_action_closed (hlarge : 20 β€ m+1) | |
| (hr : 0 < ordinary r β§ ordinary r < 1/2) | |
| (k : β) (p : Fin 2 β β€) (u : CutRing) (h : B.TangentChartLaws k p u) | |
| (d : Fin 2) (e : Fin 5) (z : CutRing Γ CutRing) | |
| (l v : Fin 2 β CutRing) | |
| (hl : β j, p j β€ endpointLabel (l j) β§ endpointLabel (l j) < p j+k) | |
| (hv : β j, p j β€ endpointLabel (v j) β§ endpointLabel (v j) < p j+k) | |
| (hlv : β j, ordinary (l j) β€ ordinary (v j)) | |
| (hlen : β j, ordinary (v j)-ordinary (l j) < 1) | |
| (hbox : β j, -ordinary r β€ ordinary (l j) β§ ordinary (v j) β€ ordinary r) | |
| (hbox' : β j, -ordinary r β€ ordinary (l j)-ordinary | |
| (pointCoordinate (tangentOffset a d (signedShortSteps u e)) j) β§ | |
| ordinary (v j)-ordinary | |
| (pointCoordinate (tangentOffset a d (signedShortSteps u e)) j) β€ ordinary r) | |
| (f : TrackStar (Fin (m+1)) β* BoundedRelationCover M (alternatingGenerator a r m hm)) | |
| (hf : B.AlignedSmallSupported f) | |
| (hc : SmallControlled B.c f (B.fullGeometricSector (by omega) | |
| (translatedTemplate (tangentChartTemplate a k p d (signedShortSteps u e)) z) | |
| (h d e z) (spatialTranslate z (coordinateRectangle a l v)))) | |
| (I : ControlAlphabet (Fin (m+1))) (s : UniversalExtension (alternatingGroup I.val)) : | |
| β x β f.range, | |
| B.tangentSign (by omega) k p u h d z true (universalMap (subtypeAlternatingHom I.val) s)*x* | |
| (B.tangentSign (by omega) k p u h d z true (universalMap (subtypeAlternatingHom I.val) s))β»ΒΉ = | |
| B.tangentSign (by omega) k p u h d (z+tangentOffset a d (signedShortSteps u e)) true | |
| (universalMap (subtypeAlternatingHom I.val) s)*x* | |
| (B.tangentSign (by omega) k p u h d (z+tangentOffset a d (signedShortSteps u e)) true | |
| (universalMap (subtypeAlternatingHom I.val) s))β»ΒΉ := by | |
| rw [B.tangentSign_first (by omega) k p u h d z e true, | |
| B.tangentSign_second (by omega) k p u h d z e true] | |
| apply B.chart_action_transfer hlarge _ (h d e z) _ _ _ | |
| (tangentChart_first_resolved p d _ z) (tangentChart_second_resolved p d _ z) | |
| (tangentChart_rectangle_resolved p d _ z l v hl hv) _ f hf hc I s | |
| have he := clippedSlope_agree_on_closed_rectangle (a := a) r (slopeDirection d) hr | |
| (0 : CutRing Γ CutRing) (tangentOffset a d (signedShortSteps u e)) l v hlv hlen | |
| (by simpa [pointCoordinate] using hbox) hbox' | |
| (by simp only [integralCutForm_zero,integralCutForm_tangentOffset]) | |
| have he' := congrArg (spatialTranslate z) he | |
| simpa only [spatialTranslate_inter,β spatialTranslate_add,add_zero] using he' | |
| end InitialCoverSystem | |
| end FullTangentOverlap | |
| end SimpleAmenable | |
| end | |
| end | |
| end OAI | |