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.

Basic properties of the absolute value

Statement

Let FF be an ordered field (Ordered field) and let x,yFx, y \in F, with x|x| the absolute value (Absolute value in an ordered field). Then

x0;x=0    x=0;xxx;x=x;xy=xy;|x| \ge 0; \quad |x| = 0 \iff x = 0; \quad -|x| \le x \le |x|; \quad |-x| = |x|; \quad |xy| = |x|\,|y|;

and, for every c>0c > 0, one has x<c    c<x<c|x| < c \iff -c < x < c.

Facts & Assumptions

Given: An ordered field FF and elements x,yFx, y \in F.

[L1]

Absolute value: u=u|u| = u if u0u \ge 0, and u=u|u| = -u if u<0u < 0 (Absolute value in an ordered field).

[L2]

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

[L3]

Signs in products: (a)b=(ab)(-a)b = -(ab) and (a)(b)=ab(-a)(-b) = ab (Sign rules for products: (a)b=(ab)(-a)b = -(ab) and (a)(b)=ab(-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>0x > 0: by [L1] x=x>0|x| = x > 0, so x0|x| \ge 0 and x0|x| \ne 0; since x<0-x < 0 we get x=(x)=x=x|-x| = -(-x) = x = |x| by [L1], and x=x<0<x=x-|x| = -x < 0 < x = |x|, so xxx-|x| \le x \le |x|.

assume-case posL1L2algebra
1.2

Case x=0x = 0: then x=0=0|x| = |0| = 0, so x0|x| \ge 0 holds with x=0|x| = 0 and x=0x = 0, while x=0=x|-x| = |0| = |x| and x=000=x-|x| = 0 \le 0 \le 0 = |x|.

assume-case zeroL1
1.3

Case x<0x < 0: by [L1] x=x|x| = -x, and [L2] gives x>0-x > 0, so x>0|x| > 0 and x0|x| \ne 0; here x=x=x|-x| = -x = |x| by [L1], and x=(x)=xx-|x| = -(-x) = x \le x while x<0<x=xx < 0 < -x = |x|, so xxx-|x| \le x \le |x|.

assume-case negL1L2algebra
1.4

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

assume-case zerofactorL1
1.5

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

assume-case sameL1L3L4
1.6

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

assume-case oppositeL1L3L4
2.1

By trichotomy [L2] each xx lies in exactly one of the cases 1.1-1.3, and in each we verified x0|x| \ge 0, that x=0    x=0|x| = 0 \iff x = 0, that x=x|-x| = |x|, and that xxx-|x| \le x \le |x|; hence all four hold for every xx.

step 1.1step 1.2step 1.3cases-exhaustive
2.2

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

step 1.4step 1.5step 1.6cases-exhaustive
3.1

Let c>0c > 0: if x<c|x| < c then c<xxx<c-c < -|x| \le x \le |x| < c by [step 2.1] and [L2], so c<x<c-c < x < c; conversely if c<x<c-c < x < c then both x<cx < c and x<c-x < c, and since x|x| equals xx or x-x by [L1], we get x<c|x| < c, so x<c    c<x<c|x| < c \iff -c < x < c.

step 2.1L1L2

Depends on

Used by

…and 251 more results.

Dependency tree · next 3 levels

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