Math 2.0

definition

Upper bound

Definition

Let (P,≤)(P, \le) be a partially ordered set and let SS be a subset of PP. An element u∈Pu \in P is an upper bound of SS when s≤us \le u for each s∈Ss \in S. The set SS is bounded above when it has an upper bound.

Remarks

An upper bound need not be in SS. The number 11 is an upper bound of [0,1)[0, 1) in R\mathbb{R}, and so is 55. A lower bound is defined in the same way with u≤su \le s. The least upper bound of SS, when it exists, is the supremum of SS.

Explanations

L1 human

An upper bound is a ceiling for the set: no element of the set is above it. The set {1,1/2,1/3,… }\{1, 1/2, 1/3, \dots\} has upper bounds 11, 22, 100100 and many more.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

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

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Upper_and_lower_bounds, lead section