PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
sections
Encyclopædia
Papers
Books
Expositions

meta
Requests (194)
Orphanage
Unclass'd
Unproven (498)
Corrections (23)
Classification

talkback
Polls
Forums
Feedback
Bug Reports

downloads
Snapshots
PM Book

information
News
Docs
Wiki
ChangeLog
TODO List
Legalese
About
Owner confidence rating: Very high Entry average rating: No information on entry rating
circular reasoning (Definition)

Circular reasoning is an attempted proof of a statement that uses at least one of the following two things:

  • the statement that is to be proven
  • a fact that relies on the statement that is to be proven

Such proofs are not valid.

As an example, below is a faulty proof that the well-ordering principle implies the axiom of choice. The step where circular reasoning is used is surrounded by brackets [ ].

Let $ C$ be a collection of nonempty sets. By the well-ordering principle, each $ S \in C$ is well-ordered. [For each $ S \in C$, let $ <_S$ denote the well-ordering of $ S$.] Let $ m_S$ denote the least member of each $ S \in C$ with respect to $ <_S$. Then a choice function $ \displaystyle f \colon C \to \bigcup_{S \in C} S$ can be defined by $ f(S)=m_S$.

The step surrounded by brackets is faulty because it actually uses the axiom of choice, which is what is to be proven. In the step, for each $ S \in C$, an ordering is chosen. This cannot be done in general without appealing to the axiom of choice.



"circular reasoning" is owned by Wkbj79.
(view preamble)

View style:

Other names:  circular argument
Log in to rate this entry.
(view current ratings)

Cross-references: ordering, axiom of choice, choice function, well-ordering, well-ordered, well-ordering principle, collection, proof
There are 4 references to this entry.

This is version 12 of circular reasoning, born on 2006-07-25, modified 2007-05-30.
Object id is 8174, canonical name is CircularReasoning.
Accessed 3322 times total.

Classification:
AMS MSC: 03F07 (Mathematical logic and foundations :: Proof theory and constructive mathematics :: Structure of proofs)
Pending Errata and Addenda
None.
[ View all 3 ]
Discussion
Style: Expand: Order:
forum policy
Tautology by perucho on 2006-07-26 13:03:50
Known in Lat. as {\em petitio principii}. Tautologies use a circular reasoning within an argument or enunciate. For example, the entry ``circular reasoning'' by Wkbj79 expresses a logic tautology because we are using in the reasoning the self-evident $g*g^{-1}=e_G$.
perucho
[ reply | up ]
example by Wkbj79 on 2006-07-25 22:34:55
I thought it would be a good idea to put an example of circular reasoning in the article; however, I would greatly appreciate it if people have ``simpler'' examples. The one that I provide was the first one that I could come up with. I think it's pretty simple, but it may not be so to someone with little or no exposure to group theory. As always, feel free to attach examples to this entry if you would like, but, in this particular case, I highly encourage it. If someone attaches an example that I particularly like, I may remove the example that I provide from the entry.

Warren
[ reply | up ]
Interact
post | correct | update request | add derivation | add example | add (any)