OAI/Combinatorics/HadwigerCounterexample/ProductLaws.lean
10 declarations, 0 contain sorry, 0 declared as axioms
Product Laws
- theorem
OAI.HadwigerCounterexample.ind_allline 13 - def
OAI.HadwigerCounterexample.prodWline 21 - theorem
OAI.HadwigerCounterexample.prodW_totline 26 - theorem
OAI.HadwigerCounterexample.prodW_avgline 29 - theorem
OAI.HadwigerCounterexample.prodW_prline 35 - theorem
OAI.HadwigerCounterexample.prodW_nonnegline 41 - theorem
OAI.HadwigerCounterexample.prodW_lawline 44 - theorem
OAI.HadwigerCounterexample.prodW_pr_injline 55Source documentation
Observe distinct coordinates of a (constant-type) product law.
theorem prodW_pr_inj {e : ι → κ} (he : Function.Injective e) {w : κ → Wgt α} (hw : ∀ k, IsLaw (w k)) (p : ι → α → Prop) : pr (prodW (β:=fun _ => α) w) (fun x => ∀ i, p i (x (e i))) = …Mentions: OAI.HadwigerCounterexample.Wgt, OAI.HadwigerCounterexample.IsLaw, OAI.HadwigerCounterexample.pr, OAI.HadwigerCounterexample.prodW
- theorem
OAI.HadwigerCounterexample.prodW_map_injline 86 - theorem
OAI.HadwigerCounterexample.prodW_map_pairsline 98Source documentation
Mapping to ordered pairs along a disjoint family of positions.
theorem prodW_map_pairs (e : ι ⊕ ι → κ) (he : Function.Injective e) {w : Wgt α} (hw : IsLaw w) : mapW (prodW (fun _ : κ => w)) (fun x i => (x (e (.inl i)), x (e (.inr i)))) = prodW (fun _ : ι => pairW w w) := by …Mentions: OAI.HadwigerCounterexample.Wgt, OAI.HadwigerCounterexample.IsLaw, OAI.HadwigerCounterexample.mapW, OAI.HadwigerCounterexample.prodW, OAI.HadwigerCounterexample.pairW