D421 Discrete Math: Functions and Relations, catalog number MATH 2830, is the one-CU module covering set theory, finite sequences, series and relations. It is the second part of the discrete mathematics split from the older C959, and it is the module that quietly does the most work for a computing student, because sets and relations are what databases, type systems and data models are built out of.
Why this module matters more than its size suggests
A single competency unit sounds like a formality. The content list argues otherwise. A relation is a set of ordered pairs, which is exactly what a table in a relational database is. An equivalence relation is what partitions data into groups. A function is a relation with a uniqueness constraint, which is what a key enforces. Reading the module this way makes it concrete rather than abstract, and concrete material is far easier to retain.
The abstraction is deliberate. Discrete mathematics gives you one vocabulary that describes many later systems, and the point of learning it here is so that when you meet a many-to-many join or a hash function or an ordering constraint later, you already have the words and the properties.
D421 in the C959 arrangement
WGU carries both arrangements. C959 Discrete Mathematics I under MATH 2800 is the four-CU course covering logic, proofs, Boolean algebra, set theory, sequences, series, relations, graphs and trees together. The split spreads that across D420 Discrete Math: Logic, this module, and D422 Discrete Math: Algorithms and Cryptography.
Content transfers directly, so a chapter written for the set theory and relations portion of the older course is study material for this module. The competency list and the assessment belong to the code on your own Degree Plan, so read your Course of Study rather than assuming.
The four properties are the whole module
If you learn one thing precisely in D421, make it the four relation properties, because almost every question about relations reduces to checking them.
A relation is reflexive when every element relates to itself, and checking it means checking every element, not most. It is symmetric when a relation in one direction forces the reverse, and antisymmetric when the only way both directions can hold is if the elements are the same. Those two are not opposites, which is the point students most often miss: a relation can be both, and a relation can be neither. It is transitive when a chain of two forces the direct link, and transitivity is the property that fails most often in practice, so check it with an actual example rather than by feel.
From those four, two structures follow. Reflexive, symmetric and transitive together give an equivalence relation, which slices a set into disjoint classes. Reflexive, antisymmetric and transitive together give a partial order, which arranges elements in a hierarchy where some pairs are simply not comparable. Recognising which structure a described relation forms is a standard question type, and it becomes routine once the four checks are automatic.
A plan sized to one competency unit
Read your Course of Study first, since WGU keeps the competency list and assessment detail there rather than in the public catalog. Where a performance assessment exists, each scored aspect is judged on its own three-point scale and a score of 2 in each passes the task. Where the instrument is a proctored objective assessment, the preassessment tells you what to study.
A worked plan with numbers. Four blocks fit one competency unit: set operations and identities, functions with their injective and surjective properties, sequences and series, and relations with their properties. At sixteen to twenty hours, that is four to five hours per block. Inside each, take one hour for definitions, two and a half for problems, and half an hour for building examples of your own. Constructing a relation that is symmetric but not transitive teaches the definitions in a way that checking someone else's example never does.
Where a written task exists, the budget is tight in proportion. Four scored aspects across a 900-word submission is roughly 200 words each after an opening and a close. In this material precision beats length: a property check written as four labelled sentences scores better than a paragraph of discussion.
How to lay out work on sets and relations
Where directions set a format, follow it. Otherwise this order makes the work checkable.
| Step | What to write | Where marks are lost |
|---|---|---|
| Universe and sets | The universal set and each set defined by listing or by condition | Leaving the universe implicit, which makes complements meaningless |
| Notation | Set-builder form for anything not small enough to list | Describing a set in words where a condition was required |
| Operation shown | The union, intersection, difference or product, with elements listed | Confusing the Cartesian product with the union of two sets |
| Property check | Each of the four relation properties as its own labelled line | Answering all four in one sentence, which hides the one that fails |
| Counterexample | Where a property fails, the specific pair that breaks it | Asserting failure without producing the witness |
| Classification | Equivalence relation, partial order or neither, with the reason | Naming the structure without listing which properties supported it |
| Function properties | Injective, surjective, both or neither, each justified | Checking one direction and inferring the other |
The counterexample row is worth building as a habit. Saying that a relation is not transitive proves nothing. Producing the three elements where the chain holds and the direct link does not is a complete argument in one line, and it is the sort of precision the module is built to develop.
Working habits for sets, sequences and series
- Draw relations as directed graphs. Reflexive shows as a loop at every node, symmetric as arrows both ways, transitive as every two-step path having a shortcut. The properties become visual rather than verbal.
- Verify set identities on small sets before trusting them. Three-element sets are enough to catch almost every misremembered law.
- Write sequences out to five terms before finding the general formula. The pattern usually appears and the formula becomes a description rather than a guess.
- For series, know which ones have closed forms and derive rather than memorise them. Arithmetic and geometric sums both come from short arguments worth doing once.
- Check injective and surjective separately and in the right direction. Injective is about inputs not colliding; surjective is about the codomain being covered.
- Keep every counterexample you build. A file of small examples where a property fails is the fastest revision resource for this module.
What Competent looks like in D421
WGU records outcomes as Competent or Not Competent, with no letter grades and no ordinary grade point average. Performance assessment work can be revised and resubmitted with no penalty for the earlier version, and proctored objective assessments are yours alone to sit.
Work that passes cleanly in this module tends to show:
- Sets defined precisely, with the universe stated where complements appear.
- Each relation property checked on its own line, with a verdict.
- Counterexamples produced by name wherever a property fails.
- Function properties justified in both directions rather than inferred.
- Sequences and series answers accompanied by the reasoning that produced the closed form.
Where the module is assessed by a proctored objective assessment, the boundary holds. We prepare with property-check drills, counterexample construction practice, worked examples and timed sets, and we give an honest readiness read. We do not sit or assist during any assessment and we never ask for portal credentials.
Five mistakes that cost time in D421
- Treating symmetric and antisymmetric as opposites. They are independent properties, and a relation can satisfy both, one, or neither.
- Checking reflexivity on some elements. The definition quantifies over every element in the set, and one exception breaks it.
- Confusing subset with element. A set can contain another set as a member, and mixing the two relationships produces answers that cannot be repaired.
- Assuming a function is surjective because it looks like it covers everything. Surjectivity depends on the stated codomain, which the problem chose deliberately.
- Studying by reading definitions. The assessed skill is applying them to specific relations, which only happens with a pencil.
How support works on this course
Send your competency list, any preassessment result and any task directions from your Course of Study. What comes back is sized to a one-CU module: a property-check routine you can run on any relation, a bank of small counterexamples worth memorising, worked set identity problems and function classification drills, and where a written task exists, a model submission with each aspect answered under its own labelled line.
WGU terms run six months at a flat rate, so closing more courses inside a term is what lowers your effective cost per course. The three discrete modules are unusually well suited to that arithmetic, because each one can be finished and recorded on its own rather than waiting on the whole four-CU block.
Questions students ask about D421
Is D421 the same as MATH 2830?
How does D421 relate to C959?
Should I take the three modules in order?
Relations, properties and counterexamples due?
Send your competency list. You get a property-check routine, a bank of small counterexamples, and worked classification drills sized to one competency unit.
Where D421 sits in WGU's programs
The July 2026 catalog places this code in 2 current WGU programs. Open a program page for the complete standard path and term positions. The live Degree Plan remains authoritative after transfer credit, substitutions, and mentor planning.
The assessments, one by one
The public catalog does not publish this course's PA/OA identity or task count. WGU Tutors publishes at most one PA manual per course and only from a WGU-controlled public rubric. Until that source exists, PA help begins from the student's real Course of Study and OA support remains preparation only.