Set and . Since there is no explicit dependence, the Beltrami identity says is constant along a stationary curve. One can verify it directly:
by the Euler-Lagrange equation. Here , so
This identity applies on the open arch where . The constant is finite by evaluating at any interior point. Near an endpoint , hence everywhere on such an arch. Thus also throughout it.
Let be the gravitational acceleration, and let denote positive downward depth. For a frictionless particle released from rest, conservation of energy gives . The arc length element of is , so the travel time and length are
For a finite-time single arch, require in , , and interpret the endpoint integrals improperly. At a regular constrained minimizer with , the Lagrange multiplier rule for an isoperimetric constraint makes stationary. Dropping the constant gives
For the constraint is regular under interior variations: if its first variation vanished for every compactly supported variation, the Euler-Lagrange equation for would force constant, hence and , a contradiction. Thus the multiplier is justified for a nondegenerate arch.
The printed case is degenerate. Since , equality of the length with the horizontal separation forces and . A particle initially at rest then has no tangential gravitational acceleration and cannot complete the trip. Its travel time is infinite. The finite-time calculation therefore concerns , with endpoint regularity qualified below.
Fix . Since is open, choose an open ball . For any in this ball the segment remains in it. For each coordinate , the chain rule gives
The ordinary mean value theorem therefore gives for every coordinate, hence . Thus is a locally constant function.
For each , its preimage is a union of such open balls, so is open in . Its complement in is the union of the other fibers and is also open. If is nonempty and connected, the nonempty fiber through any chosen point is both open and closed in , and must be all of . Therefore
The empty-domain case is vacuous. Notice that continuity of was never needed.
Conjugate by a projective transformation sending to and to . A matrix representing the conjugated transformation must have zero diagonal, since its first column represents and its second represents . Therefore it has the form
Its square is , a nonzero scalar matrix, which induces the identity on the projective line. Conjugating back proves
For the requested explicit involution, take
More generally works whenever .
Take . The unit modulo has order , because
Let a generator of act on by . The action is well defined since its order divides . The semidirect product
has order . Its construction as a semidirect product ensures that retains order . Since , the groups generated by and do not commute, so is nonabelian.
Apply the Abelian group criterion for a product of two prime squares with the smaller and larger primes in their correct order. For , all such groups are Abelian exactly when . Of the primes , only qualifies. For , the criterion is , equivalently . Therefore the exact answer is
Equivalently, among the stipulated primes , exclude and the residue classes modulo .
For completeness, the necessity in that criterion supplies actual counterexamples at every excluded prime. If and , the multiplicative group of a finite field is cyclic, so choose of order . Let a generator of act on the additive group of by multiplication by . This defines a nontrivial group action, hence a nonabelian semidirect product of order . Use for , and for with . Thus no excluded prime can be restored to the answer.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact