Smallest positive fraction: why none exists

Define the set before asking for its least member

Smallest positive fraction sounds like a search that might finish after enough careful comparisons. For the set in this paper exercise, it cannot finish with a winning candidate. The allowed values are all positive rational numbers: p divided by q, where p and q are positive integers and there is no upper limit on the denominator. Any proposed member has a positive rational half that is strictly smaller. The argument concerns exact abstract values, without a measurement or a claim about the smallest physical object.

A least member would have to satisfy two requirements. It must belong to the allowed set, and its value must be no larger than every other allowed member. A number lying below the whole set does not automatically meet the first requirement. Keep membership beside the comparison question. The word positive means strictly greater than zero here, so zero is excluded from the outset. This choice will matter when zero later appears as a possible answer.

Test a candidate without declaring the search complete

Suppose someone proposes three fifths. It is an allowed value because its numerator and denominator are positive integers. Three tenths is allowed too. Three tenths is half of three fifths and is strictly smaller, so three fifths cannot be the least member. The comparison does not show that three tenths is the answer. It supplies a reason to reject the particular proposed minimum while leaving the whole set unchanged.

Now try one thousandth, which may look much smaller on a page. One two-thousandth is still positive and rational, and it is half as large. Thus one thousandth also fails the least-member requirement. A long denominator does not close the set to further candidates. The definition permits another positive integer denominator, including twice the one just written. Keep that permission explicit instead of turning an impressive-looking fraction into an unstated denominator limit.

Prove the same comparison for an arbitrary candidate

Let a be any allowed value. By the definition of the set, write a as p/q with p and q positive integers. Construct b as p/(2q). Its numerator is still a positive integer, and its denominator is a positive integer because twice a positive integer is positive. Therefore b belongs to the same allowed set. This membership check is essential: finding a smaller number outside the set would not disprove that a was least within it.

The new value b equals a/2. Since a is positive, a/2 is positive. Subtracting b from a leaves a/2, which is also positive, so b is strictly smaller than a. In one line, 0 < a/2 < a. We have constructed a permitted member below the arbitrary candidate, without changing the rule for what is allowed. No proposed positive rational value can survive that same test.

The candidate a was arbitrary rather than a special sample such as three fifths. If a least member existed, apply the construction to that member itself. Its half would be a smaller permitted member, contradicting the requirement that the chosen value be least. Consequently the full set of positive rational numbers has no least member. A finite run of examples illustrates the construction; the arbitrary-candidate argument establishes the conclusion for every member of the stated set.

Compare values rather than written forms

Fractions can have different numerators and denominators while naming the same value. One half and two fourths are equal. Rewriting one half as two fourths does not provide a smaller candidate. By contrast, replacing one half with one fourth changes the value to its half. Keep that distinction visible when you check a proposed construction: a longer fraction or a larger denominator alone is not the claim being proved.

The halving proof does not require a fraction to be reduced first. If a is ten divided by two, then b can be ten divided by four. Their values are five and five halves, respectively, and the second is positive and smaller. Reducing the written fractions would give the same value comparison. Likewise, using two fourths for a gives two eighths for b. A common factor in the original spelling supplies no exception to the argument.

Explain why zero does not answer the original question

Zero lies below every positive rational member. In that sense it is a lower bound: no allowed value is less than zero. But zero is not itself a positive rational member. Calling it the smallest positive fraction would discard the set's strict positivity requirement at the moment an answer is chosen. The original question asks for a member, so a lower bound outside the set does not settle it.

For a positive rational number proposed as a lower bound, its own half provides a direct check. That half is in the set and lies below the proposed bound, so the positive rational bound fails. This statement concerns a proposed rational bound. The explanation does not need to claim a theorem about every real-number bound, name a limit, or infer an infinite process from a finished drawing. The two facts needed here are simpler: zero is excluded, and every permitted candidate has a smaller permitted half.

Change to a finite allowed list openly

Consider a different set containing only one half, one third and one fourth. One fourth is its least member: it appears in the list and is smaller than the other two values. Halving it produces one eighth, which is a positive rational number but is not in this finite allowed list. Thus the construction that worked for the full positive rational set cannot be transferred unchanged. Its membership step fails in this revised domain.

