Theorem: Kummer's Quadratic Transformation

:$\ds \map F {a, b; 1 + a - b; z} = \paren {1 - z}^{-a} \map F {\dfrac a 2, \dfrac {1 + a} 2 - b; 1 + a - b; \dfrac {-4 z} {\paren {1 - z}^2} }$

Proof:
On the {{RHS}}, our $z$ variable transforms to $\dfrac {-4 z} {\paren {1 - z}^2}$, therefore:
{{begin-eqn}}
{{eqn | l = \size {\dfrac {-4 z} {\paren {1 - z}^2} }
      | o = <
      | r = 1
      | c = 
}}
{{eqn | ll= \leadsto
      | l = 4 z
      | o = <
      | r = \paren {1 - z}^2
      | c = 
}}
{{eqn | ll= \leadsto
      | l = 0
      | o = <
      | r = 1 - 6 z + z^2
      | c = 
}}
{{end-eqn}}
By the Quadratic Formula, either $z > 3 + 2 \sqrt 2$ or $z < 3 - 2 \sqrt 2$.
Because $\size z < 1$, we have:
:$\size z < 3 - 2 \sqrt 2$
This means our sum is analytic and can be expanded in powers in $z$ for $\size z < 3 - 2 \sqrt 2$
From the definition of Gaussian hypergeometric function, the {{RHS}} can be written as:
{{begin-eqn}}
{{eqn | l = \paren {1 - z}^{-a} \map F {\dfrac a 2, \dfrac {1 + a} 2 - b; 1 + a - b; \dfrac {-4 z} {\paren {1 - z}^2} }
      | r = \sum_{k \mathop = 0}^\infty \dfrac { \paren {\dfrac a 2}^{\overline k} \paren {\dfrac {1 + a} 2 - b}^{\overline k} } {k! \paren {1 + a - b}^{\overline k} } \paren {-4 z}^k \paren {1 - z}^{-a - 2 k}
      | c = 
}}
{{eqn | r = \sum_{k \mathop = 0}^\infty \dfrac {\paren {-4}^k \paren {\dfrac a 2}^{\overline k} \paren {\dfrac {1 + a} 2 - b}^{\overline k} } {k! \paren {1 + a - b}^{\overline k} } \sum_{n \mathop = 0}^\infty \dbinom {-a - 2 k} n \paren {-z}^{n + k}
      | c = Binomial Theorem
}}
{{eqn | r = \sum_{k \mathop = 0}^\infty \dfrac {\paren {-4}^k \paren {\dfrac a 2}^{\overline k} \paren {\dfrac {1 + a} 2 - b}^{\overline k} } {k! \paren {1 + a - b}^{\overline k} } \sum_{n \mathop = 0}^\infty \paren {\dbinom {a + 2 k + n - 1} n \paren {-1}^n} \paren {\paren {-1}^n z^{n + k} }
      | c = Negated Upper Index of Binomial Coefficient
}}
{{eqn | r = \sum_{k \mathop = 0}^\infty \dfrac {\paren {-4}^k \paren {\dfrac a 2}^{\overline k} \paren {\dfrac {1 + a} 2 - b}^{\overline k} } {k! \paren {1 + a - b}^{\overline k} } \sum_{n \mathop = 0}^\infty \dfrac {\paren {a + 2 k + n - 1}!} {n! \paren {a + 2 k - 1}!} z^{n + k}
      | c = {{Defof|Binomial Coefficient}} and $\paren {-1}^n \times \paren {-1}^n = 1$
}}
{{eqn | r = \sum_{k \mathop = 0}^\infty \dfrac {\paren {-4}^k \paren {\dfrac a 2}^{\overline k} \paren {\dfrac {1 + a} 2 - b}^{\overline k} } {k! \paren {1 + a - b}^{\overline k} } \sum_{n \mathop = 0}^\infty \dfrac {\paren {a + 2 k}^{\overline n} } {n!} z^{n + k}
      | c = {{Defof|Rising Factorial}}
}}
{{end-eqn}}
The coefficient of $z^n$ on the {{RHS}} is:
{{begin-eqn}}
{{eqn | r = \sum_{k \mathop = 0}^n \paren {\dfrac a 2}^{\overline k} \dfrac {\paren {-4}^k \paren {\dfrac {1 + a} 2 - b}^{\overline k} } {k! \paren {1 + a - b}^{\overline k} } \dfrac {\paren {a + 2 k}^{\overline {n - k} } } {\paren {n - k}!}
      | c = 
}}
{{eqn | r = \sum_{k \mathop = 0}^n \dfrac {\map \Gamma {\dfrac a 2 + k} } {\map \Gamma {\dfrac a 2} } \dfrac {\paren {-1}^k 2^{2 k} \paren {\dfrac {1 + a} 2 - b}^{\overline k} } {k! \paren {1 + a - b}^{\overline k} } \dfrac {\map \Gamma {a + 2 k + n - k} } {\map \Gamma {a + 2 k} \paren {n - k}!}
      | c = Rising Factorial as Quotient of Factorials
}}
{{eqn | r = \sum_{k \mathop = 0}^n \dfrac {\dfrac {2^{1-\paren {a + 2 k} } \map \Gamma {\dfrac 1 2} \map \Gamma {a + 2 k} } {\map \Gamma {\dfrac {1 + a} 2 + k} } } {\dfrac {2^{1-a} \map \Gamma {\dfrac 1 2} \map \Gamma a} {\map \Gamma {\dfrac {1 + a} 2} } } \dfrac {\paren {-1}^k 2^{2 k} \paren {\dfrac {1 + a} 2 - b}^{\overline k} } {k! \paren {1 + a - b}^{\overline k} } \dfrac {\map \Gamma {a + k + n} } {\map \Gamma {a + 2 k} \paren {n - k}!}
      | c = Legendre's Duplication Formula
}}
{{eqn | r = \sum_{k \mathop = 0}^n \dfrac {\map \Gamma {\dfrac {1 + a} 2} } {\map \Gamma a \map \Gamma {\dfrac {1 + a} 2 + k} } \dfrac {\paren {-1}^k \paren {\dfrac {1 + a} 2 - b}^{\overline k} } {k! \paren {1 + a - b}^{\overline k} } \dfrac {\map \Gamma {a + k + n} } {\paren {n - k}!}
      | c = simplifying: $\dfrac {2^{1-\paren {a + 2 k} } 2^{2 k} } {2^{1-a} } = 1 $ and canceling $\map \Gamma {\dfrac 1 2}$ and $\map \Gamma {a + 2 k}$
}}
{{eqn | r = \sum_{k \mathop = 0}^n \dfrac {\paren {-1}^k \paren {\dfrac {1 + a} 2 - b}^{\overline k} } {\map \Gamma a k! \paren {1 + a - b}^{\overline k} \paren {\dfrac {1 + a} 2}^{\overline k} } \dfrac {\map \Gamma {a + k + n} } {\paren {n - k}!}
      | c = Rising Factorial as Quotient of Factorials
}}
{{eqn | r = \sum_{k \mathop = 0}^n \dfrac {\paren {-1}^k \paren {\dfrac {1 + a} 2 - b}^{\overline k} } {\map \Gamma a k! \paren {1 + a - b}^{\overline k} \paren {\dfrac {1 + a} 2}^{\overline k} } \dfrac {\map \Gamma {a + k + n} } {\paren {n - k}!} \times \dfrac {\map \Gamma {a + n} } {\map \Gamma {a + n} } \times \dfrac {n!} {n!}
      | c = multiplying by $1$
}}
{{eqn | r = \dfrac {a^{\overline n} } {n!} \sum_{k \mathop = 0}^n \dfrac {\paren {\dfrac {1 + a} 2 - b}^{\overline k} \paren {a + n}^{\overline k} } {\paren {1 + a - b}^{\overline k} \paren {\dfrac {1 + a} 2}^{\overline k} } \paren {-1}^k  n^{\underline k} \dfrac 1 {k!}
      | c = Rising Factorial as Quotient of Factorials and Falling Factorial as Quotient of Factorials
}}
{{eqn | r = \dfrac {a^{\overline n} } {n!} \sum_{k \mathop = 0}^n \dfrac {\paren {\dfrac {1 + a} 2 - b}^{\overline k} \paren {a + n}^{\overline k} \paren {-n}^{\overline k} } {\paren {1 + a - b}^{\overline k} \paren {\dfrac {1 + a} 2}^{\overline k} } \dfrac 1 {k!}
      | c = Rising Factorial in terms of Falling Factorial of Negative
}}
{{eqn | r = \dfrac {a^{\overline n} } {n!} \map { {}_3 \operatorname F_2} { { {\paren {\dfrac {1 + a} 2 - b}, \paren {a + n}, -n} \atop {\paren {1 + a - b}, \dfrac {1 + a} 2} } \, \middle \vert \, 1}
      | c = {{Defof|Hypergeometric Function}}
}}
{{eqn | r = \dfrac {a^{\overline n} } {n!} \dfrac {\paren {\paren {1 + a - b} - \paren {\dfrac {1 + a} 2 - b} }^{\overline n} \paren {\paren {1 + a - b} - \paren {a + n} }^{\overline n} } { \paren {1 + a - b}^{\overline n} \paren {\paren {1 + a - b} - \paren {\dfrac {1 + a} 2 - b} - \paren {a + n} }^{\overline n} }
      | c = Pfaff-Saalschütz Theorem
}}
{{eqn | r = \dfrac {a^{\overline n} } {n!} \dfrac {\paren {\dfrac {1 + a} 2}^{\overline n} \paren {1 - b - n}^{\overline n} } { \paren {1 + a - b}^{\overline n}\paren {\dfrac {1 - a} 2 - n}^{\overline n} }
      | c = simplifying
}}
{{eqn | r = \dfrac {a^{\overline n} } {\paren {1 + a - b }^{\overline n} n!} \dfrac {\map \Gamma {\dfrac {1 + a} 2 + n} \map \Gamma {1 - \paren {\dfrac {1 + a} 2 + n} } } {\map \Gamma {\dfrac {1 + a} 2} \map \Gamma {1 - \paren {\dfrac {1 + a} 2} } } \dfrac {\map \Gamma {1 - b} } {\map \Gamma {1 - b - n} }
      | c = Rising Factorial as Quotient of Factorials 
}}
{{eqn | r = \dfrac {a^{\overline n} } {\paren {1 + a - b }^{\overline n} n!} \dfrac {\map \Gamma {\dfrac {1 + a} 2 + n} \map \Gamma {1 - \paren {\dfrac {1 + a} 2 + n} } } {\map \Gamma {\dfrac {1 + a} 2} \map \Gamma {1 - \paren {\dfrac {1 + a} 2} } } \paren {-b}^{\underline n}
      | c = Falling Factorial as Quotient of Factorials
}}
{{eqn | r = \dfrac {a^{\overline n} b^{\overline n} } {\paren {1 + a - b }^{\overline n} n!} \dfrac {\map \Gamma {\dfrac {1 + a} 2 + n} \map \Gamma {1 - \paren {\dfrac {1 + a} 2 + n} } } {\map \Gamma {\dfrac {1 + a} 2} \map \Gamma {1 - \paren {\dfrac {1 + a} 2} } } \paren {-1}^n
      | c = Rising Factorial in terms of Falling Factorial of Negative
}}
{{eqn | r = \dfrac {a^{\overline n} b^{\overline n} } {\paren {1 + a - b }^{\overline n} n!} \dfrac \pi {\map \sin {\pi \paren {\dfrac {1 + a} 2 + n} } } \dfrac {\map \sin {\pi \paren {\dfrac {1 + a} 2} } } \pi \paren {-1}^n
      | c = Euler's Reflection Formula
}}
{{eqn | r = \dfrac {a^{\overline n} b^{\overline n} } {\paren {1 + a - b }^{\overline n} n!} \dfrac {\map \sin {\pi \paren {\dfrac {1 + a} 2} } } {\map \sin {\pi \paren {\dfrac {1 + a} 2} } \map \cos {\pi n} + \map \cos {\pi \paren {\dfrac {1 + a} 2} } \map \sin {\pi n} } \paren {-1}^n
      | c = Sine of Sum
}}
{{eqn | r = \dfrac {a^{\overline n} b^{\overline n} } {\paren {1 + a - b }^{\overline n} n!} \dfrac 1 {\map \cos {\pi n} } \paren {-1}^n
      | c = Sine of Multiple of Pi
}}
{{eqn | r = \dfrac {a^{\overline n} b^{\overline n} } {\paren {1 + a - b }^{\overline n} n!} \paren {-1}^{-n} \paren {-1}^n
      | c = Cosine of Multiple of Pi
}}
{{eqn | r = \dfrac {a^{\overline n} b^{\overline n} } {\paren {1 + a - b }^{\overline n} n!} 
      | c = 
}}
{{end-eqn}}
We now observe that the coefficients of $z^n$ on the {{RHS}} are identical to the coefficients of $z^n$ on the {{LHS}}.
Therefore:
:$\ds \map F {a, b; 1 + a - b; z} = \paren {1 - z}^{-a} \map F {\dfrac a 2, \dfrac {1 + a} 2 - b; 1 + a - b; \dfrac {-4 z} {\paren {1 - z}^2} }$
{{qed}}