Scale boundedness #
The four-way endpoint classification of scales — open, lower closed, upper closed, closed —
of [kennedy-mcnally-2005] (22) and [kennedy-2007] (59), found independently by
[rotstein-winter-2004]. Boundedness is the lexical tag a fragment entry stores (a record
field cannot hold an OrderTop instance); degreeShape is an order carrier of that shape,
with a greatest element exactly when the scale HasMax. dual is the antonym's scale, the
same degrees with the ends exchanged, and ScalePolarity says which member of an antonym
pair an adjective is.
Main declarations #
Scale boundedness #
Which endpoints a scale has ([kennedy-mcnally-2005] (22), [kennedy-2007] (59)). Open scales may further approach a value without reaching it or be unbounded ([kennedy-2007] fn. 28); the tag does not record that.
- open_ : Boundedness
- lowerBounded : Boundedness
- upperBounded : Boundedness
- closed : Boundedness
Instances For
Equations
- Degree.instDecidableEqBoundedness x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- Degree.instReprBoundedness = { reprPrec := Degree.instReprBoundedness.repr }
Equations
- One or more equations did not get rendered due to their size.
- Degree.instReprBoundedness.repr Degree.Boundedness.open_ prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Degree.Boundedness.open_")).group prec✝
- Degree.instReprBoundedness.repr Degree.Boundedness.closed prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Degree.Boundedness.closed")).group prec✝
Instances For
The scale has a maximum.
Equations
- Degree.Boundedness.upperBounded.HasMax = True
- Degree.Boundedness.closed.HasMax = True
- Degree.Boundedness.open_.HasMax = False
- Degree.Boundedness.lowerBounded.HasMax = False
Instances For
Equations
- Degree.Boundedness.open_.instDecidablePredHasMax = isFalse Degree.Boundedness.instDecidablePredHasMax._proof_1
- Degree.Boundedness.lowerBounded.instDecidablePredHasMax = isFalse Degree.Boundedness.instDecidablePredHasMax._proof_2
- Degree.Boundedness.upperBounded.instDecidablePredHasMax = isTrue trivial
- Degree.Boundedness.closed.instDecidablePredHasMax = isTrue trivial
The scale has a minimum.
Equations
- Degree.Boundedness.lowerBounded.HasMin = True
- Degree.Boundedness.closed.HasMin = True
- Degree.Boundedness.open_.HasMin = False
- Degree.Boundedness.upperBounded.HasMin = False
Instances For
Equations
- Degree.Boundedness.open_.instDecidablePredHasMin = isFalse Degree.Boundedness.instDecidablePredHasMin._proof_1
- Degree.Boundedness.lowerBounded.instDecidablePredHasMin = isTrue trivial
- Degree.Boundedness.upperBounded.instDecidablePredHasMin = isFalse Degree.Boundedness.instDecidablePredHasMin._proof_2
- Degree.Boundedness.closed.instDecidablePredHasMin = isTrue trivial
The antonym's scale: the same degrees with the ends exchanged ([kennedy-2007] (61)).
Equations
Instances For
Degree carrier per scale shape #
A computable order carrier for each shape — only the OrderTop/NoMaxOrder mixin matters,
not the carrier. The grounding is proved once here; per-dimension views transport it
(Features.ScalarDimension.degree).
Degree carrier per boundedness shape: a greatest element exists exactly when the scale
HasMax.
Equations
Instances For
Equations
- One or more equations did not get rendered due to their size.
A greatest degree exists exactly when the classification says HasMax.
Scale polarity #
Intrinsic polarity of a scale dimension: positive is the unmarked direction (tall,
hot), negative the inverted one (short, cold).
- positive : ScalePolarity
- negative : ScalePolarity
Instances For
Equations
- Degree.instDecidableEqScalePolarity x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- Degree.instReprScalePolarity = { reprPrec := Degree.instReprScalePolarity.repr }
Equations
- One or more equations did not get rendered due to their size.
Instances For
The scale an adjective measures on: its dimension's scale for the positive member of an antonym pair, the same scale with the ends exchanged for the negative member.