Theorems · Inductive type · linear algebra
LinearMap.BilinForm.IsNonneg
{R : Type u_1} →
{M : Type u_2} →
[inst : CommSemiring R] →
[inst_1 : AddCommMonoid M] → [inst_2 : Module R M] → [LE R] → LinearMap.BilinForm R M → PropA bilinear form B is nonnegative if for any x we have 0 ≤ B x x.
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 34 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Modulestatement · cited by 20,661
- AddCommMonoidstatement · cited by 12,281
- CommSemiringstatement · cited by 10,911
- LinearMap.BilinFormstatement · cited by 501
Cited by12
Results whose statement or proof uses this declaration.
- LinearMap.BilinForm.IsNonneg.nonnegstatement and proof · cited by 5
- LinearMap.BilinForm.IsPosSemidef.isNonnegstatement · cited by 5
- LinearMap.BilinForm.isNonneg_iffstatement · cited by 2
- LinearMap.BilinForm.isPosSemidef_defstatement and proof · cited by 2
- LinearMap.BilinForm.isNonneg_defstatement and proof · cited by 1
- LinearMap.BilinForm.IsNonneg.smulstatement and proof · cited by 1
- LinearMap.BilinForm.isNonneg_zerostatement · cited by 0
- LinearMap.BilinForm.IsNonneg.addstatement and proof · cited by 0
- LinearMap.BilinForm.IsNonneg.casesOnstatement and proof · cited by 0
- LinearMap.BilinForm.IsNonneg.recOnstatement and proof · cited by 0
- LinearMap.BilinForm.IsPosSemidef.casesOnstatement and proof · cited by 0
- LinearMap.BilinForm.IsPosSemidef.recOnstatement and proof · cited by 0