Math 2.0

definition

Triangle

Definition

Let KK be a field and let A\mathcal{A} be an affine space over a KK-vector space. A triangle in A\mathcal{A} is an ordered triple (A,B,C)(A, B, C) of points of A\mathcal{A} that are not collinear. It is written ABCABC or △ABC\triangle ABC. The points AA, BB and CC are its vertices. The segments BCBC, CACA and ABAB are its sides.

Remarks

Three points are not collinear if and only if they are affinely independent: the vectors B−AB - A and C−AC - A are linearly independent. In a Euclidean space, the side lengths are often written a=d(B,C)a = d(B, C), b=d(C,A)b = d(C, A) and c=d(A,B)c = d(A, B). The angles of the triangle are ∠BAC\angle BAC, ∠CBA\angle CBA and ∠ACB\angle ACB. A triangle is isosceles if two sides have the same length, equilateral if all three do, and scalene if no two do. It is a right triangle if one angle is π/2\pi / 2. Mathlib's Affine.Triangle is an affinely independent family of three points, indexed by {0,1,2}\{0, 1, 2\}.

Explanations

L1 human

Pick three points that are not on one straight line and join each pair. The result is a triangle. If the three points were on one line, the "triangle" would be flat, and it would have no area.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 3 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Affine space concept
  2. Collinear points concept
  3. Triangle definition

Sources

  1. Web https://en.wikipedia.org/wiki/Triangle, Definition, terminology, and types