Difference between revisions of "Minimum function"

Needs to be linked to order theory stuff. Also:

• Characteristic property of the minimum: [math]\forall x,u,v\in S\big[x\eq\text{min}(u,v)\iff\big(x\preceq u \wedge x\preceq v \wedge (x\eq u \vee x\eq v)\big)\big][/math]
  • Proved for [ilmath]\implies[/ilmath] direction.
  • I was working on the [ilmath]\impliedby[/ilmath] direction I was about to (attempt) to prove this lemma (and then use it)
    • Unproven lemma: [math]\big(x\preceq u\wedge x\preceq v)\implies x\preceq \text{min}(u,v)[/math] - via contrapositive
      • Note to self: be sure the logical and has a negation of logical and link ect for all operators! That's a long time coming!
• Some useful lemma: [math]\forall x,u,v\in S\big[x\eq\text{min}(u,v)\implies\big(x\preceq u\wedge x\preceq v\big)\big][/math] which I (believe) I used in defining the minimum of random variables.

This page is short because I wrote it just prior to bed Alec (talk) 07:53, 28 July 2018 (UTC)

Addendum: I will add the following definition:

Let [ilmath](S,\preceq)[/ilmath] be a "totally ordered poset" ("oset"?)

TODO: Look into this

- it must be totally ordered so [ilmath]\forall x,y\in S[/ilmath] exactly one of [ilmath]x\prec y[/ilmath], [ilmath]x\succ y[/ilmath] or [ilmath]x\eq y[/ilmath] holds ("trichotomy law" or something)

Then:

• [math]\text{min}:S^2\rightarrow S[/math] is a function defined by [math]\text{min}(u,v)\mapsto\left\{\begin{array}{lr}\pi_1(u,v) & \text{if }u\prec v\\ \pi_2(u,v) & \text{if }u\succ v \\ \alpha & \text{otherwise}\end{array}\right.[/math] where [ilmath]\pi_1[/ilmath] and [ilmath]\pi_2[/ilmath]^{[Note 1]} are the characteristic projections of a product, and
  • [ilmath]\alpha:\eq \pi_{\alpha'}(u,v)[/ilmath] for [ilmath]\alpha'\eq 1[/ilmath] or [ilmath]\alpha'\eq 2[/ilmath] (it doesn't matter as in the case where [ilmath]\alpha[/ilmath] is used we have {[ilmath]u\eq v[/ilmath] by the "trichotomy law" mentioned above.
  • We include [ilmath]\alpha[/ilmath] to make the cases in analysis more explicit (as this is a Category:First-year friendly page, meaning the readers' hand is held as he reads the steps involved) but also because there is a practical case for a kind of (computer) arithmetic where it is possible that we have [ilmath]\alpha\neq u[/ilmath] and [ilmath]\alpha\neq v[/ilmath] - It might be signed zero, I remember doing it, not why I was doing it unfortunately.