MATH11121 Chap.5 Direct Proof and Counterexamples
Direct Proof and Counterexamples
Direct Proof and Counterexamples matches evidence to quantifier structure. A direct proof fixes an arbitrary object, unfolds definitions and reaches the stated conclusion. A counterexample instead supplies one valid domain object that makes a universal claim fail. Divisibility and parity definitions provide the algebraic forms used to close many elementary arguments.
What this chapter covers
- 01
Arbitrary elements
- 02
Direct implication
- 03
Divisibility definitions
- 04
Parity forms
- 05
Biconditional directions
- 06
Counterexample search
Worked example · free
Prove a divisor reaches a difference
- 2Introduce integers r and s with b=ar and c=as.
- 2Factor b-c as a(r-s) and identify r-s as an integer.
- 1Invoke the divisibility definition to conclude.
Key terms
- Arbitrary element
- A fixed but unrestricted member used in a universal proof.
- Divisibility
- The relation a divides b when b equals a times an integer.
- Refutation
- An argument establishing that a mathematical statement is false.
Direct Proof and Counterexamples FAQ
Why are several examples not a proof?
A finite collection of successful examples cannot establish a claim about every element of an infinite domain. Examples may suggest a pattern, while a general argument must explain why the conclusion follows for an arbitrary permitted object.
What makes a valid counterexample?
The object must belong to the stated domain, satisfy the hypothesis and fail the conclusion. An object outside the domain or one that makes the hypothesis false does not refute the implication.
Why state where a new variable belongs?
Definitions often introduce a multiplier or witness whose membership in the integers or another set is essential. Naming that set justifies later closure steps and shows that the final expression matches the definition.
How should a direct proof begin?
Fix an arbitrary object in the stated domain and assume exactly the hypothesis. Unpack useful definitions before manipulating expressions. Avoid choosing a convenient special value, because a universal proof must work without restrictions beyond those supplied by the theorem.
Which values are useful in a counterexample search?
Try boundary values, zero, one, negative inputs, the smallest permitted object and cases where an inequality becomes equality. Each candidate still needs a full check that it lies in the domain, satisfies the hypothesis and defeats the conclusion.
What distinguishes a proof example from a proof of the general claim?
An example checks one permitted object, whereas a proof begins with an arbitrary object and uses only properties shared by the whole domain. If a step relies on a convenient numerical choice, it cannot establish the universal conclusion.
Exam move
Organise direct proofs as a chain with four checkpoints: domain, assumption, definition and target conclusion. Practise converting even, odd and divisibility language into algebraic forms with explicitly named integer variables. For biconditionals, separate the two directions and restart the assumptions between them. Build counterexample searches around the implication failure pattern rather than random testing.
Try boundary values such as zero, one, negative numbers and equality cases, but verify domain membership before claiming success. Compare course model solutions with your own work and highlight missing quantifiers, unintroduced symbols, copied-expression errors and vague endings. Rewrite any proof whose last line does not visibly match the requested conclusion.
Avoid informal shortcuts such as “even plus odd” when the task expects a definition-based argument. During revision, alternate one proof with one refutation so the evidence burden remains distinct. Close every answer with a full sentence naming the theorem or universal claim that has been established or disproved. Build a definition-to-target worksheet.
In one column place the hypothesis definition, in another the desired conclusion form, and in the middle list algebraic operations that preserve the domain. For a divisibility proof, the target column should end as the proposed divisor times an integer. For parity, it should end as twice an integer or twice an integer plus one. This destination prevents algebra from becoming aimless.
Practise conjunction and disjunction hypotheses separately: use both facts when the assumption contains AND, and split into cases when it contains OR. For each proof, circle the first sentence that establishes an arbitrary choice and the last sentence that releases it back to the universal claim. Run a counterexample clinic using false statements that are nearly true.
Search smallest values, zero, sign changes and boundary points, then verify both the hypothesis and failed conclusion in writing. Contrast a genuine counterexample with an object that merely lies outside the domain. Use model solutions to study sequencing, but close the file and reproduce the proof with different symbols or numbers. Check introduced multipliers for integer membership and copied polynomials for missing terms.
If a proof contains division, record the nonzero justification before cancelling. If it contains square roots, track both signs where required. End the study block by explaining why a thousand confirming examples cannot replace an arbitrary-element proof, while one valid counterexample can defeat a universal statement.
Working through Direct Proof and Counterexamples in MATH11121? Sia is AskSia’s AI Mathematics tutor — ask any MATH11121 Direct Proof and Counterexamples question and get a clear, step-by-step explanation grounded in how MATH11121 is taught and assessed. Read this chapter free, then take your hardest questions to Sia.