Choose the -axis along the line of intersection of the two planes. Their unit normals lie in the -plane; after choosing the -axis, take
where is the oriented angle between the planes. The two reflection matrices restrict to
on the -plane and both fix the -axis. Their product is
Thus the composition of two plane reflections is a rotation about the intersection line through angle .
Writing as a column vector, the reflection is
so its reflection matrix is
Each entry of is, up to sign, the determinant of an minor whose entries are affine polynomials in . The Leibniz formula for determinants therefore makes each adjugate entry a polynomial in of degree at most .
For arbitrary , choose positive sequences for which and are nonsingular. The nonsingular identity from part (b) applies to their product:
Every entry is a polynomial, hence continuous, in the matrix entries. Letting proves
for all square matrices.
The determinant is a polynomial in with leading term , so it is not the zero polynomial and has only finitely many roots. Hence one may choose smaller than every positive root, if any. Then
Apply the root test to the terms :
This tends to zero when and to infinity when . On , the series converges absolutely because converges: the point lies strictly inside the original radius two. Thus the lacunary power series has radius
and in fact converges on its entire boundary circle.
The series can be written as
The original power series converges when and diverges when . Hence its radius as a power series in is
Let . The Cauchy-Hadamard theorem, proved by applying the root test, gives a radius of convergence
with the usual conventions. For , choose eventually bounding , which gives absolute convergence by comparison with a geometric series. For , infinitely many terms have th root greater than one, so the terms fail to tend to zero and the series diverges.
Here and the assumed limit gives . Therefore
Thus

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