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

The reciprocal ratio map a↦a∗/a: strict decrease, inverse, and the exact preimages of points and closed intervals

Statement

Let a∗>0 be a real number and define

F:(0,∞)→(0,∞),F(a):=a∗a=a∗ a−1.

  1. Strict decrease. For reals 0<a1<a2 one has F(a1)>F(a2); so F is strictly decreasing.

  2. Inverse. F is a bijection of (0,∞) onto (0,∞) with inverse F−1(u)=a∗/u: that is, F(F−1(u))=u and F−1(F(a))=a for all a,u>0.

  3. Point preimages. For every u>0, F−1({u})={a∗/u}, and F(a)=u holds if and only if a=a∗/u.

  4. Interval windows. For reals 0<u1≤u2 the preimage of the closed interval is

    F−1([u1,u2])=[a∗u2, a∗u1],

    a nonempty closed interval contained in (0,∞), of length

    a∗u1−a∗u2=a∗(u2−u1)u1u2;

    the length is 0 exactly when u1=u2 and strictly positive exactly when u1<u2.

Facts & Assumptions

Given: A real number a∗>0 and the map F(a)=a∗a−1 on (0,∞).

[F1]

R is an ordered field (Ordered field): the positive cone P={x∈R:x>0} is closed under multiplication, x<y holds exactly when y−x∈P, and for nonzero x exactly one of x∈P, −x∈P holds. In particular x>0 and y>0 imply xy>0, and every nonzero real has a unique multiplicative inverse.

[L1]

Order rules (Sign rules for products and monotonicity of multiplication claims 1 and 4): if a>0 and b>0 then ab>0; and if c>0 then a<b if and only if ac<bc.

[L2]

Reciprocation (Inverses of positives are positive, and reciprocation reverses order claims 1 and 2): if a>0 then a−1>0; and if 0<a<b then 0<b−1<a−1.

Proof

technique · direct
1.1F1L1L2algebra

(Strict decrease.) Let 0<a1<a2. By [L2] claim 2 applied to a1<a2, 0<a2−1<a1−1; since a∗>0, [L1] claim 4 (multiplying the strict inequality by the positive number a∗) gives a∗a2−1<a∗a1−1, that is, F(a2)<F(a1) by the definition of F. Hence F is strictly decreasing on (0,∞), which is claim 1.

1.2F1L2algebra

(Inverse and bijectivity.) Let u>0. By [L2] claim 1, a∗/u>0, so a∗/u lies in the domain (0,∞) of F and is nonzero; using associativity, commutativity and the inverse law in the field R ([F1]), F(F−1(u))=a∗(a∗/u)−1=a∗ u a∗−1=u. Symmetrically, for a>0 one has F−1(F(a))=a∗(a∗a−1)−1=a∗ a a∗−1=a. Thus F and the map u↦a∗/u are mutually inverse, so F is a bijection of (0,∞) onto (0,∞); this is claim 2.

1.3F1L1L2algebra

(Interval windows.) Let 0<u1≤u2 and a>0. The inequality F(a)∈[u1,u2] reads u1≤a∗a−1≤u2; multiplying both inequalities by the positive number a via [L1] claim 4 gives u1a≤a∗≤u2a, equivalently u1a≤a∗ and a∗≤u2a. Dividing the first inequality by the positive u1 and the second by the positive u2, again by [L1] claim 4, gives a≤a∗/u1 and a≥a∗/u2, that is, a∈[a∗/u2, a∗/u1]. Conversely every a in that interval satisfies u1a≤a∗≤u2a and hence, after division by the positive a, lies in F−1([u1,u2]); so F−1([u1,u2])=[a∗/u2,a∗/u1]. The interval is nonempty because u1≤u2 and division of positive numbers reverses the reciprocal order ([L2] claim 2 applied to u1<u2, with the equality case u1=u2 giving coincident endpoints), and both endpoints are strictly positive by [L2] claim 1; this is the first part of claim 4.

2.1F1L1L2step 1.2algebra

(Point preimages.) Let u>0 and a>0. Multiplying the equation a∗a−1=u by the nonzero number a and using field arithmetic gives a∗=ua; multiplying instead by the nonzero number u−1 gives a=a∗u−1=a∗/u. Conversely F(a∗/u)=u by step 1.2. Hence F(a)=u if and only if a=a∗/u, and the point preimage is the singleton {a∗/u}; this is claim 3.

2.2F1L1L2step 1.3algebra

(Length of the window.) The length of the interval of step 1.3 is a∗u1−a∗u2=a∗u2−a∗u1u1u2=a∗(u2−u1)u1u2, by field arithmetic. The denominator is a product of positive numbers, hence positive ([F1], [L1] claim 1), and the numerator is a product of a∗>0 with u2−u1≥0, hence nonnegative, and positive exactly when u2−u1>0 by the trichotomy in [F1]. Therefore the length is zero exactly when u1=u2 and strictly positive exactly when u1<u2, which completes claim 4.

3.1F1step 1.1step 1.2step 2.1step 1.3step 2.2∎

Collecting the steps: claim 1 is step 1.1, claim 2 is step 1.2, claim 3 is step 2.1, and claim 4 is steps 1.3 and 2.2. No step uses calculus, a choice principle, a limit or a completeness property of R beyond the ordered field axioms of [F1]; the map and its inverse are explicit rational expressions.

Depends on

Dependency tree · 2 levels

Sources