Learn

Learning preferences

Make learning more comfortable. Changes apply immediately.

Enlarges page content, including diagrams and their labels. You can also use your browser’s zoom.

Choose the colours that are easiest for you to distinguish. Applies to lesson diagrams and lab plots. Labels, shapes, hatching and line patterns also distinguish meanings. Source photographs and raw image brightness stay unchanged; mask-only views are available for image overlays.

ExampleComparisonSample link

Saved in this browser on this device. Preferences are separate from progress backups.

Lesson 11 of 46

Construct division without losing equality

Build Frac(R) from a domain and prove its universal property.

Loading your saved responses…

Try the optional starting-point checks and targeted refreshers. You can continue directly into this lesson.

Try

The integer pairs (1,2) and (2,4) should represent the same fraction. Their cross products agree. To generalize this construction, start with a domain R and pairs (a,b) with b nonzero. Declare (a,b) equivalent to (c,d) when ad=bc.

Before adding or multiplying fractions, prove this really is an equivalence relation. Otherwise a “fraction” might depend on which chain of equal representations was used.

Predict

Suppose ad=bc and cf=de. Predict how to derive af=be. Multiplying the equations gives a common factor d that must be canceled. This is where the domain hypothesis enters, and it is why nonzero denominators alone are not sufficient in a ring with zero divisors.

Experiment

Track representative-independent arithmetic in the integer example.

OperationPair formulaExample
Addition(a,b)+(c,d)=(ad+bc,bd)1/2+1/3=5/6
Multiplication(a,b)(c,d)=(ac,bd)(1/2)(2/3)=1/3
Nonzero inverse(a,b)⁻¹=(b,a)(3/5)⁻¹=5/3

Replace one half by two fourths and recompute the first row. The raw numerator and denominator change, but cross multiplication verifies equality. The formulas must preserve equivalence for arbitrary representatives, not only these examples.

Understand

Reflexivity and symmetry of the relation are immediate from equality. For transitivity, ad=bc and cf=de imply adf=bcf=bde. Since d is nonzero in a domain, cancellation gives af=be. The product bd is nonzero, so the arithmetic formulas remain within the allowed pairs.

To check multiplication respects representatives, suppose ab′=a′b and cd′=c′d. Multiplying gives acb′d′=a′c′bd, exactly the cross-product equality for the products. Addition follows by distributing the proposed cross products and using the same two equalities. Thus the operations descend to equivalence classes.

The resulting set Frac(R) is a field. Zero is 0/1, one is 1/1, additive inverse is −a/b, and a nonzero a/b has inverse b/a. A fraction is zero exactly when its numerator is zero. Associativity and distributivity follow by putting representatives over common denominators and applying the ring laws. The map R→Frac(R), a↦a/1, is an injective unital homomorphism because equality of such fractions means equality of their numerators.

This field has a useful universal property. If φ:R→K is an injective unital map into a field, it extends uniquely by a/b↦φ(a)φ(b)⁻¹. Injectivity keeps denominators nonzero. Cross multiplication proves well-definedness, and the formulas preserve operations. Any extension must send b⁻¹ to the inverse of φ(b), so no other extension is possible.

Without the domain condition, the naive construction fails. In Z/6Z the nonzero denominators two and three have zero product, so pair multiplication is not closed. More general localizations exist, but require choosing allowed denominators and a suitable relation; that theory is beyond this construction.

Apply

Compare F[x] with its fraction field F(x). A polynomial inverse of x would contradict additivity of degree, while the formal fraction 1/x is available in F(x). Rational functions are formal fraction classes: equality is cross multiplication, not agreement at every numerical input where a denominator might vanish.

Write down one place where each assumption is used: commutativity, no zero divisors, nonzero denominator, and injectivity of the map into K. This makes the universal property a proved statement rather than an informal claim that fractions “behave as expected.”

Continue

Field extensions next study larger fields as vector spaces over smaller ones. Algebraic elements behave differently from the transcendental symbol x used in a rational-function field.

Apply · explain · revise

Practice and reasoning

Drafts save locally as you type. Reveal worked solutions when useful; the site remembers that exposure. Automatic matches check the requested answer, while written arguments require review against the rubric.

Evaluate 2/3+5/6 as a reduced rational.

Integers, fractions and finite decimals are accepted. Expressions such as sqrt(2) are not parsed by this checker.

Find the inverse of the fraction represented by (7,4) in Frac(Z).

Integers, fractions and finite decimals are accepted. Expressions such as sqrt(2) are not parsed by this checker.

For a domain R prove (a,b)~(c,d) iff ad=bc, with b,d nonzero, is transitive.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Explain why this cross-multiplication construction can fail without the domain hypothesis.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Prove an injective unital map R→K into a field extends uniquely to Frac(R) by a/b↦φ(a)φ(b)⁻¹.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Distinguish F[x] from F(x) and prove x has an inverse in only the latter.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Reflect and continue

Before marking this lesson complete, explain one key idea without the worked solution and identify a condition that matters. Marking complete records participation, not independent mastery.