Finset.eq_affineCombination_subset_iff_eq_affineCombination_subtype
∀ (k : Type u_1) (V : Type u_2) {P : Type u_3} [inst : Ring k] [inst_1 : AddCommGroup V] [inst_2 : Module k V]
[S : AddTorsor V P] {ι : Type u_4} {p0 : P} {s : Set ι} {p : ι → P},
(∃ fs, ↑fs ⊆ s ∧ ∃ w, ∑ i ∈ fs, w i = 1 ∧ p0 = (Finset.affineCombination k fs p) w) ↔
∃ fs w, ∑ i ∈ fs, w i = 1 ∧ p0 = (Finset.affineCombination k fs fun i => p ↑i) wSuppose an indexed family of points is given, along with a subset
of the index type. A point can be expressed as an
affineCombination using a Finset lying within that subset and
with sum of weights 1 if and only if it can be expressed an
affineCombination with sum of weights 1 for the corresponding
indexed family whose index type is the subtype corresponding to that
subset.
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Setstatement and proof · cited by 53,352
- Modulestatement and proof · cited by 20,661
- Finsetstatement and proof · cited by 13,712
- AddCommGroupstatement and proof · cited by 12,871
- SetLike.coestatement and proof · cited by 8,199
- Ringstatement and proof · cited by 7,463
- Set.Elemstatement and proof · cited by 7,166
- Finset.sumstatement and proof · cited by 5,195
- AddTorsorstatement and proof · cited by 1,657
- AffineMapstatement · cited by 674
- Finset.affineCombinationstatement · cited by 159
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.