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

Basic properties of the absolute value

Statement

Let F be an ordered field (Ordered field) and let x,y∈F, with ∣x∣ the absolute value (Absolute value in an ordered field). Then

∣x∣≥0;∣x∣=0  ⟺  x=0;−∣x∣≤x≤∣x∣;∣−x∣=∣x∣;∣xy∣=∣x∣ ∣y∣;

and, for every c>0, one has ∣x∣<c  ⟺  −c<x<c.

Facts & Assumptions

Given: An ordered field F and elements x,y∈F.

[L1]

Absolute value: ∣u∣=u if u≥0, and ∣u∣=−u if u<0 (Absolute value in an ordered field).

[L2]

Ordered-field order: trichotomy holds (for each u exactly one of u>0, u=0, u<0), a<b means b−a is positive, and sums and products of positives are positive (Ordered field).

[L3]

Signs in products: (−a)b=−(ab) and (−a)(−b)=ab (Sign rules for products: (−a)b=−(ab) and (−a)(−b)=ab).

[L4]

Sign rules: a product of two elements of the same sign is positive, and a product of two elements of opposite sign is negative (Sign rules for products and monotonicity of multiplication).

Proof

technique · cases
1.1

Case x>0: by [L1] ∣x∣=x>0, so ∣x∣≥0 and ∣x∣≠0; since −x<0 we get ∣−x∣=−(−x)=x=∣x∣ by [L1], and −∣x∣=−x<0<x=∣x∣, so −∣x∣≤x≤∣x∣.

assume-case posL1L2algebra
1.2

Case x=0: then ∣x∣=∣0∣=0, so ∣x∣≥0 holds with ∣x∣=0 and x=0, while ∣−x∣=∣0∣=∣x∣ and −∣x∣=0≤0≤0=∣x∣.

assume-case zeroL1
1.3

Case x<0: by [L1] ∣x∣=−x, and [L2] gives −x>0, so ∣x∣>0 and ∣x∣≠0; here ∣−x∣=−x=∣x∣ by [L1], and −∣x∣=−(−x)=x≤x while x<0<−x=∣x∣, so −∣x∣≤x≤∣x∣.

assume-case negL1L2algebra
1.4

Case x=0 or y=0: then xy=0, so ∣xy∣=0, and one of ∣x∣,∣y∣ is 0, whence ∣x∣ ∣y∣=0=∣xy∣.

assume-case zerofactorL1
1.5

Case x,y have the same sign (both positive or both negative): by [L4] xy>0, so ∣xy∣=xy, while ∣x∣ ∣y∣=xy by [L3] (for x,y<0 this is (−x)(−y)=xy), hence ∣xy∣=∣x∣ ∣y∣.

assume-case sameL1L3L4
1.6

Case x,y have opposite signs (one positive, one negative): by [L4] xy<0, so ∣xy∣=−(xy), while ∣x∣ ∣y∣=−(xy) by [L3] (namely x(−y) or (−x)y), hence ∣xy∣=∣x∣ ∣y∣.

assume-case oppositeL1L3L4
2.1

By trichotomy [L2] each x lies in exactly one of the cases 1.1-1.3, and in each we verified ∣x∣≥0, that ∣x∣=0  ⟺  x=0, that ∣−x∣=∣x∣, and that −∣x∣≤x≤∣x∣; hence all four hold for every x.

step 1.1step 1.2step 1.3cases-exhaustive
2.2

By trichotomy [L2] each pair x,y lies in exactly one of the cases 1.4-1.6, and in each ∣xy∣=∣x∣ ∣y∣; hence ∣xy∣=∣x∣ ∣y∣ for all x,y.

step 1.4step 1.5step 1.6cases-exhaustive
3.1

Let c>0: if ∣x∣<c then −c<−∣x∣≤x≤∣x∣<c by [step 2.1] and [L2], so −c<x<c; conversely if −c<x<c then both x<c and −x<c, and since ∣x∣ equals x or −x by [L1], we get ∣x∣<c, so ∣x∣<c  ⟺  −c<x<c.

step 2.1L1L2∎

Depends on

Used by

…and 257 more results.

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