Boxes init
This commit is contained in:
parent
a2ab62c1db
commit
4701aa7bce
76
LinAlg2.tex
76
LinAlg2.tex
|
@ -5,7 +5,6 @@
|
|||
\usepackage{amsmath}
|
||||
\usepackage{amsfonts}
|
||||
\usepackage{enumitem}
|
||||
\usepackage{amsthm}
|
||||
\usepackage{amssymb}
|
||||
\usepackage{marvosym}
|
||||
\usepackage{mathtools}
|
||||
|
@ -15,6 +14,9 @@
|
|||
\usepackage{harpoon}
|
||||
\usetikzlibrary{tikzmark,calc,arrows,angles,math,decorations.markings}
|
||||
\usepackage{pgfplots}
|
||||
\usepackage{framed}
|
||||
\usepackage[hyperref,amsmath,amsthm,thmmarks,thref,framed]{ntheorem}
|
||||
\usepackage{tcolorbox}
|
||||
|
||||
\pgfplotsset{compat=1.17}
|
||||
|
||||
|
@ -22,16 +24,6 @@
|
|||
\date{Sommersemester 2022}
|
||||
\author{Philipp Grohs \\ \small \LaTeX-Satz: Anton Mosich}
|
||||
|
||||
\newtheoremstyle{theostyle}%
|
||||
{3pt}%
|
||||
{3pt}%
|
||||
{}%
|
||||
{}%
|
||||
{\bfseries}%
|
||||
{:}%
|
||||
{\newline}%
|
||||
{}%
|
||||
|
||||
\newcounter{textbox}
|
||||
\def\tl{\stepcounter{textbox}\tikzmarknode{a\thetextbox}{\strut}}
|
||||
\def\br{\tikzmarknode{b\thetextbox}{\strut}\begin{tikzpicture}[overlay, remember picture]
|
||||
|
@ -45,15 +37,22 @@
|
|||
\newcommand\K{\ensuremath{\mathbb{K}}}
|
||||
\newcommand\mapsfrom{\rotatebox{180}{$\mapsto$}}
|
||||
|
||||
\theoremstyle{theostyle}
|
||||
\newtheorem{theo}{Theorem}[section]
|
||||
\theoremstyle{break}
|
||||
\theoremseparator{.\smallskip}
|
||||
\theoremindent=1em
|
||||
\theoremheaderfont{\kern-1em\normalfont\bfseries}
|
||||
\theoreminframepreskip{0em}
|
||||
\theoreminframepostskip{0em}
|
||||
\newtcbox{theoremBox}{colback=NavyBlue!17,colframe=NavyBlue!87,boxsep=0pt,left=7pt,right=7pt,top=7pt,bottom=7pt}
|
||||
\def\theoremframecommand{\theoremBox}
|
||||
|
||||
\newtheorem{lemma}[theo]{Lemma}
|
||||
\newtheorem{defin}[theo]{Definition}
|
||||
\newtheorem{satz}[theo]{Satz}
|
||||
\newtheorem*{satz*}{Satz}
|
||||
\newtheorem{korollar}[theo]{Korollar}
|
||||
\newtheorem{folgerung}[theo]{Folgerung}
|
||||
\newshadedtheorem{theo}{Theorem}[section]
|
||||
|
||||
\newshadedtheorem{lemma}[theo]{Lemma}
|
||||
\newshadedtheorem{defin}[theo]{Definition}
|
||||
\newshadedtheorem{satz}[theo]{Satz}
|
||||
\newshadedtheorem{korollar}[theo]{Korollar}
|
||||
\newshadedtheorem{folgerung}[theo]{Folgerung}
|
||||
|
||||
\DeclareMathOperator{\sgn}{sgn}
|
||||
\DeclareMathOperator{\rg}{rg}
|
||||
|
@ -149,26 +148,26 @@ postaction={decorate}},
|
|||
|
||||
\begin{satz} \label{theo:1.1.3}
|
||||
Es gilt $\lvert S_n \rvert = n!$.
|
||||
\begin{proof}
|
||||
Vollständige Induktion
|
||||
\begin{itemize}
|
||||
\item $n=1: S_1 = \{\id\}\implies\lvert S_1\rvert = 1 = 1!$
|
||||
\item $n-1\to n:$\\ Angenommen $\lvert S_{n-1} \rvert = (n-1)!$.
|
||||
Dann gilt $\lvert\{\pi \in S_n: \pi(n) = n \}\rvert = (n-1)!$. Sei allgemein $i \in [n]$.
|
||||
Dann gilt $\pi(n)=i \iff (in)\circ\pi(n)=n$. Also gilt
|
||||
\begin{align*}
|
||||
& \lvert\{\pi\in S_n: \pi(n)=i\}\rvert = \lvert\{(in)\circ\pi: \pi(n)=n\}\rvert \\
|
||||
& = \lvert\{\pi: \pi(n)=n\}\rvert = (n-1)!
|
||||
\end{align*}
|
||||
Weiters gilt
|
||||
\begin{align*}
|
||||
& S_n = \bigcup_{i\in[n]}^\bullet\{\pi\in S_n: \pi(n)=i\} \implies \\
|
||||
& \lvert S_n\rvert = \sum_{i\in[n]}\lvert\{\pi \in S_n: \pi(n) = i\}\rvert
|
||||
= n\cdot(n-1)! = n!
|
||||
\end{align*}
|
||||
\end{itemize}
|
||||
\end{proof}
|
||||
\end{satz}
|
||||
\begin{proof}
|
||||
Vollständige Induktion
|
||||
\begin{itemize}
|
||||
\item $n=1: S_1 = \{\id\}\implies\lvert S_1\rvert = 1 = 1!$
|
||||
\item $n-1\to n:$\\ Angenommen $\lvert S_{n-1} \rvert = (n-1)!$.
|
||||
Dann gilt $\lvert\{\pi \in S_n: \pi(n) = n \}\rvert = (n-1)!$. Sei allgemein $i \in [n]$.
|
||||
Dann gilt $\pi(n)=i \iff (in)\circ\pi(n)=n$. Also gilt
|
||||
\begin{align*}
|
||||
& \lvert\{\pi\in S_n: \pi(n)=i\}\rvert = \lvert\{(in)\circ\pi: \pi(n)=n\}\rvert \\
|
||||
& = \lvert\{\pi: \pi(n)=n\}\rvert = (n-1)!
|
||||
\end{align*}
|
||||
Weiters gilt
|
||||
\begin{align*}
|
||||
& S_n = \bigcup_{i\in[n]}^\bullet\{\pi\in S_n: \pi(n)=i\} \implies \\
|
||||
& \lvert S_n\rvert = \sum_{i\in[n]}\lvert\{\pi \in S_n: \pi(n) = i\}\rvert
|
||||
= n\cdot(n-1)! = n!
|
||||
\end{align*}
|
||||
\end{itemize}
|
||||
\end{proof}
|
||||
|
||||
\begin{satz} \label{theo:1.1.4}
|
||||
Für $n\in \mathbb{N}_{\ge2}$ ist jedes $\pi \in S_n$ das Produkt von (endlich vielen) Transpositionen.
|
||||
|
@ -184,6 +183,7 @@ postaction={decorate}},
|
|||
\end{itemize}
|
||||
\end{proof}
|
||||
\end{satz}
|
||||
|
||||
\subsubsection{Bemerkung}
|
||||
\begin{itemize}
|
||||
\item Produktdarstellung ist nicht eindeutig, zum Beispiel:\\ $(3 1 2) = (2 1)(3 1) = (3 1)(3 2)$
|
||||
|
|
Loading…
Reference in New Issue