Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-generatedprecheck 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.

Multiplying inequalities of positives

Statement

Let F be an ordered field. If 0<a<b and 0<c<d then ac<bd. If 0≤a≤b and 0≤c≤d then ac≤bd.

Facts & Assumptions

Given: Elements a,b,c,d of an ordered field F.

[L1]

For a positive multiplier c>0: x<y  ⟺  xc<yc; multiplying a strict inequality by a positive element preserves it (Sign rules for products and monotonicity of multiplication).

[L2]

For c≥0: x≤y⇒xc≤yc; the case c>0 is [L1] and the case c=0 gives 0≤0 (Sign rules for products and monotonicity of multiplication).

[L3]

The order is transitive: if x<y and y<z then x<z, and likewise for ≤, since the positive cone is closed under addition (Ordered field).

Proof

technique · direct
1.1

Assume 0<a<b and 0<c<d; since c>0, scaling a<b by c gives ac<bc.

L1
1.2

Since b>0 (from 0<a<b), scaling c<d by b gives bc<bd.

L1
1.3

Assume instead 0≤a≤b and 0≤c≤d; since c≥0, from a≤b we get ac≤bc.

L2
1.4

Since b≥0 (from 0≤a≤b), from c≤d we get bc≤bd.

L2
2.1

By transitivity, ac<bc<bd, hence ac<bd, proving the strict claim.

L3step 1.1step 1.2
2.2

By transitivity of ≤, ac≤bc≤bd, hence ac≤bd, proving the nonstrict claim.

L3step 1.3step 1.4
3.1

Both the strict and the nonstrict inequalities hold.

step 2.1step 2.2∎

Depends on

Used by

Dependency tree · two levels

5 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