Math 2.0

Lemma

Fodor's lemma for trees

Statement

For every non-special tree TT and regressive mapping f:T→Tf:T\rightarrow T (that is, f(t)<tf(t)<t, with respect to the order on TT, for every t∈Tt\in T, t≠0t\neq 0), there is a non-special subtree S⊆TS\subseteq T on which ff is constant.

Further reading

  1. Wikipedia, page 1679022, revision 1350068977, Fodor's lemma. adopted
About this page
TagH671WT55SK
URIm2://H671WT55SK
Kindstatement, lemma
WritingW0 stub
StatusThis copy of the site has no build data. Run m2 status H671WT55SK.
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • edge uses out: each definition that the statement needs (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.