Theorems · Definition · convex and discrete geometry
IsVisible
(𝕜 : Type u_1) →
{V : Type u_2} →
{P : Type u_3} →
[inst : Field 𝕜] →
[LinearOrder 𝕜] → [inst_2 : AddCommGroup V] → [Module 𝕜 V] → [AddTorsor V P] → Set P → P → P → PropTwo points are visible to each other through a set if no point of that set lies strictly
between them.
By convention, a point x sees itself through any set s, even when x ∈ s.
- Defined in
- Mathlib.Analysis.Convex.Visible
- Cited by
- 12 results in Mathlib
- Foundations
- Depth 48 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Modulestatement and proof · cited by 20,661
- AddCommGroupstatement and proof · cited by 12,871
- LinearOrderstatement and proof · cited by 8,572
- Fieldstatement and proof · cited by 7,404
- AddTorsorstatement and proof · cited by 1,657
- Sbtwproof · cited by 122
Cited by12
Results whose statement or proof uses this declaration.
- IsClosed.convexHull_subset_affineSpan_isVisiblestatement and proof · cited by 1
- IsClosed.exists_wbtw_isVisiblestatement · cited by 1
- isVisible_commstatement · cited by 1
- IsVisible.eq_of_mem_interiorstatement and proof · cited by 1
- IsVisible.mem_convexHull_isVisiblestatement and proof · cited by 1
- IsVisible.of_convexHull_of_posstatement and proof · cited by 1
- IsVisible.symmstatement · cited by 1
- rank_le_card_isVisiblestatement and proof · cited by 0
- isVisible_iff_lineMapstatement · cited by 0
- IsVisible.monostatement and proof · cited by 0
- IsVisible.rflstatement · cited by 0
- IsOpen.eq_of_isVisible_of_left_memstatement and proof · cited by 0