Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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.

Inverses of positives are positive, and reciprocation reverses order

Statement

Let FF be an ordered field (Ordered field) with positive cone PP, and let a,bFa, b \in F.

  1. If a>0a > 0 then a1>0a^{-1} > 0.
  2. If 0<a<b0 < a < b then 0<b1<a10 < b^{-1} < a^{-1}.

Facts & Assumptions

Given: An ordered field FF with positive cone PP, and elements a,bFa, b \in F.

[L1]

x>0    xPx > 0 \iff x \in P; x<0    xPx < 0 \iff -x \in P; and for x0x \neq 0 exactly one of xPx \in P, xP-x \in P holds (Ordered field).

[L2]

Sign rules: a product of a positive and a negative is negative, a product of two positives is positive, and for c>0c > 0 one has a<b    ac<bca < b \iff ac < bc (Sign rules for products and monotonicity of multiplication).

[L3]

0<10 < 1; in particular 101 \neq 0 (The multiplicative identity is positive).

[L4]

PP is closed under addition, so << is transitive (Ordered field).

Proof

technique · direct
1.1

Assume a>0a > 0, so a0a \neq 0 and its inverse a1a^{-1} exists with aa1=1a \cdot a^{-1} = 1; moreover a10a^{-1} \neq 0, since a1a^{-1} has aa as its inverse while 00 is non-invertible (101 \neq 0 by L3).

assume-hypL1L3
2.1

By trichotomy a1Pa^{-1} \in P or a1P-a^{-1} \in P; if a1P-a^{-1} \in P, then a>0a > 0 and a1<0a^{-1} < 0 give aa1<0a \cdot a^{-1} < 0 by the sign rules, i.e. 1<01 < 0, contradicting 0<10 < 1; hence a1Pa^{-1} \in P, i.e. a1>0a^{-1} > 0, proving claim 1.

step 1.1L2L3L1
3.1

Assume 0<a<b0 < a < b; then 0<b0 < b by transitivity, so by claim 1 both a1>0a^{-1} > 0 and b1>0b^{-1} > 0, and the sign rules give a1b1>0a^{-1} b^{-1} > 0.

assume-hypstep 2.1L4L2L1
4.1

Multiplying a<ba < b by the positive a1b1a^{-1} b^{-1} via the sign rules gives a(a1b1)<b(a1b1)a (a^{-1} b^{-1}) < b (a^{-1} b^{-1}); since aa1=1a a^{-1} = 1 and bb1=1b b^{-1} = 1, this simplifies to b1<a1b^{-1} < a^{-1}.

step 3.1L2algebra
5.1

Together with b1>0b^{-1} > 0 from step 3.1, we conclude 0<b1<a10 < b^{-1} < a^{-1}, proving claim 2.

step 3.1step 4.1

Depends on

Used by

…and 172 more results.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 7 results over 5 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources