## You are here

HomeWLOG

## Primary tabs

# WLOG

“WLOG” (or “WOLOG”) is an acronym which stands for “without loss of generality.”

WLOG is invoked in situations where some property of a model or system is invariant under the particular choice of instance attributes, but for the sake of demonstration, these attributes must be fixed.

For example, we might want to prove something about open intervals $(a,b)$ of the real number line. But the proof might become too tedious if $a$ and $b$ were arbitrary real numbers, so in the proof we simply assume that $a=0$ and $b=1$, and *without loss of generality*, the same arguments apply to general intervals $(a,b)$. Depending on the proof, the loss of generality might be accomplished by translating and scaling the interval to $(0,1)$ *before* carrying out the argument, and then translating and rescaling back to $(a,b)$
afterwards.

WLOG can also be invoked to shorten proofs where there are a number of choices of configuration, but the proof is “the same” for each of them. We need only walk through the proof for one of these configurations, and “WLOG” serves as a note that we haven’t weakened the argument. For example, the proof of the fundamental theorem of arithmetic uses this notion, in essence settling on a “canonical form” for prime factorizations to simplify the argument.

For more examples, see approximate index of PM entries invoking WLOG.

## Mathematics Subject Classification

00A99*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

new question: Prove a formula is part of the Gentzen System by LadyAnne

Mar 30

new question: A problem about Euler's totient function by mbhatia

new problem: Problem: Show that phi(a^n-1), (where phi is the Euler totient function), is divisible by n for any natural number n and any natural number a >1. by mbhatia

new problem: MSC browser just displays "No articles found. Up to ." by jaimeglz

Mar 26

new correction: Misspelled name by DavidSteinsaltz

Mar 21

new correction: underline-typo by Filipe

Mar 19

new correction: cocycle pro cocyle by pahio

Mar 7

new image: plot W(t) = P(waiting time <= t) (2nd attempt) by robert_dodier

new image: expected waiting time by robert_dodier

new image: plot W(t) = P(waiting time <= t) by robert_dodier