Search arXivSearch

arXiv · 2402.04604

Symmetric bilinear Forms and Galois Theory

Abstract

Let $ K$ be a field admitting a Galois extension $L$ of degree $n$, denoting the Galois group as $G = \gal(L/K)$. Our focus lies on the space $\sym_K(L)$ of symmetric $K$-bilinear forms on $L$. We establish a decomposition of $\sym_K(L)$ into direct sum of $K$-subspaces $A^{σ_i}$, where $σ_i \in G$. Notably, these subspaces $ A^{σ_i}$ exhibit nice constant rank properties. The central contribution of this paper is a decomposition theorem for $\sym_K(L)$, revealing a direct sum of $\frac{(n+1)}{2}$ constant rank $n$-subspaces, each having dimension of $n$. This holds particularly when $G$ is cyclic, represented as $G = \gal(L/K) = \langleσ\rangle$. For cyclic extensions of even degree $n = 2m$, we present slightly less precise but analogous results. In this scenario, we enhance and enrich these constant results and show that, the component $ A^σ$ often decomposes directly into a constant rank subspaces. Remarkably, this decomposition is universally valid when $-1 \notin L^{2}$. Consequently, we derive a decomposition of $\sym_K(L)$ into subspaces of constant rank under several situations. Moreover, leveraging these decompositions, we investigate the maximum dimension of an $n$-subspace inside $M(n,K)$ and $S(n,K)$ for various field $K$ where $M(n,K)$ and $ S(n,K)$ denote the vector spaces $(n \times n)$ matrices and symmetric matrices over $K$, respectively.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sugata Mandal. 2024-02-07. Symmetric bilinear Forms and Galois Theory. https://arxiv.org/abs/2402.04604

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT