text: # well-founded induction
  
  Let $S$ be a non-empty set, and $R$ be a binary relation on $S$. Then $R$ is said to be a well-founded relation if and only if every nonempty subset $X\subseteq S$ has an $R$-minimal element (http://planetmath.org/RMinimalElement). When $R$ is well-founded, we also call the underlying set $S$ well-founded.
  
  Note that $R$ is by no means required to be a total order, or even a partial order. When $R$ is a partial order, then $R$-minimality is the same as minimality (of the partial order). A classical example of a well-founded set that is not totally ordered is the set $\mathbb{N}$ of natural numbers ordered by division, i.e. $aRb$ if and only if $a$ divides $b$, and $a\not=1$. The $R$-minimal elements of $\mathbb{N}$ are the prime numbers.
  
  Let $\Phi$ be a property defined on a well-founded set $S$. The principle of well-founded induction states that if the following is true :
  
  1. 1.
  
  $\Phi$ is true for all the $R$-minimal elements of $S$
  
  2. 2.
  
  for every $a$, if for every $x$ such that $xRa$, we have $\Phi(x)$, then we have $\Phi(a)$
  
  then $\Phi$ is true for every $a\in S$.
  
  As an example of application of this principle, we mention the proof of the fundamental theorem of arithmetic : every natural number has a unique factorization into prime numbers. The proof goes by well-founded induction in the set $\mathbb{N}$ ordered by division.
  
  Title well-founded induction WellfoundedInduction 2013-03-22 12:42:17 2013-03-22 12:42:17 ratboy (4018) ratboy (4018) 22 ratboy (4018) Theorem msc 03B10 PrincipleOfFiniteInduction
explanation: The text extract provides a detailed explanation of the concept of well-founded induction, including definitions, conditions, and an example application. It does not contain a specific question or a question-and-answer pair.
distilabel_metadata.content: Evaluate the user given text extract and determine if it contains a math question and optionally and answer to this question.
  
  Output rules:
  
  1. Briefly describe the document and mention if it contains a question or a question and answer.
  2. Finalize the output with: Label: no-question,question,question-and-answer,multiple-question,multiple-question-and-answer
distilabel_metadata.role: system
distilabel_metadata.content: # well-founded induction
  
  Let $S$ be a non-empty set, and $R$ be a binary relation on $S$. Then $R$ is said to be a well-founded relation if and only if every nonempty subset $X\subseteq S$ has an $R$-minimal element (http://planetmath.org/RMinimalElement). When $R$ is well-founded, we also call the underlying set $S$ well-founded.
  
  Note that $R$ is by no means required to be a total order, or even a partial order. When $R$ is a partial order, then $R$-minimality is the same as minimality (of the partial order). A classical example of a well-founded set that is not totally ordered is the set $\mathbb{N}$ of natural numbers ordered by division, i.e. $aRb$ if and only if $a$ divides $b$, and $a\not=1$. The $R$-minimal elements of $\mathbb{N}$ are the prime numbers.
  
  Let $\Phi$ be a property defined on a well-founded set $S$. The principle of well-founded induction states that if the following is true :
  
  1. 1.
  
  $\Phi$ is true for all the $R$-minimal elements of $S$
  
  2. 2.
  
  for every $a$, if for every $x$ such that $xRa$, we have $\Phi(x)$, then we have $\Phi(a)$
  
  then $\Phi$ is true for every $a\in S$.
  
  As an example of application of this principle, we mention the proof of the fundamental theorem of arithmetic : every natural number has a unique factorization into prime numbers. The proof goes by well-founded induction in the set $\mathbb{N}$ ordered by division.
  
  Title well-founded induction WellfoundedInduction 2013-03-22 12:42:17 2013-03-22 12:42:17 ratboy (4018) ratboy (4018) 22 ratboy (4018) Theorem msc 03B10 PrincipleOfFiniteInduction
distilabel_metadata.role: user
distilabel_metadata.raw_output_q_a_detector_0: The text extract provides a detailed explanation of the concept of well-founded induction, including definitions, conditions, and an example application. It does not contain a specific question or a question-and-answer pair.
  
  Label: no-question