The size of a written list and the size of the set it defines are separate questions. Printing a few positive fractions as examples does not necessarily declare them to be the only permitted values. Label a finite inventory with words such as only these three values if that is the intended rule. Otherwise a reader may reasonably keep the original unrestricted denominator permission, under which one eighth remains available and one fourth cannot be least.

Use positive integers as another domain control

The positive integers have a least member, one. Every positive integer is at least one, and one belongs to that set. Halving one gives one half, which is not an integer. This is another clear failure of the membership step after the domain changes. The existence of infinitely many positive integers does not prevent their having a least member, so the word infinite by itself supplies no explanation for the fraction result.

Nor does finding a smaller value for some positive integers settle the integer case. The integer six has the smaller positive integer three, for example. The integer two has the smaller positive integer one. The halving construction must work inside the allowed set for every candidate if it is to rule out a least member by that route. At one it leaves the positive integer domain, and the integer set does have a minimum.

Admit zero only as a declared new rule

If the allowed set is changed to the nonnegative rational numbers, zero becomes a member. It is no larger than any other member and is therefore the least value in that changed set. Halving zero gives zero again. The result is not strictly smaller, so the positive-candidate argument loses the strict inequality it used earlier. Keep the word nonnegative with this version rather than presenting zero as an overlooked answer to the original positive-only question.

A useful finished note can place the domains side by side in prose. All positive rational values have no least member because halving preserves membership and gives a strict decrease. The three-item finite list has least value one fourth, and the positive integers have least value one. The nonnegative rational set has least value zero. These conclusions differ because the membership rules differ, not because the same arithmetic mysteriously gives contradictory answers.

Bound the optional tabletop accounts

The Chouchou Touch blue-border placemat account shows selected blue mats, an unconfirmed napkin prop and alternate border colors. Keep its selected identity blue. Exact size, material, maker and delivered contents are not independently verified.

The Vin de France placemat account retains catalog brand 0 and description name Pimpernel without an asserted maker relationship. Its sole image shows four wine-label mats. No size, material, heat, stain, cleaning or brand-history claim is adopted.

Neither account supplies the fraction set or the proof. Both are optional tabletop context, without a measurement, cutting instruction or claim about the smallest actual item.

Keep neighboring extrema questions separate

The minimum connection cost guide selects from a finite collection of allowed paper links and attains a connected total of twelve fictional units. Here every positive rational candidate has another allowed value below it. No finite edge selection is being optimized.

The greatest common divisor on paper guide finds an attained largest shared integer divisor and uses it in a regular tiling model. This worksheet concerns the absence of a least positive rational member, with no divisor algorithm or physical layout.

Keep an actual transaction outside the fractions

If you separately consider a placemat order on republeq.com, assess the current offer and transaction before choosing how to pay. The exact fractions in this worksheet are invented mathematical inputs, not product measurements, prices or cryptocurrency amounts. Before using USDT, inspect the actual checkout and determine what that particular order presents. Check the requested amount and denomination, the receiving destination displayed, any network instruction, and the order status before sending funds. These are questions to resolve, rather than statements that an option exists for either offer. Confirm that the item and intended quantity match your proposed order. Resolve product and supplied-content questions separately from payment instructions. A photograph does not authenticate transaction terms. Keep the current instructions, their date and the result of any action you actually take, distinguishing a pending step from a completed payment. If the selection changes while you are checking, review the resulting transaction instead of carrying an earlier conclusion across automatically. Determine what the merchant currently supplies about delivery, cancellation and any refund process before relying on it. Do not assume a transfer can be reversed or a particular network will be supported. This conditional checklist makes no claim about token acceptance, transfer success or available remedies. You can complete the paper worksheet without buying either offer. A mathematical comparison cannot authenticate a payment destination or show that an order has been accepted. The actual purchase needs its own clear and current order-specific evidence, and its records belong separately from this abstract exercise. Retain unanswered questions beside the proposed transaction.

Keep membership beside the smaller candidate

For any positive rational a, retain a/2 with the two checks that matter: it remains a positive rational member and is strictly smaller. That pair of checks defeats every proposed least member in the original set. Leave zero outside that set while recognizing its lower-bound role. If the allowed domain changes, redo the membership check before reusing the argument. The finite-list and integer controls show exactly why a smaller abstract number need not be a permitted counterexample.