Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-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.

Sign rules for products and monotonicity of multiplication

Statement

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

  1. If a>0a > 0 and b>0b > 0 then ab>0ab > 0.
  2. If a>0a > 0 and b<0b < 0 then ab<0ab < 0.
  3. If a<0a < 0 and b<0b < 0 then ab>0ab > 0.
  4. If c>0c > 0 then a<b    ac<bca < b \iff ac < bc.
  5. If c<0c < 0 then a<b    bc<aca < b \iff bc < ac (multiplication by a negative reverses order).

Facts & Assumptions

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

[L1]

For x,yFx, y \in F: x<y    yxPx < y \iff y - x \in P; x>0    xPx > 0 \iff x \in P; x<0    xPx < 0 \iff -x \in P; and (trichotomy) for each xx exactly one of xPx \in P, x=0x = 0, xP-x \in P holds, so 0P0 \notin P and xPx0x \in P \Rightarrow x \neq 0 (Ordered field).

[L2]

PP is closed under multiplication: if u,vPu, v \in P then uvPuv \in P (axiom O2 of Ordered field).

[L3]

In any field, (u)v=(uv)(-u)v = -(uv) and (u)(v)=uv(-u)(-v) = uv (Sign rules for products: (a)b=(ab)(-a)b = -(ab) and (a)(b)=ab(-a)(-b) = ab).

[L4]

In any field, 0u=00 \cdot u = 0 (Multiplication by zero: 0a=00 \cdot a = 0).

Proof

technique · direct
1.1

Assume a>0a > 0 and b>0b > 0, i.e. aPa \in P and bPb \in P; closure gives abPab \in P, so ab>0ab > 0, proving claim 1.

assume-hypL1L2
1.2

Assume a>0a > 0 and b<0b < 0, i.e. aPa \in P and bP-b \in P; closure gives a(b)Pa(-b) \in P.

assume-hypL1L2
1.3

Assume a<0a < 0 and b<0b < 0, i.e. aP-a \in P and bP-b \in P; closure gives (a)(b)P(-a)(-b) \in P.

assume-hypL1L2
1.4

Assume c>0c > 0 and a<ba < b, i.e. cPc \in P and baPb - a \in P; closure gives (ba)cP(b - a)c \in P.

assume-hypL1L2
1.5

Assume c<0c < 0 and a<ba < b, i.e. cP-c \in P and baPb - a \in P; closure gives (ba)(c)P(b - a)(-c) \in P.

assume-hypL1L2
2.1

Since a(b)=(ab)a(-b) = -(ab) by L3, step 1.2 gives (ab)P-(ab) \in P, so ab<0ab < 0, proving claim 2.

step 1.2L3L1
2.2

Since (a)(b)=ab(-a)(-b) = ab by L3, step 1.3 gives abPab \in P, so ab>0ab > 0, proving claim 3.

step 1.3L3L1
2.3

By distributivity (ba)c=bcac(b - a)c = bc - ac, so step 1.4 gives bcacPbc - ac \in P, i.e. ac<bcac < bc: this is the forward direction of claim 4.

step 1.4algebraL1
2.4

By L3 and distributivity (ba)(c)=((ba)c)=(bcac)=acbc(b - a)(-c) = -((b - a)c) = -(bc - ac) = ac - bc, so step 1.5 gives acbcPac - bc \in P, i.e. bc<acbc < ac: this is the forward direction of claim 5.

step 1.5L3algebraL1
3.1

Conversely, assume c>0c > 0 and ac<bcac < bc; by trichotomy exactly one of a<ba < b, a=ba = b, b<ab < a holds. If a=ba = b then ac=bcac = bc, contradicting ac<bcac < bc; if b<ab < a then the argument of step 2.3 applied to the pair b<ab < a gives bc<acbc < ac, so bcacPbc - ac \in P (from ac<bcac < bc) while acbcPac - bc \in P (from bc<acbc < ac), putting the element bcacbc - ac and its negative acbcac - bc both in PP, which trichotomy forbids; hence a<ba < b: this completes claim 4.

assume-hypstep 2.3L4L1algebra
4.1

Conversely, assume c<0c < 0 and bc<acbc < ac; by trichotomy exactly one of a<ba < b, a=ba = b, b<ab < a holds. If a=ba = b then ac=bcac = bc, contradicting bc<acbc < ac; if b<ab < a then the argument of step 2.4 applied to the pair b<ab < a gives ac<bcac < bc, so acbcPac - bc \in P (from bc<acbc < ac) while bcacPbc - ac \in P (from ac<bcac < bc), putting the element acbcac - bc and its negative bcacbc - ac both in PP, which trichotomy forbids; hence a<ba < b: this completes claim 5.

assume-hypstep 2.4L4L1algebra

Depends on

Used by

…and 111 more results.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 4 results over 3 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