Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (openai/gpt-5.4)audited 2026-07-25
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Reciprocals and order: 1/r against 1

Statement

Let F be an ordered field and let r∈F with r>0. Then:

0<r<1  ⟺  1r>1,r>1  ⟺  0<1r<1,r=1  ⟺  1r=1.

Here 1r denotes the multiplicative inverse r−1.

Facts & Assumptions

Given: An element r>0 of an ordered field F.

[L2]

If 0<x<y then 0<y−1<x−1: the reciprocal reverses order on the positives (Inverses of positives are positive, and reciprocation reverses order).

[L4]

In any field, 1−1=1 and (x−1)−1=x for x≠0 (Field).

Proof

technique · direct
1.1

Since r>0, [L1] gives r−1>0, so 1r is positive throughout.

L1
1.2

In particular 1−1=1 and (r−1)−1=r by uniqueness of inverses.

L4
2.1

If 0<r<1, applying [L2] to 0<r<1 gives 0<1−1<r−1, that is 1<1r.

L2step 1.2
2.2

Conversely, if 1r>1, then 0<1<1r by [L3], and applying [L2] gives 0<(r−1)−1<1−1, that is 0<r<1.

L2L3step 1.2
2.3

If r>1, then 0<1<r by [L3], and applying [L2] gives 0<r−1<1−1, that is 0<1r<1.

L2L3step 1.2
2.4

Conversely, if 0<1r<1, applying [L2] to 0<r−1<1 gives 0<1−1<(r−1)−1, that is 1<r.

L2step 1.2
2.5

If r=1 then 1r=1−1=1; conversely if 1r=1 then r=(r−1)−1=1−1=1.

step 1.2
3.1

Combining the two directions in each case: 0<r<1  ⟺  1r>1, and r>1  ⟺  0<1r<1, and r=1  ⟺  1r=1.

step 2.1step 2.2step 2.3step 2.4step 2.5∎

Depends on

Used by

Dependency tree · two levels

6 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources