# Questions tagged [induction]

The tag has no usage guidance.

56 questions
Filter by
Sorted by
Tagged with
1 vote
181 views

### Prove that every group $G$ with $p^n$ ($n\ge4$) elements and center with $p$ elements has an abelian subgroup of order $p^3$ [closed]

Prove that every group $G$ with $p^n$ ($n\ge4$) elements and center with $p$ elements has an abelian subgroup of order $p^3$ I'm new in this forum so I hope I haven't made any mistake. I have to ...
417 views

• 300
124 views

### Nicely motivated papers or book chapters on the formula for the sum of the $k$-th powers of the first natural numbers [closed]

Do you know of a text where I can find a nicely motivated proof of the formula for $1^{k}+2^{k}+\cdots+n^{k}$? At the very beginning of page 68 of Professor H. S. Wilf's generatingfunctionology, one ...
2k views

### How to structure a proof by induction in a maths research paper?

I am 16 years old at the time of writing (so I have no supervisors to seek advice from) and I have written a mathematics research paper, which I plan on submitting to a journal for publication. I ...
58 views

### Seek help to formalize an argument to positiveness of function defined inductively by integral [closed]

I have on domain $[0,\infty)$ a known and positive function $f(x)$ and two unknown functions $g(x), h(x)$ that start positive when $x=0$. I also know that if $h(x)$ is positive, then $g(x)$ is also ...
• 123
117 views

### Can you define inductive data types over categories other than Set?

Can you define inductive data types over categories other than $\mathbb{Set}$? What does it look like? How about for a specific example like the category of monoids? If you were clever could you write ...
409 views

### Is the Frog game solvable in the root of a full binary tree?

This is a cross-post from math.stackexchange.com$^{[1]}$, since the bounty there didn't lead to any new insights. For reference, The Frog game is the generalization of the Frog Jumping (see it on ...
• 611
1 vote
370 views

### Generalizations of classical tiling problem

A classic problem using an inductive construction is to show that the $2^n \times 2^n$-square, with a missing corner, can be tiled with L-triominoes. The proof goes like this: It is true for $n=1$, ...
• 15.7k
170 views

### Limit of alternated row and column normalizations

Let $E_0$ be a matrix with non-negative entries. Given $E_n$, we apply the following two operations in sequence to produce $E_{n+1}$. A. Divide every entry by the sum of all entries in its column (...
• 163
163 views

### Models of arithmetical theory R + induction in which successor is not injective

Consider the arithmetical theory sometimes denoted by $\mathsf{R}$. The non-logical vocabulary of $\mathsf{R}$ consists of '$0$', '$S$', '$+$' and '$\times$'. The axioms of this theory are all true ...
1 vote
178 views

• 9,047
1 vote
149 views

### Proving the existence of a sequence with recursive growth constraints

Fix $0 < c < 1/3$. Show that there exists a strictly increasing sequence $a_k > 0$, a sequence $b_k \geq 0$, and an infinite set $K \subseteq \mathbb{Z}_{>0}$ such that \begin{align}\...
701 views

### Mathematical induction vis-a-vis primes

One of the most used proof-techniques is mathematical induction, and one of the oldest subjects is the study of prime numbers. Thanks to Euclid, we can consider the primes as a infinite monotone ...
593 views

### Inductive Definitions in Category Theory

I'm trying to pin down a notion of inductive definability in category-theoretic terms. The sorts of inductively defined sets (and classes) I'm most interested in are those that admit of induction and ...
• 63
544 views

### When must one strengthen one's induction hypothesis?

My questions are about the phenomenon that in order to prove a fact $\forall x \phi(x)$ by induction, sometimes straightforward induction "does not work" and instead one "must" use a "stronger" ...
3k views

### Is Cauchy induction used for proofs other than for AM–GM?

The proof by Cauchy induction of the arithmetic/geometric-mean inequality is well known. I am looking for a further theorem whose proof is much neater by this method than otherwise.
• 2,437
346 views

### Affine analog of the theory of sheets

In the study of adjoint orbits in a complex semi-simple lie algebra, there is a well known object known as a "sheet". These are the irreducible components of the union of orbits of the same dimension. ...
• 1,063
I'm reading the paper Wellfounded trees in categories by Moerdijk and Palmgren. I'm having trouble understanding the proof of Theorem 7.2 (page 216), i.e. that in $\mathbf{ML}_{< \omega} \mathbf{W}$...