<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "https://jats.nlm.nih.gov/publishing/1.3/JATS-journalpublishing1-3.dtd"><article xml:lang="en" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" dtd-version="1.3" article-type="research-article"><front><journal-meta><journal-id journal-id-type="issn">2460-0245</journal-id><journal-title-group><journal-title>Journal of the Indonesian Mathematical Society</journal-title><abbrev-journal-title>JIMS</abbrev-journal-title></journal-title-group><issn pub-type="epub">2460-0245</issn><issn pub-type="ppub">2086-8952</issn><publisher><publisher-name>IndoMS</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.22342/jims.v32i2.2053</article-id><article-categories></article-categories><title-group><article-title>Construction Of An n-Norm On \ell^p (R)</article-title></title-group><contrib-group><contrib contrib-type="author"><name><surname>Idris</surname><given-names>Mochammad</given-names></name><address><country country="ID">Indonesia</country><email>moch.idris@ulm.ac.id</email></address><xref ref-type="aff" rid="AFF-1"></xref><xref ref-type="corresp" rid="cor-0"></xref></contrib></contrib-group><contrib-group><contrib contrib-type="editor"><name><surname>Wijayanti</surname><given-names>Indah Emilia</given-names></name><address><country country="ID">Indonesia</country><email>ind_wijayanti@ugm.ac.id</email></address><xref ref-type="aff" rid="EDITOR-AFF-1"></xref></contrib></contrib-group><aff id="AFF-1"><institution content-type="dept">Department of Mathematics</institution><institution-wrap><institution>Lambung Mangkurat University</institution><institution-id institution-id-type="ror">https://ror.org/01khn0w07</institution-id></institution-wrap><country country="ID">Indonesia</country></aff><aff id="EDITOR-AFF-1"><institution-wrap><institution>Universitas Gadjah Mada</institution><institution-id institution-id-type="ror">https://ror.org/03ke6d638</institution-id></institution-wrap><country country="ID">Indonesia</country></aff><author-notes><corresp id="cor-0">Corresponding author: Mochammad Idris. Email: <email>moch.idris@ulm.ac.id</email></corresp></author-notes><pub-date date-type="pub" iso-8601-date="2026-04-23" publication-format="electronic"><day>23</day><month>04</month><year>2026</year></pub-date><pub-date date-type="collection" iso-8601-date="2026-04-23" publication-format="electronic"><day>23</day><month>04</month><year>2026</year></pub-date><volume>32</volume><issue>2</issue><issue-title>JUNE</issue-title><fpage>1</fpage><lpage>20</lpage><history><date date-type="received" iso-8601-date="2025-05-08"><day>08</day><month>05</month><year>2025</year></date><date date-type="accepted" iso-8601-date="2025-11-22"><day>22</day><month>11</month><year>2025</year></date></history><permissions><copyright-statement>Copyright (c) 2026 Journal of the Indonesian Mathematical Society</copyright-statement><copyright-year>2026</copyright-year><copyright-holder>Journal of the Indonesian Mathematical Society</copyright-holder><license license-type="open-access" xlink:href="https://creativecommons.org/licenses/by-nc-nd/4.0/"><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">https://creativecommons.org/licenses/by-nc-nd/4.0/</ali:license_ref><license-p>This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.</license-p></license></permissions><self-uri xlink:href="https://jims-a.org/index.php/jimsa/article/view/2053" xlink:title="2053"></self-uri><abstract><p>In this article, we discuss an <italic>n</italic>-norm, with <inline-formula><tex-math id="math-1"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle n \geq 2 \end{document} ]]></tex-math></inline-formula>, which is defined through bounded linear functionals on <italic>p</italic>-summable sequence spaces. We also introduce a new norm induced by this <italic>n</italic>-norm, which will be examined for its equivalence to the usual norm. Next, we demonstrate the relationships between various mappings, including the <italic>n</italic>-norm, <inline-formula><tex-math id="math-2"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (n-1) \end{document} ]]></tex-math></inline-formula>-norm, <inline-formula><tex-math id="math-3"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \cdots \end{document} ]]></tex-math></inline-formula> , 2-norm, and the usual norm. Finally, our results show that the <italic>p</italic>-summable sequence spaces, equipped with these mappings are complete spaces.</p></abstract><kwd-group><kwd>norm</kwd><kwd>n-norm</kwd><kwd>bounded linear functionals</kwd><kwd>$\ell^p$-spaces</kwd></kwd-group><custom-meta-group><custom-meta><meta-name>File created by JATS Editor</meta-name><meta-value>https://jatseditor.com</meta-value></custom-meta><custom-meta><meta-name>issue-created-year</meta-name><meta-value>2026</meta-value></custom-meta></custom-meta-group></article-meta></front><body><sec id="sec-1"><title>1. INTRODUCTION</title><p>Let <inline-formula><tex-math id="math-4"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> be a real vector space and <inline-formula><tex-math id="math-5"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| \cdot \| \end{document} ]]></tex-math></inline-formula> be a real function on <inline-formula><tex-math id="math-6"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> satisfying the following three conditions:</p><list list-type="order"><list-item><p><inline-formula><tex-math id="math-7"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| x\| \geq 0 \end{document} ]]></tex-math></inline-formula> for every <inline-formula><tex-math id="math-8"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x\in X \end{document} ]]></tex-math></inline-formula>; <inline-formula><tex-math id="math-9"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| x\| = 0 \end{document} ]]></tex-math></inline-formula> if and only if <inline-formula><tex-math id="math-10"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x = 0\in X \end{document} ]]></tex-math></inline-formula>;</p></list-item><list-item><p><inline-formula><tex-math id="math-11"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\alpha x\| = |\alpha|\|x\| \end{document} ]]></tex-math></inline-formula> for every <inline-formula><tex-math id="math-12"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in X \end{document} ]]></tex-math></inline-formula> and for every <inline-formula><tex-math id="math-13"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha \in \mathbb{R} \end{document} ]]></tex-math></inline-formula>;</p></list-item><list-item><p><inline-formula><tex-math id="math-14"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \lVert x+y\rVert \leq \lVert x\rVert+\lVert y\rVert \end{document} ]]></tex-math></inline-formula> for every <inline-formula><tex-math id="math-15"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x,y \in X \end{document} ]]></tex-math></inline-formula>.</p></list-item></list><p>The function <inline-formula><tex-math id="math-16"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot\| \end{document} ]]></tex-math></inline-formula> is called a norm on <inline-formula><tex-math id="math-17"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> and the pair <inline-formula><tex-math id="math-18"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (X,\|\cdot\|) \end{document} ]]></tex-math></inline-formula> is called a normed space <xref ref-type="bibr" rid="BIBR-1">[1]</xref>. A norm can be viewed as a generalization of the concept of length within a vector space.</p><p>A set of <italic>p</italic>-summable sequences, with <inline-formula><tex-math id="math-19"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 1 \leq p \leq \infty \end{document} ]]></tex-math></inline-formula>, is one of vector spaces in functional analysis. Here, the vector space is denoted by <inline-formula><tex-math id="math-20"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^{p} = \ell^{p}(\mathbb{R}) \end{document} ]]></tex-math></inline-formula> which contains all sequences of real numbers <inline-formula><tex-math id="math-21"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x = (x_{j}) \end{document} ]]></tex-math></inline-formula> for which <inline-formula><tex-math id="math-22"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \displaystyle\sum_{j=1}^{\infty}|x_{j}|^{p} < \infty \end{document} ]]></tex-math></inline-formula> (or <inline-formula><tex-math id="math-23"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \sup_{j \in \mathbb{N}} |x_j| < \infty \end{document} ]]></tex-math></inline-formula> while <inline-formula><tex-math id="math-24"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle p = \infty \end{document} ]]></tex-math></inline-formula>). Usually, <inline-formula><tex-math id="math-25"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^{p} \end{document} ]]></tex-math></inline-formula> is equipped with the usual norm</p><disp-formula id="equation-1"><tex-math id="math-26"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|x\|_{\ell^p} := \begin{cases}\left( \displaystyle\sum_{j=1}^{\infty} |x_j|^p \right)^{\frac{1}{p}} , & \text{if } 1 \le p < \infty \\[14pt]\displaystyle\sup_{j \in \mathbb{N}} |x_j| , & \text{if } p = \infty\end{cases} \tag{1} \end{document} ]]></tex-math></disp-formula><p>so that <inline-formula><tex-math id="math-27"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^p = (\ell^p, \| x \|_{\ell^p}) \end{document} ]]></tex-math></inline-formula> becomes a normed space.</p><p>We also introduce an <italic>n-norm</italic>. Consider a vector space <inline-formula><tex-math id="math-28"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> with <inline-formula><tex-math id="math-29"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle dim(X) \geq n \end{document} ]]></tex-math></inline-formula>. By <xref ref-type="bibr" rid="BIBR-2">[2]</xref>, we give a mapping <inline-formula><tex-math id="math-30"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot,\ldots,\cdot\|_{nX}: X \times \cdots \times X \longrightarrow \mathbb{R} \end{document} ]]></tex-math></inline-formula> such that it has four conditions:</p><list list-type="order"><list-item><p><inline-formula><tex-math id="math-31"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|v_{1},\cdots,v_{n}\|_{nX}\geq0 \end{document} ]]></tex-math></inline-formula> holds for every <inline-formula><tex-math id="math-32"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v_{1},\ldots,v_{n}\in X \end{document} ]]></tex-math></inline-formula>; and <inline-formula><tex-math id="math-33"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v_{1},\ldots,v_{n} \end{document} ]]></tex-math></inline-formula> are linearly dependent if and only if <inline-formula><tex-math id="math-34"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|v_{1},\cdots,v_{n}\|_{nX}=0 \end{document} ]]></tex-math></inline-formula>;</p></list-item><list-item><p><inline-formula><tex-math id="math-35"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|v_{1}, v_{2}, \cdots, v_{n}\|_{nX} = \|v_{i_{1}}, v_{i_{2}} \cdots, v_{i_{n}}\|_{nX} \end{document} ]]></tex-math></inline-formula> holds for every <inline-formula><tex-math id="math-36"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v_{1}, v_{2} \ldots, v_{n} \in X \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-37"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (i_{1}, i_{2} \cdots, i_{n}) \end{document} ]]></tex-math></inline-formula> is permutation of <inline-formula><tex-math id="math-38"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (1, 2 \cdots, n) \end{document} ]]></tex-math></inline-formula>;</p></list-item><list-item><p><inline-formula><tex-math id="math-39"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\alpha v_{1},\cdots,v_{n}\|_{nX}=|\alpha|\|\nu_{1},\cdots,\nu_{n}\|_{nX} \end{document} ]]></tex-math></inline-formula> holds for every <inline-formula><tex-math id="math-40"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v_{1},\ldots,v_{n}\in X \end{document} ]]></tex-math></inline-formula> and for every scalar <inline-formula><tex-math id="math-41"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha\in R \end{document} ]]></tex-math></inline-formula>;</p></list-item><list-item><p><inline-formula><tex-math id="math-42"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|v_{1},\cdots,v_{n-1},y+z\|_{nX}\leq\|v_{1},\cdots,v_{n-1},y\|_{nX}+\|v_{1},\cdots,v_{n-1},z\|_{nX} \end{document} ]]></tex-math></inline-formula> holds for every <inline-formula><tex-math id="math-43"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v_{1},\ldots,v_{n-1},y,z\in X \end{document} ]]></tex-math></inline-formula>.</p></list-item></list><p>We call that <inline-formula><tex-math id="math-44"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot,\cdots,\cdot\|_{nX} \end{document} ]]></tex-math></inline-formula> is an n-norm and the pair <inline-formula><tex-math id="math-45"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (X,\|\cdot,\cdots,\cdot\|_{nX}) \end{document} ]]></tex-math></inline-formula> is an <italic>n</italic>-normed space. On <inline-formula><tex-math id="math-46"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula>, for simplification, we occasionally express the <italic>n</italic>-norm as</p><disp-formula id="equation-2"><tex-math id="math-47"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| v _ {1}, \dots , v _ {n} \| _ {n X} = \| v _ {k} | _ {k = 1} ^ {n} \| _ {n X},\tag{2} \end{document} ]]></tex-math></disp-formula><p>for every <inline-formula><tex-math id="math-48"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v_{1},\cdots,v_{n}\in X \end{document} ]]></tex-math></inline-formula>.</p><p>In functional analysis, the concept of <italic>n</italic>-normed spaces generalizes normed spaces. This idea was studied by various researchers who examined different properties of <italic>n</italic>-normed spaces. The notion of <italic>n</italic>-normed spaces was first introduced by Misiak <xref ref-type="bibr" rid="BIBR-3">[3]</xref>, and subsequent contributions were made by Dutta <xref ref-type="bibr" rid="BIBR-4">[4]</xref>, Gunawan and Mashadi <xref ref-type="bibr" rid="BIBR-5">[5]</xref>, Gunawan <xref ref-type="bibr" rid="BIBR-6">[6]</xref>, Kim and Cho <xref ref-type="bibr" rid="BIBR-7">[7]</xref>, Lewandowska <xref ref-type="bibr" rid="BIBR-8">[8]</xref>, and many others. In the specific case where <italic>n</italic> = 2, the notion of 2-normed spaces was introduced by Gähler in the mid-1960s (see <xref ref-type="bibr" rid="BIBR-9">[9]</xref>). This concept was further developed by Diminnie, Gähler, White [<xref ref-type="bibr" rid="BIBR-10">10</xref>, <xref ref-type="bibr" rid="BIBR-11">11</xref>], among others.</p><p>We can add an extra property to the <italic>n</italic>-norm, as described in the following proposition.</p><p><bold>Proposition 1.1.</bold><italic>On </italic><inline-formula><tex-math id="math-49"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula><italic>, we have a property</italic></p><disp-formula id="equation-3"><tex-math id="math-50"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left\| v _ {1}, \dots , v _ {n - 1}, \sum_ {k = 1} ^ {n} \alpha_ {k} v _ {k} \right\| _ {n X} = | \alpha_ {n} | \| v _ {1}, \dots , v _ {n - 1}, v _ {n} \| _ {n X},\tag{3} \end{document} ]]></tex-math></disp-formula><p>for every <inline-formula><tex-math id="math-51"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v_{1},\ldots,v_{n}\in X \end{document} ]]></tex-math></inline-formula> and for every scalar <inline-formula><tex-math id="math-52"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_{1},\cdots,\alpha_{n}\in \mathbb{R} \end{document} ]]></tex-math></inline-formula>.</p><p>The proof of the above proposition is quite straightforward, relying only on the triangle inequality, the homogeneity property, and the concept of linearly dependent vectors. We leave the verification to the reader.</p><p>For <inline-formula><tex-math id="math-53"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X = \ell^{p} \end{document} ]]></tex-math></inline-formula> where <inline-formula><tex-math id="math-54"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 1 \leq p < \infty \end{document} ]]></tex-math></inline-formula>, we recall<italic> n</italic>-norm which is defined by Gunawan <xref ref-type="bibr" rid="BIBR-2">[2]</xref>. That is a mapping <inline-formula><tex-math id="math-55"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot, \cdots, \cdot\|_{n\ell^{p}} : \ell^{p} \times \cdots \times \ell^{p} \to \mathbb{R} \end{document} ]]></tex-math></inline-formula> which is stated by the following equation</p><disp-formula id="equation-4"><tex-math id="math-56"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|x_k|_{k=1}^n\|_{n\ell^p} := \left( \frac{1}{n!} \sum_{k_1=1}^{\infty} \sum_{k_2=1}^{\infty} \dots \sum_{k_n=1}^{\infty} \begin{Vmatrix} x_{1k_1} & x_{2k_1} & \cdots & x_{nk_1} \\ x_{1k_2} & x_{2k_2} & \cdots & x_{nk_2} \\ \vdots & \vdots & \ddots & \vdots \\ x_{1k_n} & x_{2k_n} & \cdots & x_{nk_n} \end{Vmatrix}^p \right)^{\frac{1}{p}} , \quad (4) \end{document} ]]></tex-math></disp-formula><p>for every <inline-formula><tex-math id="math-57"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x_{1}, x_{2}, \cdots, x_{n} \in \ell^{p} \end{document} ]]></tex-math></inline-formula>. For <inline-formula><tex-math id="math-58"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle p = \infty \end{document} ]]></tex-math></inline-formula>, that is</p><disp-formula id="equation-5"><tex-math id="math-59"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|x_k|_{k=1}^n\|_{n\ell^\infty} := \sup_{k_1, k_2, \dots, k_n \in \mathbb{N}} \begin{Vmatrix} x_{1k_1} & x_{2k_1} & \cdots & x_{nk_1} \\ x_{1k_2} & x_{2k_2} & \cdots & x_{nk_2} \\ \vdots & \vdots & \ddots & \vdots \\ x_{1k_n} & x_{2k_n} & \cdots & x_{nk_n} \end{Vmatrix} , \end{document} ]]></tex-math></disp-formula><p>for every <inline-formula><tex-math id="math-60"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x_{1}, x_{2}, \cdots, x_{n} \in \ell^{\infty} \end{document} ]]></tex-math></inline-formula>. Note that <inline-formula><tex-math id="math-61"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{Vmatrix}x_{1k_1} & x_{2k_1} & \cdots & x_{nk_1} \\x_{1k_2} & x_{2k_2} & \cdots & x_{nk_2} \\\vdots & \vdots & \ddots & \vdots \\x_{1k_n} & x_{2k_n} & \cdots & x_{nk_n}\end{Vmatrix} \end{document} ]]></tex-math></inline-formula> means an</p><p>absolute value of <inline-formula><tex-math id="math-62"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle det\left(\begin{array}{cccc}x_{1k_{1}} & x_{2k_{1}} & \cdots & x_{nk_{1}}\\ x_{1k_{2}} & x_{2k_{2}} & \cdots & x_{nk_{2}}\\ \vdots & \vdots & \ddots & \vdots \\ x_{1k_{n}} & x_{2k_{n}} & \cdots & x_{nk_{n}}\end{array}\right) \end{document} ]]></tex-math></inline-formula>. In this article, the <italic>n</italic>-norm defined by Gunawan (4) is referred to as the usual <italic>n</italic>-norm.</p><p>We now describe that a space <inline-formula><tex-math id="math-63"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula>, equipped with a norm, is called a complete space (or Banach space) if every Cauchy sequence in <inline-formula><tex-math id="math-64"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> converges to a limit within the space. In the context of an <italic>n</italic>-normed space <inline-formula><tex-math id="math-65"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula>, a sequence <inline-formula><tex-math id="math-66"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (x(m)) \end{document} ]]></tex-math></inline-formula> converges to <inline-formula><tex-math id="math-67"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \end{document} ]]></tex-math></inline-formula> if and only if <inline-formula><tex-math id="math-68"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| v _ {1}, \ldots , v _ {(n - 1)}, x (m) - x \| _ {n X} \to 0 \end{document} ]]></tex-math></inline-formula></p><p>for all <inline-formula><tex-math id="math-69"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v_{1}, \ldots, v_{(n-1)} \in X \end{document} ]]></tex-math></inline-formula> as <inline-formula><tex-math id="math-70"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle m \to \infty \end{document} ]]></tex-math></inline-formula>. Likewise, the sequence <inline-formula><tex-math id="math-71"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (x(m)) \end{document} ]]></tex-math></inline-formula> is Cauchy if and only if</p><disp-formula id="equation-6"><tex-math id="math-72"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left\| v _ {1}, \dots , v _ {(n - 1)}, x (m _ {1}) - x (m _ {2}) \right\| _ {n X} \rightarrow 0 \end{document} ]]></tex-math></disp-formula><p>for all <inline-formula><tex-math id="math-73"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v_{1},\ldots,v_{(n-1)}\in X \end{document} ]]></tex-math></inline-formula> as <inline-formula><tex-math id="math-74"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle m_{1},m_{2}\to\infty \end{document} ]]></tex-math></inline-formula>. An <italic>n</italic>-Banach space is an <italic>n</italic>-normed space where every Cauchy sequence converges. It was shown in <xref ref-type="bibr" rid="BIBR-1">[1]</xref> and <xref ref-type="bibr" rid="BIBR-2">[2]</xref> that both the usual norm and the usual <italic>n</italic>-norm result in complete spaces, meaning that both are a Banach spaces and an <italic>n</italic>-Banach spaces respectively. On <inline-formula><tex-math id="math-75"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^{p}(\mathbb{R}) \end{document} ]]></tex-math></inline-formula>, Konca <italic>et al</italic>. <xref ref-type="bibr" rid="BIBR-12">[12]</xref> conducted deeply investigation into the equivalence of two definitions of convergence (two definitions of Cauchy sequences).</p><p>In 2000, Gunawan introduced the norm induced by the usual <italic>n</italic>-norm and the first <italic>n</italic> standard basis vectors in <inline-formula><tex-math id="math-76"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^{p}(\mathbb{R}) \end{document} ]]></tex-math></inline-formula><xref ref-type="bibr" rid="BIBR-2">[2]</xref>. Later, in 2013, he and his students refined this definition by using any set of <italic>n</italic> linearly independent vectors in <inline-formula><tex-math id="math-77"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^{p}(\mathbb{R}) \end{document} ]]></tex-math></inline-formula><xref ref-type="bibr" rid="BIBR-13">[13]</xref>. This prompts the question: can we define an <italic>n</italic>-norm that is induced by a norm? For <inline-formula><tex-math id="math-78"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle p = 2 \end{document} ]]></tex-math></inline-formula>, defining a 2-norm on <inline-formula><tex-math id="math-79"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^{2}(\mathbb{R}) \end{document} ]]></tex-math></inline-formula> is fairly straightforward, along with the corresponding 2-inner product. For <inline-formula><tex-math id="math-80"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^p (\mathbb{R}) \end{document} ]]></tex-math></inline-formula> with <inline-formula><tex-math id="math-81"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle p\neq 2 \end{document} ]]></tex-math></inline-formula>, Konca et al. introduced a 2-inner product and derived a 2-norm (see <xref ref-type="bibr" rid="BIBR-14">[14]</xref>). They also investigated the completeness of these spaces. In 2016, Konca and Idris defined a 2-norm using the usual norm on <inline-formula><tex-math id="math-82"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^p (\mathbb{R}) \end{document} ]]></tex-math></inline-formula> along with a set of bounded linear functionals <xref ref-type="bibr" rid="BIBR-15">[15]</xref>, and later simplified this definition in <xref ref-type="bibr" rid="BIBR-16">[16]</xref>. They also explored the relationships between Gähler's 2-norm <xref ref-type="bibr" rid="BIBR-9">[9]</xref> and Gunawan's 2-norm (the usual 2-norm) <xref ref-type="bibr" rid="BIBR-2">[2]</xref>. In this work, we extend the approach of Konca and Idris to the case of <inline-formula><tex-math id="math-83"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle n > 2 \end{document} ]]></tex-math></inline-formula>. Additionally, we examine the relationship between their definition and the two different definitions of <italic>n-</italic>norms provided by Gähler and Gunawan. Furthermore, we investigate the significant role of bounded linear functionals on the space <inline-formula><tex-math id="math-84"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F:= \ell^q \end{document} ]]></tex-math></inline-formula> where <inline-formula><tex-math id="math-85"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \frac{1}{q} = 1 - \frac{1}{p} \end{document} ]]></tex-math></inline-formula>. Our findings confirm that all the fundamental properties of the <italic>n-norm</italic> on <inline-formula><tex-math id="math-86"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^p \end{document} ]]></tex-math></inline-formula>, constructed in this study are consistent with those discussed in the article "New 2-norms formed on <inline-formula><tex-math id="math-87"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^p \end{document} ]]></tex-math></inline-formula> by bounded linear functionals".</p></sec><sec id="sec-2"><title>2. A SET OF BOUNDED LINEAR FUNCTIONALS</title><p>For further details on bounded linear functionals, we refer to <xref ref-type="bibr" rid="BIBR-16">[16]</xref>. Let <inline-formula><tex-math id="math-88"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> be a normed space and <inline-formula><tex-math id="math-89"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle f: X \to \mathbb{R} \end{document} ]]></tex-math></inline-formula> a bounded linear functional. The set of all bounded linear functionals on <inline-formula><tex-math id="math-90"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula>, known as the dual space of <inline-formula><tex-math id="math-91"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula>, is denoted by <inline-formula><tex-math id="math-92"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X' \end{document} ]]></tex-math></inline-formula>. Now, observe that for every <inline-formula><tex-math id="math-93"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in X \setminus \{0\} \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-94"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle f \in X' \end{document} ]]></tex-math></inline-formula>, we have the inequality <inline-formula><tex-math id="math-95"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle |f(x)| \leq \|f\|_{X'} \|x\|_X \end{document} ]]></tex-math></inline-formula>, or equivalently, <inline-formula><tex-math id="math-96"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \frac{|f(x)|}{\|f\|_{X'}} \leq \|x\|_X \end{document} ]]></tex-math></inline-formula>. Consequently, we obtain the following result:</p><disp-formula id="equation-7"><tex-math id="math-97"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \sup _ {f \neq 0, f \in X ^ {\prime}} \frac {| f (x) |}{\| f \| _ {X ^ {\prime}}} = \sup _ {\| f \| _ {X ^ {\prime}} \leq 1} | f (x) | \leq \| x \| _ {X}. \end{document} ]]></tex-math></disp-formula><p>On <inline-formula><tex-math id="math-98"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^p (\mathbb{R}) \end{document} ]]></tex-math></inline-formula>, the usual norm <inline-formula><tex-math id="math-99"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| \cdot \|_{\ell^p} \end{document} ]]></tex-math></inline-formula> is defined as in (1). Let <inline-formula><tex-math id="math-100"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle w\in \ell^q \end{document} ]]></tex-math></inline-formula> with <inline-formula><tex-math id="math-101"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| w\|_{\ell^q} > 0 \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-102"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \frac{1}{q} = 1 - \frac{1}{p} \end{document} ]]></tex-math></inline-formula>. For every <inline-formula><tex-math id="math-103"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x\in \ell^p \end{document} ]]></tex-math></inline-formula>, we define the functional <inline-formula><tex-math id="math-104"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle f_w:\ell^p\to \mathbb{R} \end{document} ]]></tex-math></inline-formula> as follows:</p><disp-formula id="equation-8"><tex-math id="math-105"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle f _ {w} (x) := \sum_ {k = 1} ^ {\infty} w _ {k} x _ {k}\tag{5} \end{document} ]]></tex-math></disp-formula><p>This functional is linear, and by applying Hölder's inequality, for every <inline-formula><tex-math id="math-106"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in \ell^p \end{document} ]]></tex-math></inline-formula>, we obtain</p><disp-formula id="equation-9"><tex-math id="math-107"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle f _ {w} (x) \leq | f _ {w} (x) | \leq \| w \| _ {\ell^ {q}} \| x \| _ {\ell^ {p}}.\tag{6} \end{document} ]]></tex-math></disp-formula><p>Thus, we conclude that <inline-formula><tex-math id="math-108"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle f_{w} \end{document} ]]></tex-math></inline-formula> is a bounded linear functional. We then collect all such bounded linear functionals <inline-formula><tex-math id="math-109"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle f_{w} \end{document} ]]></tex-math></inline-formula> into the set</p><disp-formula id="equation-10"><tex-math id="math-110"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F := \left\{f _ {w} \mid w \in \ell^ {q} \right\} = \ell^ {q}. \end{document} ]]></tex-math></disp-formula><p>Here, <inline-formula><tex-math id="math-111"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^q \end{document} ]]></tex-math></inline-formula> represents the dual space of <inline-formula><tex-math id="math-112"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^p \end{document} ]]></tex-math></inline-formula>, consisting of all bounded linear functionals on <inline-formula><tex-math id="math-113"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^p \end{document} ]]></tex-math></inline-formula>. As noted in <xref ref-type="bibr" rid="BIBR-1">[1]</xref>, we have a norm <inline-formula><tex-math id="math-114"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| f_w\| _F = \| w\|_{\ell^q} \end{document} ]]></tex-math></inline-formula>, and we say that <inline-formula><tex-math id="math-115"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (F,\| \cdot \| _F) \end{document} ]]></tex-math></inline-formula> is a normed space.</p><p>Based on the previous description, we now present a definition of another norm on <inline-formula><tex-math id="math-116"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^p \end{document} ]]></tex-math></inline-formula> using sets of bounded linear functionals. Specifically, we define</p><disp-formula id="equation-11"><tex-math id="math-117"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| x \| _ {(f _ {w}) \ell^ {p}} := \sup _ {\| f _ {w} \| _ {F} > 0} \frac {| f _ {w} (x) |}{\| f _ {w} \| _ {F}}\tag{7} \end{document} ]]></tex-math></disp-formula><p>for every <inline-formula><tex-math id="math-118"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in \ell^{p} \end{document} ]]></tex-math></inline-formula>. Readers can verify that this definition indeed defines a norm. Next, we explore its relationship with the usual norm. For <inline-formula><tex-math id="math-119"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in \ell^{p} \end{document} ]]></tex-math></inline-formula>, let <inline-formula><tex-math id="math-120"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle w_{*} \in \ell^{q} \end{document} ]]></tex-math></inline-formula> be defined as <inline-formula><tex-math id="math-121"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle w_{*} = (w_{*k})_{k \in \mathbb{N}} \end{document} ]]></tex-math></inline-formula>, where <inline-formula><tex-math id="math-122"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle w_{*k} := |x_{k}|^{(p-1)} \end{document} ]]></tex-math></inline-formula> sign <inline-formula><tex-math id="math-123"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (x_{k}) \end{document} ]]></tex-math></inline-formula>. We have</p><disp-formula id="equation-12"><tex-math id="math-124"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | f _ {w _ {*}} (x) | = \sum_ {k = 1} ^ {\infty} | x _ {k} | ^ {(p - 1)} \operatorname{sign} \left(x _ {k}\right) x _ {k} = \sum_ {k = 1} ^ {\infty} | x _ {k} | ^ {p} = \| x \| _ {\ell^ {p}} ^ {p}. \end{document} ]]></tex-math></disp-formula><p>Additionally, the norm of the functional is computed as</p><disp-formula id="equation-13"><tex-math id="math-125"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| f _ {w _ {*}} \| _ {F} = \left(\sum_ {k = 1} ^ {\infty} (| x _ {k} | ^ {(p - 1)}) ^ {q}\right) ^ {\frac {1}{q}} = \left(\sum_ {k = 1} ^ {\infty} | x _ {k} | ^ {p}\right) ^ {\frac {1}{q}} = \| x \| _ {\ell^ {p}} ^ {p - 1}. \end{document} ]]></tex-math></disp-formula><p>Thus, we obtain</p><disp-formula id="equation-14"><tex-math id="math-126"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| x \| _ {(f _ {w}) \ell^ {p}} \geq \frac {| f _ {w _ {*}} (x) |}{\| f _ {w _ {*}} \| _ {F}} = \| x \| _ {\ell^ {p}}. \end{document} ]]></tex-math></disp-formula><p>Since the inequality in equation (6) holds, we conclude that</p><p><inline-formula><tex-math id="math-127"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left\| x \right\| _ {(f _ {w}) \ell^ {p}} = \left\| x \right\| _ {\ell^ {p}}, \end{document} ]]></tex-math></inline-formula></p><p>for every <inline-formula><tex-math id="math-128"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in \ell^p \end{document} ]]></tex-math></inline-formula>. This shows that the norms <inline-formula><tex-math id="math-129"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| \cdot \|_{(f_w)\ell^p} \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-130"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| \cdot \|_{\ell^p} \end{document} ]]></tex-math></inline-formula> are equivalent.</p></sec><sec id="sec-3"><title>3. MAIN RESULTS AND DISCUSSION</title><p>We begin by recalling Gähler's definition of the<italic> n</italic>-norm on <inline-formula><tex-math id="math-131"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^{p} \end{document} ]]></tex-math></inline-formula>, where <inline-formula><tex-math id="math-132"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle p \geq 1 \end{document} ]]></tex-math></inline-formula>. Let <inline-formula><tex-math id="math-133"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F = \ell^{q} \end{document} ]]></tex-math></inline-formula> be the dual space consisting of all bounded linear functionals, where <inline-formula><tex-math id="math-134"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \frac{1}{q} = 1 - \frac{1}{p} \end{document} ]]></tex-math></inline-formula>. According to Gähler, the <italic>n</italic>-norm <inline-formula><tex-math id="math-135"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot, \cdots, \cdot\|_{n \odot \ell^{p}}^{G}: \ell^{p} \to \mathbb{R} \end{document} ]]></tex-math></inline-formula> is defined by</p><disp-formula id="equation-15"><tex-math id="math-136"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| x_{k}|_{k = 1}^{n}\|_{n\odot \ell^{p}}^{G}:= \sup_{\substack{0 < \| f_{w_{j}}\|_{F}\leq 1,f_{w_{j}}(x_{i})\neq 0\\ i,j\in \{1,2,\dots ,n\}}}\left| \begin{array}{ccc}f_{w_{1}}(x_{1}) & \dots & f_{w_{1}}(x_{n})\\ \vdots & \ddots & \vdots \\ f_{w_{n}}(x_{1}) & \dots & f_{w_{n}}(x_{n}). \end{array} \right|\tag{8} \end{document} ]]></tex-math></disp-formula><p>for every <inline-formula><tex-math id="math-137"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x_{1}, x_{2}, \cdots, x_{n} \in \ell^{p} \end{document} ]]></tex-math></inline-formula>.<target id="anchor-920f528d-b37a-49bd-9f75-c527a37ca52a" target-type="reference-target"/></p><p><bold>Lemma 3.1. </bold><italic>For </italic><inline-formula><tex-math id="math-138"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x_{1}, x_{2}, \cdots, x_{n} \in \ell^{p} \end{document} ]]></tex-math></inline-formula><italic> and </italic><inline-formula><tex-math id="math-139"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle w_{1}, w_{2}, \cdots, w_{n} \in \ell^{q} \end{document} ]]></tex-math></inline-formula><italic> where </italic><inline-formula><tex-math id="math-140"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 1 = \frac{1}{p} + \frac{1}{q} \end{document} ]]></tex-math></inline-formula><italic>, we have</italic></p><disp-formula id="equation-16"><tex-math id="math-141"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{vmatrix}\displaystyle\sum_{k=1}^{\infty} x_{1k} w_{1k} & \cdots & \displaystyle\sum_{k=1}^{\infty} x_{nk} w_{1k} \\[12pt]\vdots & \ddots & \vdots \\[6pt]\displaystyle\sum_{k=1}^{\infty} x_{1k} w_{nk} & \cdots & \displaystyle\sum_{k=1}^{\infty} x_{nk} w_{nk}\end{vmatrix}= \sum_{k_n=1}^{\infty} \cdots \sum_{k_1=1}^{\infty} w_{nk_n} \cdots w_{1k_1}\begin{vmatrix}x_{1k_1} & \cdots & x_{nk_1} \\\vdots & \ddots & \vdots \\x_{1k_n} & \cdots & x_{nk_n}\end{vmatrix}. \end{document} ]]></tex-math></disp-formula><p><italic>Proof</italic>. Take arbitrary <inline-formula><tex-math id="math-142"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x_{1}, x_{2}, \cdots, x_{n} \in \ell^{p} \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-143"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle w_{1}, w_{2}, \cdots, w_{n} \in \ell^{q} \end{document} ]]></tex-math></inline-formula> where <inline-formula><tex-math id="math-144"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 1 = \frac{1}{p} + \frac{1}{q} \end{document} ]]></tex-math></inline-formula>.Let</p><disp-formula id="equation-17"><tex-math id="math-145"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle M_n := \begin{vmatrix}\displaystyle\sum_{k=1}^{\infty} x_{1k} w_{1k} & \cdots & \displaystyle\sum_{k=1}^{\infty} x_{nk} w_{1k} \\[12pt]\vdots & \ddots & \vdots \\[6pt]\displaystyle\sum_{k=1}^{\infty} x_{1k} w_{nk} & \cdots & \displaystyle\sum_{k=1}^{\infty} x_{nk} w_{nk}\end{vmatrix}. \end{document} ]]></tex-math></disp-formula><p>Using the properties of determinant and applying Laplace expansion, we get</p><p><inline-formula><tex-math id="math-146"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{align*}M_n &= \begin{vmatrix}x_{11} w_{11} + \displaystyle\sum_{k_1=2}^{\infty} x_{1k_1} w_{1k_1} & \cdots & x_{n1} w_{11} + \displaystyle\sum_{k_1=2}^{\infty} x_{nk_1} w_{1k_1} \\[12pt]\displaystyle\sum_{k_2=1}^{\infty} x_{1k_2} w_{2k_2} & \cdots & \displaystyle\sum_{k_2=1}^{\infty} x_{nk_2} w_{2k_2} \\[6pt]\vdots & \ddots & \vdots \\[6pt]\displaystyle\sum_{k_n=1}^{\infty} x_{1k_n} w_{nk_n} & \cdots & \displaystyle\sum_{k_n=1}^{\infty} x_{nk_n} w_{nk_n}\end{vmatrix} \\[14pt]&= \begin{vmatrix}x_{11} w_{11} & \cdots & x_{n1} w_{11} \\[12pt]\displaystyle\sum_{k_2=1}^{\infty} x_{1k_2} w_{2k_2} & \cdots & \displaystyle\sum_{k_2=1}^{\infty} x_{nk_2} w_{2k_2} \\[6pt]\vdots & \ddots & \vdots \\[6pt]\displaystyle\sum_{k_n=1}^{\infty} x_{1k_n} w_{nk_n} & \cdots & \displaystyle\sum_{k_n=1}^{\infty} x_{nk_n} w_{nk_n}\end{vmatrix} + \begin{vmatrix}\displaystyle\sum_{k_1=2}^{\infty} x_{1k_1} w_{1k_1} & \cdots & \displaystyle\sum_{k_1=2}^{\infty} x_{nk_1} w_{1k_1} \\[12pt]\displaystyle\sum_{k_2=1}^{\infty} x_{1k_2} w_{2k_2} & \cdots & \displaystyle\sum_{k_2=1}^{\infty} x_{nk_2} w_{2k_2} \\[6pt]\vdots & \ddots & \vdots \\[6pt]\displaystyle\sum_{k_n=1}^{\infty} x_{1k_n} w_{nk_n} & \cdots & \displaystyle\sum_{k_n=1}^{\infty} x_{nk_n} w_{nk_n}\end{vmatrix}.\end{align*} \end{document} ]]></tex-math></inline-formula></p><p>Check that</p><p><inline-formula><tex-math id="math-147"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{vmatrix}x_{11} w_{11} & \cdots & x_{n1} w_{11} \\[12pt]\displaystyle\sum_{k_2=1}^{\infty} x_{1k_2} w_{2k_2} & \cdots & \displaystyle\sum_{k_2=1}^{\infty} x_{nk_2} w_{2k_2} \\[6pt]\vdots & \ddots & \vdots \\[6pt]\displaystyle\sum_{k_n=1}^{\infty} x_{1k_n} w_{nk_n} & \cdots & \displaystyle\sum_{k_n=1}^{\infty} x_{nk_n} w_{nk_n}\end{vmatrix}= w_{11}\begin{vmatrix}x_{11} & \cdots & x_{n1} \\[12pt]\displaystyle\sum_{k_2=1}^{\infty} x_{1k_2} w_{2k_2} & \cdots & \displaystyle\sum_{k_2=1}^{\infty} x_{nk_2} w_{2k_2} \\[6pt]\vdots & \ddots & \vdots \\[6pt]\displaystyle\sum_{k_n=1}^{\infty} x_{1k_n} w_{nk_n} & \cdots & \displaystyle\sum_{k_n=1}^{\infty} x_{nk_n} w_{nk_n}\end{vmatrix}. \end{document} ]]></tex-math></inline-formula></p><p>So, we obtain</p><p><inline-formula><tex-math id="math-148"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle M_n = w_{11} \begin{vmatrix}x_{11} & \cdots & x_{n1} \\[12pt]\displaystyle\sum_{k_2=1}^{\infty} x_{1k_2} w_{2k_2} & \cdots & \displaystyle\sum_{k_2=1}^{\infty} x_{nk_2} w_{2k_2} \\[6pt]\vdots & \ddots & \vdots \\[6pt]\displaystyle\sum_{k_n=1}^{\infty} x_{1k_n} w_{nk_n} & \cdots & \displaystyle\sum_{k_n=1}^{\infty} x_{nk_n} w_{nk_n}\end{vmatrix} + \begin{vmatrix}\displaystyle\sum_{k_1=2}^{\infty} x_{1k_1} w_{1k_1} & \cdots & \displaystyle\sum_{k_1=2}^{\infty} x_{nk_1} w_{1k_1} \\[12pt]\displaystyle\sum_{k_2=1}^{\infty} x_{1k_2} w_{2k_2} & \cdots & \displaystyle\sum_{k_2=1}^{\infty} x_{nk_2} w_{2k_2} \\[6pt]\vdots & \ddots & \vdots \\[6pt]\displaystyle\sum_{k_n=1}^{\infty} x_{1k_n} w_{nk_n} & \cdots & \displaystyle\sum_{k_n=1}^{\infty} x_{nk_n} w_{nk_n}\end{vmatrix}. \end{document} ]]></tex-math></inline-formula></p><p>Moving to <inline-formula><tex-math id="math-149"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle w_{12} \end{document} ]]></tex-math></inline-formula>, we obtain</p><p><inline-formula><tex-math id="math-150"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle M_n = \sum_{k_1=1}^{2} w_{1k_1} \begin{vmatrix}x_{1k_1} & \cdots & x_{nk_1} \\[12pt]\displaystyle\sum_{k_2=1}^{\infty} x_{1k_2} w_{2k_2} & \cdots & \displaystyle\sum_{k_2=1}^{\infty} x_{nk_2} w_{2k_2} \\[6pt]\vdots & \ddots & \vdots \\[6pt]\displaystyle\sum_{k_n=1}^{\infty} x_{1k_n} w_{nk_n} & \cdots & \displaystyle\sum_{k_n=1}^{\infty} x_{nk_n} w_{nk_n}\end{vmatrix} + \begin{vmatrix}\displaystyle\sum_{k_1=3}^{\infty} x_{1k_1} w_{1k_1} & \cdots & \displaystyle\sum_{k_1=3}^{\infty} x_{nk_1} w_{1k_1} \\[12pt]\displaystyle\sum_{k_2=1}^{\infty} x_{1k_2} w_{2k_2} & \cdots & \displaystyle\sum_{k_2=1}^{\infty} x_{nk_2} w_{2k_2} \\[6pt]\vdots & \ddots & \vdots \\[6pt]\displaystyle\sum_{k_n=1}^{\infty} x_{1k_n} w_{nk_n} & \cdots & \displaystyle\sum_{k_n=1}^{\infty} x_{nk_n} w_{nk_n}\end{vmatrix}. \end{document} ]]></tex-math></inline-formula></p><p>Next, moving to <inline-formula><tex-math id="math-151"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle w_{1k_1} \end{document} ]]></tex-math></inline-formula> where <inline-formula><tex-math id="math-152"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k_{1} \end{document} ]]></tex-math></inline-formula> goes to <inline-formula><tex-math id="math-153"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \infty \end{document} ]]></tex-math></inline-formula></p><p><inline-formula><tex-math id="math-154"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle M_n = \sum_{k_1=1}^{\infty} w_{1k_1} \begin{vmatrix}x_{1k_1} & \cdots & x_{nk_1} \\[12pt]\displaystyle\sum_{k_2=1}^{\infty} x_{1k_2} w_{2k_2} & \cdots & \displaystyle\sum_{k_2=1}^{\infty} x_{nk_2} w_{2k_2} \\[6pt]\vdots & \ddots & \vdots \\[6pt]\displaystyle\sum_{k_n=1}^{\infty} x_{1k_n} w_{nk_n} & \cdots & \displaystyle\sum_{k_n=1}^{\infty} x_{nk_n} w_{nk_n}\end{vmatrix}. \end{document} ]]></tex-math></inline-formula></p><p>We repeat the same process for <inline-formula><tex-math id="math-155"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k_{2}, k_{3}, \cdots, k_{n} \end{document} ]]></tex-math></inline-formula> to get</p><p><inline-formula><tex-math id="math-156"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{aligned}M_n &= \sum_{k_1=1}^{\infty} w_{1k_1} \sum_{k_2=1}^{\infty} w_{2k_2} \begin{vmatrix}x_{1k_1} & \cdots & x_{nk_1} \\[6pt]x_{1k_2} & \cdots & x_{nk_2} \\[6pt]\displaystyle\sum_{k_3=1}^{\infty} x_{1k_3} w_{3k_3} & \cdots & \displaystyle\sum_{k_3=1}^{\infty} x_{nk_3} w_{3k_3} \\[6pt]\vdots & \ddots & \vdots \\[6pt]\displaystyle\sum_{k_n=1}^{\infty} x_{1k_n} w_{nk_n} & \cdots & \displaystyle\sum_{k_n=1}^{\infty} x_{nk_n} w_{nk_n}\end{vmatrix} \\[12pt]&\,\,\,\vdots \\[12pt]&= \sum_{k_1=1}^{\infty} w_{1k_1} \sum_{k_2=1}^{\infty} w_{2k_2} \cdots \sum_{k_n=1}^{\infty} w_{nk_n} \begin{vmatrix}x_{1k_1} & \cdots & x_{nk_1} \\[6pt]x_{1k_2} & \cdots & x_{nk_2} \\[6pt]\vdots & \ddots & \vdots \\[6pt]x_{1k_n} & \cdots & x_{nk_n}\end{vmatrix}.\end{aligned} \end{document} ]]></tex-math></inline-formula></p><p>Applying the homogeneity property of summability,</p><disp-formula id="equation-18"><tex-math id="math-157"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle M _ {n} = \sum_ {k _ {n} = 1} ^ {\infty} \dots \sum_ {k _ {1} = 1} ^ {\infty} w _ {n k _ {n}} \dots w _ {1 k _ {1}} \left| \begin{array}{c c c} x _ {1 k _ {1}} & \dots & x _ {n k _ {1}} \\ \vdots & \ddots & \vdots \\ x _ {1 k _ {n}} & \dots & x _ {n k _ {n}} \end{array} \right| \end{document} ]]></tex-math></disp-formula><p>holds. The proof is thereby completed.</p><p>By the above lemma, we have</p><disp-formula id="equation-19"><tex-math id="math-158"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left| \begin{array}{c c c} f _ {w _ {1}} (x _ {1}) & \dots & f _ {w _ {1}} (x _ {n}) \\ \vdots & \ddots & \vdots \\ f _ {w _ {n}} (x _ {1}) & \dots & f _ {w _ {n}} (x _ {n}). \end{array} \right| = \sum_ {k _ {n} = 1} ^ {\infty} \dots \sum_ {k _ {1} = 1} ^ {\infty} w _ {n k _ {n}} \dots w _ {1 k _ {1}} \left| \begin{array}{c c c} x _ {1 k _ {1}} & \dots & x _ {n k _ {1}} \\ \vdots & \ddots & \vdots \\ x _ {1 k _ {n}} & \dots & x _ {n k _ {n}} \end{array} \right| \end{document} ]]></tex-math></disp-formula><p>and we also use it for (8)</p><disp-formula id="equation-20"><tex-math id="math-159"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| x_{k}|_{k = 1}^{n}\|_{n\odot \ell^{p}}^{G} = \sup_{\substack{0 < \left\| f_{w_{j}}\right\|_{F}\leq 1\\ f_{w_{j}}(x_{i})\neq 0\\ i,j\in \{1,2,\dots ,n\}}}\sum_{k_{n} = 1}^{\infty}\dots \sum_{k_{1} = 1}^{\infty}w_{nk_{n}}\dots w_{1k_{1}}\left| \begin{array}{ccc}x_{1k_{1}} & \dots & x_{nk_{1}}\\ \vdots & \ddots & \vdots \\ x_{1k_{n}} & \dots & x_{nk_{n}} \end{array} \right| \end{document} ]]></tex-math></disp-formula><p>In (8), there is a slight modification to Gähler's definition of the <italic>n</italic>-norm. Here, we add the condition <inline-formula><tex-math id="math-160"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle f_{w_j}(x_i) \neq 0 \end{document} ]]></tex-math></inline-formula> for <inline-formula><tex-math id="math-161"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle i, j \in \{1, \cdots, n\} \end{document} ]]></tex-math></inline-formula> to obtain the supremum <inline-formula><tex-math id="math-162"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left| \begin{array}{cccc} f_{w_1}(x_1) & \cdots & f_{w_1}(x_n) \\ \vdots & \ddots & \vdots \\ f_{w_n}(x_1) & \cdots & f_{w_n}(x_n) \end{array} \right| \end{document} ]]></tex-math></inline-formula>. This condition is required since defining a new <italic>n</italic>-norm involves a division by <inline-formula><tex-math id="math-163"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle f_{w} \end{document} ]]></tex-math></inline-formula>. Now, take arbitrary <inline-formula><tex-math id="math-164"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x_1 , x_2, ...,  x_n \in \ell^p \end{document} ]]></tex-math></inline-formula> and let</p><disp-formula id="equation-21"><tex-math id="math-165"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A _ {n 1} := \frac {x _ {n}}{f _ {w} (x _ {n})} - \frac {x _ {1}}{f _ {w} (x _ {1})} \end{document} ]]></tex-math></disp-formula><p>.</p><p>Using (4), we get</p><disp-formula id="equation-22"><tex-math id="math-166"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{aligned}&\frac{\|x_1 f_w(x_n) - x_n f_w(x_1), \dots, x_{(n-1)} f_w(x_n) - x_n f_w(x_{(n-1)})\|_{(n-1)\ell^p}}{|f_w(x_n)|^{(n-2)}} \tag{9} \\[8pt]&= \left\| x_n f_w(x_1) - x_1 f_w(x_n), x_2 - x_n \frac{f_w(x_2)}{f_w(x_n)}, \dots, x_{(n-1)} - x_n \frac{f_w(x_{(n-1)})}{f_w(x_n)} \right\|_{(n-1)\ell^p} \\[8pt]&= |f_w(x_1) f_w(x_n)| \\[6pt]&\quad \times \left\| A_{n1}, x_2 - \frac{x_1 f_w(x_2)}{f_w(x_1)} - f_w(x_2) A_{n1} , \cdot\cdot\cdot , x_{(n-1)} - \frac{x_1 f_w(x_{(n-1)})}{f_w(x_1)} - f_w(x_{(n-1)}) A_{n1} \right\|_{(n-1)\ell^p} \\[8pt]&= |f_w(x_1) f_w(x_n)| \left\| A_{n1}, x_2 - x_1 \frac{f_w(x_2)}{f_w(x_1)}, \dots, x_{(n-1)} - x_1 \frac{f_w(x_{(n-1)})}{f_w(x_1)} \right\|_{(n-1)\ell^p} \\[8pt]&= \frac{\|x_2 f_w(x_1) - x_1 f_w(x_2), \dots, x_n f_w(x_1) - x_1 f_w(x_n)\|_{(n-1)\ell^p}}{|f_w(x_1)|^{(n-2)}}.\end{aligned} \end{document} ]]></tex-math></disp-formula><p>We proceed to define a mapping based on the usual <inline-formula><tex-math id="math-167"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (n-1) \end{document} ]]></tex-math></inline-formula>-norm on <inline-formula><tex-math id="math-168"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^{p} \end{document} ]]></tex-math></inline-formula> and the set of bounded linear functionals <inline-formula><tex-math id="math-169"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F = \ell^{q} \end{document} ]]></tex-math></inline-formula>. The definition is given as follows.</p><disp-formula id="equation-23"><tex-math id="math-170"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{array}{l}\| x_{k}|_{k = 1}^{n}\|_{n\odot \ell^{p}}^{I}\\ := \sup_{\substack{0 < \| f_{w}\|_{F}\leq 1\\ f_{w}(x_{i})\neq 0\\ i\in \{1,2,\dots ,n\}}}\frac{\|x_{2}f_{w}(x_{1}) - x_{1}f_{w}(x_{2}),\cdots,x_{n}f_{w}(x_{1}) - x_{1}f_{w}(x_{n})\|_{(n - 1)\ell^{p}}}{|f_{w}(x_{1})|^{(n - 2)}}, \end{array}\tag{10} \end{document} ]]></tex-math></disp-formula><p>for every <inline-formula><tex-math id="math-171"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x_{1}, x_{2}, \cdots, x_{n} \in \ell^{p} \end{document} ]]></tex-math></inline-formula>.</p><p>Since <inline-formula><tex-math id="math-172"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot,\ldots,\cdot\|_{(n-1)\ell^{p}}^{I} \end{document} ]]></tex-math></inline-formula> is an <inline-formula><tex-math id="math-173"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (n-1) \end{document} ]]></tex-math></inline-formula>-norm, then we can use its properties to verify that (10) is an <italic>n</italic>-norm. Readers may check its properties. Now, we represent (9) in a form</p><disp-formula id="equation-24"><tex-math id="math-174"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{aligned}\frac{\left\| x_k f_w(x_n) - x_n f_w(x_k) \big|_{k=1}^{(n-1)} \right\|_{(n-1)\ell^p}}{|f_w(x_n)|^{(n-2)}}&= |f_w(x_n)| \left\| x_k - x_n \frac{f_w(x_k)}{f_w(x_n)} \bigg|_{k=1}^{(n-1)} \right\|_{(n-1)\ell^p} \\[12pt]&= \left( \frac{1}{(n-1)!} \sum_{k_1=1}^{\infty} \sum_{k_2=1}^{\infty} \cdots \sum_{k_{(n-1)}=1}^{\infty} |B|^p \right)^{\frac{1}{p}},\end{aligned} \end{document} ]]></tex-math></disp-formula><p>where</p><disp-formula id="equation-25"><tex-math id="math-175"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle B = f_w(x_n) \begin{vmatrix}x_{1k_1} - \frac{x_{nk_1} f_w(x_1)}{f_w(x_n)} & \cdots & x_{(n-1)k_1} - \frac{x_{nk_1} f_w(x_{(n-1)})}{f_w(x_n)} \\[12pt]\vdots & \ddots & \vdots \\[12pt]x_{1k_{(n-1)}} - \frac{x_{nk_{(n-1)}} f_w(x_1)}{f_w(x_n)} & \cdots & x_{(n-1)k_{(n-1)}} - \frac{x_{nk_{(n-1)}} f_w(x_{(n-1)})}{f_w(x_n)}\end{vmatrix}. \tag{11} \end{document} ]]></tex-math></disp-formula><p>Using Laplace expansion, (11) becomes</p><disp-formula id="equation-26"><tex-math id="math-176"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{aligned}B &= \begin{vmatrix}x_{1k_1} & \cdots & x_{(n-1)k_1} & x_{nk_1} \\[6pt]\vdots & \ddots & \vdots & \\[6pt]x_{1k_{(n-1)}} & \cdots & x_{(n-1)k_{(n-1)}} & x_{nk_{(n-1)}} \\[6pt]f_w(x_1) & \cdots & f_w(x_{(n-1)}) & f_w(x_n)\end{vmatrix} \\[12pt]&= \sum_{k_n=1}^{\infty} w_{k_n} \begin{vmatrix}x_{1k_1} & \cdots & x_{(n-1)k_1} & x_{nk_1} \\[6pt]\vdots & \ddots & \vdots & \\[6pt]x_{1k_{(n-1)}} & \cdots & x_{(n-1)k_{(n-1)}} & x_{nk_{(n-1)}} \\[6pt]x_{1k_n} & \cdots & x_{(n-1)k_n} & x_{nk_n}\end{vmatrix}.\end{aligned} \end{document} ]]></tex-math></disp-formula><p>Consequently, (10) becomes</p><p><inline-formula><tex-math id="math-177"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{aligned}\|x_k|_{k=1}^n \|_{n\odot\ell^p}^I &= \sup_{\substack{0 < \|f_w\|_F \le 1 \\ f_w(x_i) \neq 0 \\ i \in \{1,2,\dots,n\}}} |f_w(x_n)| \left\| x_k - x_n \frac{f_w(x_k)}{f_w(x_n)} \bigg|_{k=1}^{(n-1)} \right\|_{(n-1)\ell^p} \\[12pt]&= \sup_{\substack{0 < \|f_w\|_F \le 1 \\ f_w(x_i) \neq 0 \\ i \in \{1,2,\dots,n\}}} \left( \frac{\displaystyle\sum_{k_1=1}^{\infty} \cdots \sum_{k_{(n-1)}=1}^{\infty} \left| \left( \sum_{k_n=1}^{\infty} w_{k_n} \begin{vmatrix} x_{1k_1} & \cdots & x_{nk_1} \\[6pt] \vdots & \ddots & \vdots \\[6pt] x_{1k_n} & \cdots & x_{nk_n} \end{vmatrix} \right) \right|^p}{(n-1)!} \right)^{\frac{1}{p}}.\end{aligned} \end{document} ]]></tex-math></inline-formula></p><sec id="sec-4"><title>3.1. Equivalence of Three n-norms.</title><p>Now, there are three<italic> n</italic>-norms on <inline-formula><tex-math id="math-178"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^{p} \end{document} ]]></tex-math></inline-formula>. We will investigate their relationships.<target id="anchor-6b959e5d-505e-4907-b193-5526e0e41e77" target-type="reference-target"/></p><p><bold>Proposition 3.2. </bold><italic>Let </italic><inline-formula><tex-math id="math-179"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle p \geq 1 \end{document} ]]></tex-math></inline-formula><italic>. For every </italic><inline-formula><tex-math id="math-180"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x_{1}, x_{2}, \cdots, x_{n} \in \ell^{p} \end{document} ]]></tex-math></inline-formula><italic>, we have</italic></p><disp-formula id="equation-27"><tex-math id="math-181"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle C _ {1} \| x _ {1}, x _ {2}, \dots , x _ {n} \| _ {n \odot \ell^ {p}} ^ {G} \leq \| x _ {1}, x _ {2}, \dots , x _ {n} \| _ {n \odot \ell^ {p}} ^ {I} \leq C _ {2} \| x _ {1}, x _ {2}, \dots , x _ {n} \| _ {n \ell^ {p}}, \end{document} ]]></tex-math></disp-formula><p>where <inline-formula><tex-math id="math-182"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle C_{1}=\left(\frac{1}{(n-1)!}\right)^{\frac{1}{p}} \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-183"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle C_{2}=\left(\frac{n!}{(n-1)!}\right)^{\frac{1}{p}} \end{document} ]]></tex-math></inline-formula>.</p><p><italic>Proof</italic>. For arbitrary <inline-formula><tex-math id="math-184"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x_{1}, x_{2}, \ldots, x_{n} \in \ell^{p} \end{document} ]]></tex-math></inline-formula>, recall (8)</p><disp-formula id="equation-28"><tex-math id="math-185"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| x_{k}|_{k = 1}^{n}\|_{n\odot \ell^{p}}^{G} = \sup_{\substack{0 < \left\| f_{w_{j}}\right\|_{F}\leq 1\\ f_{w_{j}}(x_{i})\neq 0\\ i,j\in \{1,2,\dots ,n\}}}\sum_{k_{1} = 1}^{\infty}\dots \sum_{k_{n} = 1}^{\infty}w_{1k_{1}}\dots w_{nk_{n}}\left| \begin{array}{ccc}x_{1k_{1}} & \dots & x_{nk_{1}}\\ \vdots & \ddots & \vdots \\ x_{1k_{n}} & \dots & x_{nk_{n}} \end{array} \right|. \end{document} ]]></tex-math></disp-formula><p>Notice the following expression</p><disp-formula id="equation-29"><tex-math id="math-186"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \sum_ {k _ {1} = 1} ^ {\infty} \dots \sum_ {k _ {n} = 1} ^ {\infty} w _ {1 k _ {1}} \dots w _ {n k _ {n}} \left| \begin{array}{c c c} x _ {1 k _ {1}} & \dots & x _ {n k _ {1}} \\ \vdots & \ddots & \vdots \\ x _ {1 k _ {n}} & \dots & x _ {n k _ {n}} \end{array} \right| = \sum_ {k _ {1} = 1} ^ {\infty} \dots \sum_ {k _ {(n - 1)} = 1} ^ {\infty} \Big (w _ {1 k _ {1}} \dots w _ {(n - 1) k _ {(n - 1)}} \Big) D \end{document} ]]></tex-math></disp-formula><p>where <inline-formula><tex-math id="math-187"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle D = \sum_{k_{n}=1}^{\infty} w_{nk_{n}} \left| \begin{array}{ccc} x_{1k_{1}} & \cdots & x_{nk_{1}} \\ \vdots & \ddots & \vdots \\ x_{1k_{n}} & \cdots & x_{nk_{n}} \end{array} \right| \end{document} ]]></tex-math></inline-formula>. By applying Hölder's inequality, we obtain</p><disp-formula id="equation-30"><tex-math id="math-188"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{aligned}&\sum_{k_1=1}^{\infty} \cdots \sum_{k_{(n-1)}=1}^{\infty} \left( w_{1k_1} \cdots w_{(n-1)k_{(n-1)}} \right) D \\[8pt]&\quad \le \left( \sum_{k_1=1}^{\infty} \cdots \sum_{k_{(n-1)}=1}^{\infty} \left| w_{1k_1} \cdots w_{(n-1)k_{(n-1)}} \right|^q \right)^{\frac{1}{q}} \left( \sum_{k_1=1}^{\infty} \cdots \sum_{k_{(n-1)}=1}^{\infty} |D|^p \right)^{\frac{1}{p}} \\[8pt]&\quad \le \left( \sum_{k_1=1}^{\infty} \cdots \sum_{k_{(n-1)}=1}^{\infty} |D|^p \right)^{\frac{1}{p}}.\end{aligned} \end{document} ]]></tex-math></disp-formula><p>So, we have</p><disp-formula id="equation-31"><tex-math id="math-189"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{aligned}\|x_k|_{k=1}^n \|_{n\odot\ell^p}^G &= \sup_{\substack{0 < \|f_{w_j}\|_F \le 1 \\ f_{w_j}(x_i) \neq 0 \\ i,j \in \{1,2,\dots,n\}}} \sum_{k_1=1}^{\infty} \cdots \sum_{k_{(n-1)}=1}^{\infty} \left( w_{1k_1} \cdots w_{(n-1)k_{(n-1)}} \right) D \\[12pt]&\le \sup_{\substack{0 < \|f_{w_j}\|_F \le 1 \\ f_{w_j}(x_i) \neq 0 \\ i,j \in \{1,2,\dots,n\}}} \left( \sum_{k_1=1}^{\infty} \cdots \sum_{k_{(n-1)}=1}^{\infty} |D|^p \right)^{\frac{1}{p}}.\end{aligned} \end{document} ]]></tex-math></disp-formula><p>Check that</p><disp-formula id="equation-32"><tex-math id="math-190"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{aligned}&\sup_{\substack{0 < \|f_{w_j}\|_F \le 1 \\ f_{w_j}(x_i) \neq 0 \\ i,j \in \{1,2,\dots,n\}}} \left( \sum_{k_1=1}^{\infty} \cdots \sum_{k_{(n-1)}=1}^{\infty} |D|^p \right)^{\frac{1}{p}} \\[12pt]&\quad \le ((n-1)!)^{\frac{1}{p}} \sup_{\substack{0 < \|f_{w_j}\|_F \le 1 \\ f_{w_j}(x_i) \neq 0 \\ i,j \in \{1,2,\dots,n\}}} \left( \frac{\displaystyle\sum_{k_1=1}^{\infty} \cdots \sum_{k_{(n-1)}=1}^{\infty} \left| \left( \sum_{k_n=1}^{\infty} w_{k_n} \begin{vmatrix} x_{1k_1} & \cdots & x_{nk_1} \\[6pt] \vdots & \ddots & \vdots \\[6pt] x_{1k_n} & \cdots & x_{nk_n} \end{vmatrix} \right) \right|^p}{(n-1)!} \right)^{\frac{1}{p}} \\[12pt]&\quad \le ((n-1)!)^{\frac{1}{p}} \|x_k|_{k=1}^n \|_{n\odot\ell^p}^I.\end{aligned} \end{document} ]]></tex-math></disp-formula><p>Next, we can express the inequality between the two definitions of the <italic>n</italic>-norms as below</p><disp-formula id="equation-33"><tex-math id="math-191"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| x _ {k} | _ {k = 1} ^ {n} \| _ {n \odot \ell^ {p}} ^ {G} \leq ((n - 1)!) ^ {\frac {1}{p}} \| x _ {k} | _ {k = 1} ^ {n} \| _ {n \odot \ell^ {p}} ^ {I}. \end{document} ]]></tex-math></disp-formula><p>Meanwhile, we recall</p><p><inline-formula><tex-math id="math-192"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{aligned}\|x_k|_{k=1}^n \|_{n\odot\ell^p}^I &= \sup_{\substack{0 < \|f_{w_n}\|_F \le 1 \\ f_{w_n}(x_i) \neq 0 \\ i \in \{1,2,\dots,n\}}} \left( \frac{\displaystyle\sum_{k_1=1}^{\infty} \cdots \sum_{k_{(n-1)}=1}^{\infty} \left| \left( \sum_{k_n=1}^{\infty} w_{nk_n} \begin{vmatrix} x_{1k_1} & \cdots & x_{nk_1} \\[6pt] \vdots & \ddots & \vdots \\[6pt] x_{1k_n} & \cdots & x_{nk_n} \end{vmatrix} \right) \right|^p}{(n-1)!} \right)^{\frac{1}{p}} \\[12pt]&= \sup_{\substack{0 < \|f_{w_n}\|_F \le 1 \\ f_{w_n}(x_i) \neq 0 \\ i \in \{1,2,\dots,n\}}} \left( \frac{\displaystyle\sum_{k_1=1}^{\infty} \cdots \sum_{k_{(n-1)}=1}^{\infty} |D|^p}{(n-1)!} \right)^{\frac{1}{p}},\end{aligned} \end{document} ]]></tex-math></inline-formula></p><p>where <inline-formula><tex-math id="math-193"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle D = \sum_{k_n=1}^{\infty} w_{nk_n} \left| \begin{array}{ccc} x_{1k_1} & \cdots & x_{nk_1} \\ \vdots & \ddots & \vdots \\ x_{1k_n} & \cdots & x_{nk_n} \end{array} \right| \end{document} ]]></tex-math></inline-formula>. By Hölder's inequality, we get</p><disp-formula id="equation-34"><tex-math id="math-194"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle |D| \le \sum_{k_n=1}^{\infty} |w_{nk_n}| \left| \begin{vmatrix}x_{1k_1} & \cdots & x_{nk_1} \\[6pt]\vdots & \ddots & \vdots \\[6pt]x_{1k_n} & \cdots & x_{nk_n}\end{vmatrix} \right| \end{document} ]]></tex-math></disp-formula><p><inline-formula><tex-math id="math-195"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{aligned}&\le \left( \sum_{k_n=1}^{\infty} |w_{nk_n}|^q \right)^{\frac{1}{q}} \left( \sum_{k_n=1}^{\infty} \left| \begin{vmatrix} x_{1k_1} & \cdots & x_{nk_1} \\[6pt] \vdots & \ddots & \vdots \\[6pt] x_{1k_n} & \cdots & x_{nk_n} \end{vmatrix} \right|^p \right)^{\frac{1}{p}} \\[12pt]&\le \left( \sum_{k_n=1}^{\infty} \left| \begin{vmatrix} x_{1k_1} & \cdots & x_{nk_1} \\[6pt] \vdots & \ddots & \vdots \\[6pt] x_{1k_n} & \cdots & x_{nk_n} \end{vmatrix} \right|^p \right)^{\frac{1}{p}}.\end{aligned} \end{document} ]]></tex-math></inline-formula></p><p>Thus,</p><disp-formula id="equation-35"><tex-math id="math-196"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|x_k|_{k=1}^n \|_{n\odot\ell^p}^I \le \sup_{\substack{0 < \|f_{w_n}\|_F \le 1 \\ f_{w_n}(x_i) \neq 0 \\ i \in \{1,2,\dots,n\}}} \left( \frac{\displaystyle\sum_{k_1=1}^{\infty} \cdots \sum_{k_{(n-1)}=1}^{\infty} \sum_{k_n=1}^{\infty} \left| \begin{vmatrix} x_{1k_1} & \cdots & x_{nk_1} \\[6pt] \vdots & \ddots & \vdots \\[6pt] x_{1k_n} & \cdots & x_{nk_n} \end{vmatrix} \right|^p}{(n-1)!} \right)^{\frac{1}{p}} \end{document} ]]></tex-math></disp-formula><p>and we obtain <inline-formula><tex-math id="math-197"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| x_k|_{k = 1}^n\|_{n\odot \ell^p}^I\leq \left(\frac{n!}{(n - 1)!}\right)^{\frac{1}{p}}\| x_k|_{k = 1}^n\|_{n\ell^p} \end{document} ]]></tex-math></inline-formula>.</p><p>Next, we combine the above inequalities. So</p><disp-formula id="equation-36"><tex-math id="math-198"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle C _ {1} \| x _ {1}, x _ {2}, \dots , x _ {n} \| _ {n \odot \ell^ {p}} ^ {G} \leq \| x _ {1}, x _ {2}, \dots , x _ {n} \| _ {n \odot \ell^ {p}} ^ {I} \leq C _ {2} \| x _ {1}, x _ {2}, \dots , x _ {n} \| _ {n \ell^ {p}} \end{document} ]]></tex-math></disp-formula><p>holds, where <inline-formula><tex-math id="math-199"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle C_{1}=\left(\frac{1}{(n-1)!}\right)^{\frac{1}{p}} \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-200"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle C_{2}=\left(\frac{n!}{(n-1)!}\right)^{\frac{1}{p}} \end{document} ]]></tex-math></inline-formula>.</p><p>The above proposition makes it easier for us to check the equivalence among three <italic>n</italic>-norms. Next, we use the symbol <inline-formula><tex-math id="math-201"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle U \sim V \end{document} ]]></tex-math></inline-formula>, which means that <inline-formula><tex-math id="math-202"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle U \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-203"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle V \end{document} ]]></tex-math></inline-formula> are equivalent.<target id="anchor-ecfd7015-1adf-4f1a-8ed1-3fb9d777fd83" target-type="reference-target"/></p><p><bold>Theorem 3.3. </bold><italic>On </italic><inline-formula><tex-math id="math-204"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^p \end{document} ]]></tex-math></inline-formula><italic>, we have</italic></p><disp-formula id="equation-37"><tex-math id="math-205"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left\| \cdot , \dots , \cdot \right\| _ {n \odot \ell^ {p}} ^ {G} \sim \left\| \cdot , \dots , \cdot \right\| _ {n \odot \ell^ {p}} ^ {I} \sim \left\| \cdot , \dots , \cdot \right\| _ {n \ell^ {p}}. \end{document} ]]></tex-math></disp-formula><p><italic>Proof</italic>. We know that the equations (4) and (8) are equivalent (see <xref ref-type="bibr" rid="BIBR-17">[17]</xref>). By checking Proposition <xref ref-type="custom" custom-type="reference-target">3.2</xref>., we conclude that <inline-formula><tex-math id="math-206"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot,\cdots,\cdot\|_{n\odot\ell^{p}}^{G},\|\cdot,\cdots,\cdot\|_{n\odot\ell^{p}}^{I} \end{document} ]]></tex-math></inline-formula>, and <inline-formula><tex-math id="math-207"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot,\cdots,\cdot\|_{n\ell^{p}} \end{document} ]]></tex-math></inline-formula> are equivalent. <target id="anchor-28af6240-169b-4db9-9990-e2c92106223a" target-type="reference-target"/></p><p><bold>Corollary 3.4. </bold><italic>Two spaces </italic><inline-formula><tex-math id="math-208"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (\ell^p, \| \cdot, \cdots, \cdot \|_{n \odot \ell^p}^G) \end{document} ]]></tex-math></inline-formula><italic> and </italic><inline-formula><tex-math id="math-209"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (\ell^p, \| \cdot, \cdots, \cdot \|_{n \odot \ell^p}^I) \end{document} ]]></tex-math></inline-formula><italic> are n-Banach spaces.</italic></p><p><italic>Proof</italic>. As shown in [<xref ref-type="bibr" rid="BIBR-2">2</xref>, <xref ref-type="bibr" rid="BIBR-18">18</xref>], <inline-formula><tex-math id="math-210"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (\ell^p, \| \cdot, \ldots, \cdot \|_{n\ell^p}) \end{document} ]]></tex-math></inline-formula> is an <italic>n</italic>-Banach space. This means that every Cauchy sequence with respect to <inline-formula><tex-math id="math-211"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| \cdot, \ldots, \cdot \|_{n\ell^p} \end{document} ]]></tex-math></inline-formula> in <inline-formula><tex-math id="math-212"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^p \end{document} ]]></tex-math></inline-formula> is convergent with respect to <inline-formula><tex-math id="math-213"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| \cdot, \ldots, \cdot \|_{n\ell^p} \end{document} ]]></tex-math></inline-formula>. Theorem <xref ref-type="custom" custom-type="reference-target" rid="anchor-ecfd7015-1adf-4f1a-8ed1-3fb9d777fd83">3.3</xref> demonstrates that</p><disp-formula id="equation-38"><tex-math id="math-214"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left\| \cdot , \dots , \cdot \right\| _ {n \odot \ell^ {p}} ^ {G} \sim \left\| \cdot , \dots , \cdot \right\| _ {n \ell^ {p}}. \end{document} ]]></tex-math></disp-formula><p>Let <inline-formula><tex-math id="math-215"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (x(m)) \end{document} ]]></tex-math></inline-formula> in <inline-formula><tex-math id="math-216"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^{p} \end{document} ]]></tex-math></inline-formula> be a Cauchy sequence with respect to <inline-formula><tex-math id="math-217"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| \cdot, \ldots, \cdot \|_{n \odot \ell^{p}}^{G} \end{document} ]]></tex-math></inline-formula>. So for every <inline-formula><tex-math id="math-218"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v_{1}, v_{2}, \cdots, v_{(n-1)} \in \ell^{p} \end{document} ]]></tex-math></inline-formula>, we have</p><disp-formula id="equation-39"><tex-math id="math-219"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left\| v _ {1}, \dots , v _ {(n - 1)}, x (m _ {1}) - x (m _ {2}) \right\| _ {n \ell^ {p}} \sim \left\| v _ {1}, \dots , v _ {(n - 1)}, x (m _ {1}) - x (m _ {2}) \right\| _ {n \odot \ell^ {p}} ^ {G} \rightarrow 0 \end{document} ]]></tex-math></disp-formula><p>,</p><p>as <inline-formula><tex-math id="math-220"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle m_{1}, m_{2} \to \infty \end{document} ]]></tex-math></inline-formula>. It means that this sequence becomes a Cauchy sequence with respect to <inline-formula><tex-math id="math-221"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot, \ldots, \cdot\|_{n\ell^{p}} \end{document} ]]></tex-math></inline-formula>. Since <inline-formula><tex-math id="math-222"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (\ell^{p}, \|\cdot, \ldots, \cdot\|_{n\ell^{p}}) \end{document} ]]></tex-math></inline-formula> is an <italic>n</italic>-Banach space, then this sequence is also convergent with respect to <inline-formula><tex-math id="math-223"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot, \ldots, \cdot\|_{n\ell^{p}} \end{document} ]]></tex-math></inline-formula>. Furthermore, since</p><disp-formula id="equation-40"><tex-math id="math-224"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left\| \cdot , \dots , \cdot \right\| _ {n \odot \ell^ {p}} ^ {G} \sim \left\| \cdot , \dots , \cdot \right\| _ {n \ell^ {p}}, \end{document} ]]></tex-math></disp-formula><p>then we can conclude that <inline-formula><tex-math id="math-225"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (x(m)) \end{document} ]]></tex-math></inline-formula> is also convergent with respect to <inline-formula><tex-math id="math-226"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| \cdot ,\ldots ,\cdot \|_{n\odot \ell^p}^G \end{document} ]]></tex-math></inline-formula>.</p><p>Next, in this part, we apply a similar argument to Cauchy sequences with respect to <inline-formula><tex-math id="math-227"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| \cdot ,\ldots ,\cdot \|_{n\odot \ell^p}^I \end{document} ]]></tex-math></inline-formula>. By Theorem <xref ref-type="custom" custom-type="reference-target" rid="anchor-ecfd7015-1adf-4f1a-8ed1-3fb9d777fd83">3.3</xref>, which states that</p><disp-formula id="equation-41"><tex-math id="math-228"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left\| \cdot , \dots , \cdot \right\| _ {n \odot \ell^ {p}} ^ {I} \sim \left\| \cdot , \dots , \cdot \right\| _ {n \ell^ {p}}, \end{document} ]]></tex-math></disp-formula><p>we therefore conclude that the sequence is convergent with respect to <inline-formula><tex-math id="math-229"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot,\ldots,\cdot\|_{n\odot\ell^{p}}^{I} \end{document} ]]></tex-math></inline-formula>.</p><p>Hence, as a result, <inline-formula><tex-math id="math-230"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (\ell^p,\| \cdot ,\dots ,\cdot \|_{n\odot \ell^p}^G) \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-231"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (\ell^p,\| \cdot ,\dots ,\cdot \|_{n\odot \ell^p}^I) \end{document} ]]></tex-math></inline-formula> are <italic>n</italic>-Banach spaces.</p></sec><sec id="sec-5"><title>3.2. Relationship Between Norms And n-norms.</title><p>In the study of <inline-formula><tex-math id="math-232"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^{p} \end{document} ]]></tex-math></inline-formula>, researchers so far defined a norm induced by the <italic>n</italic>-norm. In 2000 <xref ref-type="bibr" rid="BIBR-2">[2]</xref>, Gunawan related the usual type (norm and <italic>n</italic>-norm) and he refined it in 2013 (see <xref ref-type="bibr" rid="BIBR-13">[13]</xref>). Take fixed linearly independent vectors <inline-formula><tex-math id="math-233"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a_{1}, a_{2}, \cdots, a_{n} \in \ell^{p} \end{document} ]]></tex-math></inline-formula> and we recall the definition of norm in <xref ref-type="bibr" rid="BIBR-13">[13]</xref>, that is,</p><disp-formula id="equation-42"><tex-math id="math-234"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| x \| _ {\circ \ell^ {p}} ^ {H} := \left(\sum_ {\{k _ {1}, k _ {2}, \dots , k _ {(n - 1)} \} \subset \{1, 2, \dots , n \}} \| a _ {k _ {1}}, a _ {k _ {2}}, \dots , a _ {k _ {(n - 1)}}, x \| _ {n \ell^ {p}} ^ {p}\right) ^ {\frac {1}{p}}\tag{12} \end{document} ]]></tex-math></disp-formula><p>for every <inline-formula><tex-math id="math-235"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in \ell^{p} \end{document} ]]></tex-math></inline-formula>. His investigation showed that the norm <inline-formula><tex-math id="math-236"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot\|_{\circ\ell^{p}}^{H} \end{document} ]]></tex-math></inline-formula> induced by the usual <italic>n</italic>-norm is actually equivalent to the usual norm (see <xref ref-type="bibr" rid="BIBR-13">[13]</xref>). In this context, he could verify the convergence of a sequence <inline-formula><tex-math id="math-237"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x(m) \end{document} ]]></tex-math></inline-formula> to <inline-formula><tex-math id="math-238"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \end{document} ]]></tex-math></inline-formula> in <inline-formula><tex-math id="math-239"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (\ell^{p}, \|\cdot,\cdots,\cdot\|_{n\ell^{p}}) \end{document} ]]></tex-math></inline-formula> by selecting a fixed set of <italic>n</italic> linearly independent vectors <inline-formula><tex-math id="math-240"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \{a_{1}, a_{2}, \ldots, a_{n}\} \subset \ell^{p} \end{document} ]]></tex-math></inline-formula>. So, for every subset <inline-formula><tex-math id="math-241"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \{k_{1}, k_{2}, \ldots, k_{(n-1)}\} \subset \{1, 2, \ldots, n\} \end{document} ]]></tex-math></inline-formula>, the condition</p><disp-formula id="equation-43"><tex-math id="math-242"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left\| a _ {k _ {1}}, a _ {k _ {2}}, \dots , a _ {k _ {(n - 1)}}, x (m) - x \right\| _ {n \ell^ {p}} \rightarrow 0 \end{document} ]]></tex-math></disp-formula><p>holds as <inline-formula><tex-math id="math-243"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle m \to \infty \end{document} ]]></tex-math></inline-formula>. A similar approach can also be used to examine whether a sequence is Cauchy in <inline-formula><tex-math id="math-244"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (\ell^{p}, \| \cdot, \cdots, \cdot \|_{n\ell^{p}}) \end{document} ]]></tex-math></inline-formula>.</p><p>Here, we will define two new norms induced by <inline-formula><tex-math id="math-245"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot,\cdots,\cdot\|_{n\odot\ell^{p}}^{G} \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-246"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot,\cdots,\cdot\|_{n\odot\ell^{p}}^{I} \end{document} ]]></tex-math></inline-formula>, these are</p><disp-formula id="equation-44"><tex-math id="math-247"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| x \| _ {\odot \ell^ {p}} ^ {G} := \sum_ {\{k _ {1}, k _ {2}, \dots , k _ {(n - 1)} \} \subset \{1, 2, \dots , n \}} \| a _ {k _ {1}}, a _ {k _ {2}}, \dots , a _ {k _ {(n - 1)}}, x \| _ {n \odot \ell^ {p}} ^ {G}\tag{13} \end{document} ]]></tex-math></disp-formula><disp-formula id="equation-45"><tex-math id="math-248"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| x \| _ {\odot \ell^ {p}} ^ {I} := \sum_ {\{k _ {1}, k _ {2}, \dots , k _ {(n - 1)} \} \subset \{1, 2, \dots , n \}} \| a _ {k _ {1}}, a _ {k _ {2}}, \dots , a _ {k _ {(n - 1)}}, x \| _ {n \odot \ell^ {p}} ^ {I},\tag{14} \end{document} ]]></tex-math></disp-formula><p>for every <inline-formula><tex-math id="math-249"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in \ell^p \end{document} ]]></tex-math></inline-formula>. The relationship between the two norm definitions and the usual norm in <inline-formula><tex-math id="math-250"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^p \end{document} ]]></tex-math></inline-formula> will be examined. The following theorem explains it.<target id="anchor-1cc708b7-e3be-45ff-9a13-03333c4c527e" target-type="reference-target"/></p><p><bold>Theorem 3.5. </bold><italic>On </italic><inline-formula><tex-math id="math-251"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^p \end{document} ]]></tex-math></inline-formula><italic> with </italic><inline-formula><tex-math id="math-252"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle p \geq 1 \end{document} ]]></tex-math></inline-formula><italic>, we have</italic></p><disp-formula id="equation-46"><tex-math id="math-253"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left\| \cdot \right\| _ {\odot \ell^ {p}} ^ {G} \sim \left\| \cdot \right\| _ {\odot \ell^ {p}} ^ {I} \sim \left\| \cdot \right\| _ {\ell^ {p}}. \end{document} ]]></tex-math></disp-formula><p><italic>Proof</italic>. Let <inline-formula><tex-math id="math-254"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle p \geq 1 \end{document} ]]></tex-math></inline-formula>. For <inline-formula><tex-math id="math-255"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_{1}, \alpha_{2}, \ldots, \alpha_{n} > 0 \end{document} ]]></tex-math></inline-formula>, we have the following:</p><disp-formula id="equation-47"><tex-math id="math-256"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \frac {\left(\alpha_ {1} + \cdots + \alpha_ {n}\right)}{n ^ {1 - \frac {1}{p}}} \leq \left(\alpha_ {1} ^ {p} + \dots + \alpha_ {n} ^ {p}\right) ^ {\frac {1}{p}} \leq \left(\alpha_ {1} + \dots + \alpha_ {n}\right).\tag{15} \end{document} ]]></tex-math></disp-formula><p>From Theorem <xref ref-type="custom" custom-type="reference-target" rid="anchor-ecfd7015-1adf-4f1a-8ed1-3fb9d777fd83">3.3</xref>, we know that</p><disp-formula id="equation-48"><tex-math id="math-257"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| \cdot , \dots , \cdot \| _ {n \odot \ell^ {p}} ^ {G} \sim \| \cdot , \dots , \cdot \| _ {n \ell^ {p}}. \end{document} ]]></tex-math></disp-formula><p>Take a fixed set of linearly independent vectors <inline-formula><tex-math id="math-258"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \{a_1, a_2, \ldots, a_n\} \subset \ell^p \end{document} ]]></tex-math></inline-formula>, so for every <inline-formula><tex-math id="math-259"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in \ell^p \end{document} ]]></tex-math></inline-formula>, we have</p><disp-formula id="equation-49"><tex-math id="math-260"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \sum_{\{k_1,\dots,k_{(n-1)}\}\subset\{1,\dots,n\}} \|a_{k_1}, \dots, a_{k_{n-1}}, x\|_{n\odot\ell^p}^G \sim \sum_{\{k_1,\dots,k_{(n-1)}\}\subset\{1,\dots,n\}} \|a_{k_1}, \dots, a_{k_{n-1}}, x\|_{n\ell^p} \end{document} ]]></tex-math></disp-formula><p>By the inequality in (15), we also have</p><disp-formula id="equation-50"><tex-math id="math-261"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \sum_ {\{k _ {1}, \ldots , k _ {(n - 1)} \} \subset \{1, \ldots , n \}} \| a _ {k _ {1}}, \ldots , a _ {k _ {n - 1}}, x \| _ {n \ell^ {p}} \sim \left(\sum_ {\{k _ {1}, \ldots , k _ {(n - 1)} \} \subset \{1, \ldots , n \}} \| a _ {k _ {1}}, \ldots , a _ {k _ {n - 1}}, x \| _ {n \ell^ {p}} ^ {p}\right) ^ {\frac {1}{p}}. \end{document} ]]></tex-math></disp-formula><p>This shows that <inline-formula><tex-math id="math-262"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| \cdot \|_{\odot \ell^p}^G \sim \| \cdot \|_{\circ \ell^p}^H \end{document} ]]></tex-math></inline-formula>.</p><p>We also have <inline-formula><tex-math id="math-263"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot,\ldots,\cdot\|_{n\odot\ell^{p}}^{I}\sim\|\cdot,\ldots,\cdot\|_{n\ell^{p}} \end{document} ]]></tex-math></inline-formula>. By proceeding in a similar manner as above, we further obtain <inline-formula><tex-math id="math-264"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot\|_{\odot\ell^{p}}^{I}\sim\|\cdot\|_{\circ\ell^{p}}^{H} \end{document} ]]></tex-math></inline-formula>. Since <inline-formula><tex-math id="math-265"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot\|_{\ell^{p}}\sim\|\cdot\|_{\circ\ell^{p}}^{H} \end{document} ]]></tex-math></inline-formula>, then the norms <inline-formula><tex-math id="math-266"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot\|_{\odot\ell^{p}}^{G} \end{document} ]]></tex-math></inline-formula>, <inline-formula><tex-math id="math-267"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot\|_{\odot\ell^{p}}^{I} \end{document} ]]></tex-math></inline-formula>, and <inline-formula><tex-math id="math-268"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot\|_{\ell^{p}} \end{document} ]]></tex-math></inline-formula> are equivalent.</p><p>We now have four definitions of norms based on the equations (1), (7), (13), and (14), all of which describe equivalent norms. As a result, the properties of the usual norm on <inline-formula><tex-math id="math-269"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^p \end{document} ]]></tex-math></inline-formula> are also valid for the space when equipped with any of the other three norms. As noted in <xref ref-type="bibr" rid="BIBR-1">[1]</xref>, the <inline-formula><tex-math id="math-270"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^p \end{document} ]]></tex-math></inline-formula> with the usual norm is a Banach space, meaning that it is complete. Since the norms <inline-formula><tex-math id="math-271"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| \cdot \|_{\ell^p} \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-272"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| \cdot \|_{(f_w)\ell^p} \end{document} ]]></tex-math></inline-formula> are equivalent, every Cauchy sequence in <inline-formula><tex-math id="math-273"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (\ell^p,\| \cdot \|_{(f_w)\ell^p}) \end{document} ]]></tex-math></inline-formula> is guaranteed to converge. Therefore, <inline-formula><tex-math id="math-274"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (\ell^p,\| \cdot \|_{(f_w)\ell^p}) \end{document} ]]></tex-math></inline-formula> is also a complete space. Based on the equivalence of norms and following a similar reasoning, it is clear that both <inline-formula><tex-math id="math-275"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (\ell^p,\| \cdot \|_{\odot \ell^p}^G) \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-276"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (\ell^p,\| \cdot \|_{\odot \ell^p}^I) \end{document} ]]></tex-math></inline-formula> are complete spaces, or Banach spaces. The next theorem discusses the <inline-formula><tex-math id="math-277"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^p \end{document} ]]></tex-math></inline-formula> space equipped with the norm induced by an <italic>n</italic>-norm.<target id="anchor-f1a79b32-cd16-4004-83bc-77b31de0925a" target-type="reference-target"/></p><p><bold>Corollary 3.6. </bold><italic>The spaces </italic><inline-formula><tex-math id="math-278"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (\ell^p, \| \cdot \|_{\odot \ell^p}^G) \end{document} ]]></tex-math></inline-formula><italic> and </italic><inline-formula><tex-math id="math-279"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (\ell^p, \| \cdot \|_{\odot \ell^p}^I) \end{document} ]]></tex-math></inline-formula><italic> are Banach spaces.</italic></p><p><italic>Proof</italic>. Let <inline-formula><tex-math id="math-280"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (x(m)) \end{document} ]]></tex-math></inline-formula> be a sequence in <inline-formula><tex-math id="math-281"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^p \end{document} ]]></tex-math></inline-formula> that is Cauchy with respect to the norm <inline-formula><tex-math id="math-282"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| \cdot \|_{\odot \ell^p}^G \end{document} ]]></tex-math></inline-formula>. According to Theorem <xref ref-type="custom" custom-type="reference-target" rid="anchor-1cc708b7-e3be-45ff-9a13-03333c4c527e">3.5</xref>, we have <inline-formula><tex-math id="math-283"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| \cdot \|_{\odot \ell^p}^G \sim \| \cdot \|_{\ell^p} \end{document} ]]></tex-math></inline-formula>, meaning that <inline-formula><tex-math id="math-284"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (x(m)) \end{document} ]]></tex-math></inline-formula> is also a Cauchy sequence with respect to the norm <inline-formula><tex-math id="math-285"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| \cdot \|_{\ell^p} \end{document} ]]></tex-math></inline-formula>. Since <inline-formula><tex-math id="math-286"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (\ell^p, \| \cdot \|_{\ell^p}) \end{document} ]]></tex-math></inline-formula> is a Banach space, the sequence <inline-formula><tex-math id="math-287"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (x(m)) \end{document} ]]></tex-math></inline-formula> converges with respect to the norm <inline-formula><tex-math id="math-288"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| \cdot \|_{\ell^p} \end{document} ]]></tex-math></inline-formula>.</p><p>By Theorem <xref ref-type="custom" custom-type="reference-target" rid="anchor-1cc708b7-e3be-45ff-9a13-03333c4c527e">3.5</xref> again, we conclude that <inline-formula><tex-math id="math-289"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (x(m)) \end{document} ]]></tex-math></inline-formula> also converges with respect to the norm <inline-formula><tex-math id="math-290"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| \cdot \|_{\odot \ell^p}^G \end{document} ]]></tex-math></inline-formula>.</p><p>Similarly, using the fact that <inline-formula><tex-math id="math-291"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot\|_{\odot\ell^{p}}^{I}\sim\|\cdot\|_{\ell^{p}} \end{document} ]]></tex-math></inline-formula> as stated in Theorem <xref ref-type="custom" custom-type="reference-target" rid="anchor-1cc708b7-e3be-45ff-9a13-03333c4c527e">3.5</xref>, we can show that if <inline-formula><tex-math id="math-292"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (x(m)) \end{document} ]]></tex-math></inline-formula> is Cauchy with respect to the norm <inline-formula><tex-math id="math-293"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot\|_{\odot\ell^{p}}^{I} \end{document} ]]></tex-math></inline-formula>, then it must also converge with respect to the norm <inline-formula><tex-math id="math-294"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot\|_{\odot\ell^{p}}^{I} \end{document} ]]></tex-math></inline-formula>.</p><p>Therefore, both <inline-formula><tex-math id="math-295"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (\ell^p, \| \cdot \|_{\odot \ell^p}^G) \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-296"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (\ell^p, \| \cdot \|_{\odot \ell^p}^I) \end{document} ]]></tex-math></inline-formula> are Banach spaces.</p></sec></sec><sec id="sec-6"><title>4. FURTHER RESULTS</title><p>From the above discussions and previous studies, it is clear that inducing a norm from the <italic>n</italic>-norm can be done effectively. Now, we also need to attempt to induce an <italic>n</italic>-norm from a norm on <inline-formula><tex-math id="math-297"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^{p} \end{document} ]]></tex-math></inline-formula>. Konca and Idris have defined the 2-norm from the norm (see [<xref ref-type="bibr" rid="BIBR-15">15</xref>, <xref ref-type="bibr" rid="BIBR-16">16</xref>]). Furthermore, the above definition shows the induction of the <italic>n</italic>-norm from the <inline-formula><tex-math id="math-298"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (n-1) \end{document} ]]></tex-math></inline-formula>-norm. In the last section, we can define the <italic>n</italic>-norm recursively based on the norm.</p><p>Taking arbitrary <inline-formula><tex-math id="math-299"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x_{1}, x_{2}, \cdots, x_{n} \in \ell^{p} \end{document} ]]></tex-math></inline-formula>, we define 2-norm</p><p><inline-formula><tex-math id="math-300"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{aligned}\|x_1, x_2\|_{2\bullet\ell^p}^I &:= \|x_1, x_2\|_{2\odot\ell^p}^I \\[6pt]&= \sup_{\substack{0 < \|f_{w_2}\|_F \le 1 \\ f_{w_2}(x_i) \neq 0 \\ i \in \{1,2\}}} |f_{w_2}(x_2)| \left\| x_1 - x_2 \frac{f_{w_2}(x_1)}{f_{w_2}(x_2)} \right\|_{\ell^p} \\[12pt]&= \sup_{\substack{0 < \|f_{w_2}\|_F \le 1 \\ f_{w_2}(x_i) \neq 0 \\ i \in \{1,2\}}} \left( \sum_{k_1=1}^{\infty} \left| \left( \sum_{k_2=1}^{\infty} w_{2k_2} \begin{vmatrix} x_{1k_1} & x_{2k_1} \\[6pt] x_{1k_2} & x_{2k_2} \end{vmatrix} \right) \right|^p \right)^{\frac{1}{p}}.\end{aligned} \end{document} ]]></tex-math></inline-formula></p><p>Next, we define 3-norm</p><disp-formula id="equation-51"><tex-math id="math-301"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| x_{1},x_{2},x_{3}\|_{3\bullet \ell^{p}}^{I}:= \sup_{\substack{0 < \left\| f_{w_{3}}\right\|_{F}\leq 1\\ f_{w_{3}}(x_{i})\neq 0\\ i\in \{1,2,3\}}} |f_{w_{3}}(x_{3})|\left\| x_{1} - x_{3}\frac{f_{w_{3}}(x_{1})}{f_{w_{3}}(x_{3})},x_{2} - x_{3}\frac{f_{w_{3}}(x_{2})}{f_{w_{3}}(x_{3})}\right\|_{2\bullet \ell^{p}}^{I} \end{document} ]]></tex-math></disp-formula><p>Using Laplace expansion, verify that</p><disp-formula id="equation-52"><tex-math id="math-302"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{array}{l} | f _ {w _ {3}} (x _ {3}) | \| x _ {1} - x _ {3} \frac {f _ {w _ {3}} (x _ {1})}{f _ {w _ {3}} (x _ {3})}, x _ {2} - x _ {3} \frac {f _ {w _ {3}} (x _ {2})}{f _ {w _ {3}} (x _ {3})} \| _ {2 ^ {\bullet \ell^ {p}}} ^ {I} \\ = | f _ {w _ {3}} (x _ {3}) | \end{array} \end{document} ]]></tex-math></disp-formula><disp-formula id="equation-53"><tex-math id="math-303"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{aligned}&\quad \times \sup_{\substack{0 < \|f_{w_2}\|_F \le 1 \\ , f_{w_2}(x_i) \neq 0 \\ i \in \{1,2\}}} \left( \sum_{k_1=1}^{\infty} \left| \left( \sum_{k_2=1}^{\infty} w_{2k_2} \begin{vmatrix} x_{1k_1} - x_{3k_1} \frac{f_{w_3}(x_1)}{f_{w_3}(x_3)} & x_{2k_1} - x_{3k_1} \frac{f_{w_3}(x_2)}{f_{w_3}(x_3)} \\[8pt] x_{1k_2} - x_{3k_2} \frac{f_{w_3}(x_1)}{f_{w_3}(x_3)} & x_{2k_2} - x_{3k_2} \frac{f_{w_3}(x_2)}{f_{w_3}(x_3)} \end{vmatrix} \right) \right|^p \right)^{\frac{1}{p}} \\[12pt]&= \sup_{\substack{0 < \|f_{w_2}\|_F \le 1 \\ , f_{w_2}(x_i) \neq 0 \\ i \in \{1,2\}}} \left( \sum_{k_1=1}^{\infty} \left| \left( \sum_{k_2=1}^{\infty} w_{2k_2} \begin{vmatrix} x_{1k_1} & x_{2k_1} & x_{3k_1} \\[6pt] x_{1k_2} & x_{2k_2} & x_{3k_2} \\[6pt] f_{w_3}(x_1) & f_{w_3}(x_2) & f_{w_3}(x_3) \end{vmatrix} \right) \right|^p \right)^{\frac{1}{p}} \\[12pt]&= \sup_{\substack{0 < \|f_{w_2}\|_F \le 1 \\ , f_{w_2}(x_i) \neq 0 \\ i \in \{1,2\}}} \left( \sum_{k_1=1}^{\infty} \left| \left( \sum_{k_2=1}^{\infty} \sum_{k_3=1}^{\infty} w_{2k_2} w_{3k_3} \begin{vmatrix} x_{1k_1} & x_{2k_1} & x_{3k_1} \\[6pt] x_{1k_2} & x_{2k_2} & x_{3k_2} \\[6pt] x_{1k_3} & x_{2k_3} & x_{3k_3} \end{vmatrix} \right) \right|^p \right)^{\frac{1}{p}}.\end{aligned} \end{document} ]]></tex-math></disp-formula><p>Now, we have</p><disp-formula id="equation-54"><tex-math id="math-304"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| x_{1},x_{2},x_{3}\|_{3\bullet \ell^{p}}^{I} = \sup_{\substack{0 < \left\| f_{w_{j}}\right\|_{F}\leq 1\\ ,f_{w_{j}}(x_{i})\neq 0\\ i\in \{1,2,3\} \\ j\in \{2,3\}}}\left(\sum_{k_{1} = 1}^{\infty}\left|\left(\sum_{k_{2} = 1}^{\infty}\sum_{k_{3} = 1}^{\infty}w_{2k_{2}}w_{3k_{3}}\left| \begin{array}{ccc}x_{1k_{1}} & x_{2k_{1}} & x_{3k_{1}}\\ x_{1k_{2}} & x_{2k_{2}} & x_{3k_{2}}\\ x_{1k_{3}} & x_{2k_{3}} & x_{3k_{3}} \end{array} \right|\right)\right|^{p}\right)^{\frac{1}{p}}. \end{document} ]]></tex-math></disp-formula><p>Repeat by defining the 4-norm up to the <inline-formula><tex-math id="math-305"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (n - 1) \end{document} ]]></tex-math></inline-formula>-norm and the last, we get the definition of the <italic>n</italic>-norm</p><disp-formula id="equation-55"><tex-math id="math-306"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{aligned}\|x_k|_{k=1}^n \|_{n\bullet\ell^p}^I &:= \sup_{\substack{0 < \|f_{w_n}\|_F \le 1 \\ f_{w_n}(x_i) \neq 0 \\ i \in \{1,2,\dots,n\}}} |f_{w_n}(x_n)| \left\| x_k - x_n \frac{f_{w_n}(x_k)}{f_{w_n}(x_n)} \bigg|_{k=1}^{(n-1)} \right\|_{(n-1)\bullet\ell^p}^I \\[12pt]&= \sup_{\substack{0 < \|f_{w_j}\|_F \le 1 \\ f_{w_j}(x_i) \neq 0 \\ i \in \{1,\dots,n\} \\ j \in \{2,\dots,n\}}} \left( \sum_{k_1=1}^{\infty} \left| \left( \sum_{k_2=1}^{\infty} \cdots \sum_{k_n=1}^{\infty} w_{2k_2} \cdots w_{nk_n} \begin{vmatrix} x_{1k_1} & x_{2k_1} & \cdots & x_{nk_1} \\[6pt] x_{1k_2} & x_{2k_2} & \cdots & x_{nk_2} \\[6pt] \vdots & \vdots & \ddots & \vdots \\[6pt] x_{1k_n} & x_{2k_n} & \cdots & x_{nk_n} \end{vmatrix} \right) \right|^p \right)^{\frac{1}{p}}.\end{aligned} \end{document} ]]></tex-math></disp-formula><p>Interestingly, we also examine the relationship between <inline-formula><tex-math id="math-307"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \|\cdot,\ldots,\cdot\|_{n\bullet\ell^{p}}^{I} \end{document} ]]></tex-math></inline-formula> and other <italic>n</italic>-norms mentioned above.<target id="anchor-77497287-a2ad-417b-8130-f35eb23ae5f4" target-type="reference-target"/></p><p><bold>Proposition 4.1. </bold><italic>Let </italic><inline-formula><tex-math id="math-308"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle p \geq 1 \end{document} ]]></tex-math></inline-formula><italic>. We have an inequality</italic></p><disp-formula id="equation-56"><tex-math id="math-309"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| x _ {k} | _ {k = 1} ^ {n} \| _ {n \odot \ell^ {p}} ^ {G} \leq \| x _ {k} | _ {k = 1} ^ {n} \| _ {n \bullet \ell^ {p}} ^ {I} \leq A _ {1} \| x _ {k} | _ {k = 1} ^ {n} \| _ {n \odot \ell^ {p}} ^ {I} \leq A _ {2} \| x _ {k} | _ {k = 1} ^ {n} \| _ {n \ell^ {p}}, \end{document} ]]></tex-math></disp-formula><p>for every <inline-formula><tex-math id="math-310"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x_{1}, x_{2}, \cdots, x_{n} \in \ell^{p} \end{document} ]]></tex-math></inline-formula> with <inline-formula><tex-math id="math-311"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A_{1} = (n - 1)!)^{\frac{1}{p}} \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-312"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A_{2} = (n!)^{\frac{1}{p}} \end{document} ]]></tex-math></inline-formula>.</p><p><italic>Proof</italic>. Recall (8). For arbitrary <inline-formula><tex-math id="math-313"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x_{1}, x_{2}, \cdots, x_{n} \in \ell^{p} \end{document} ]]></tex-math></inline-formula>, we have</p><disp-formula id="equation-57"><tex-math id="math-314"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{aligned}\|x_k|_{k=1}^n \|_{n\odot\ell^p}^G &= \sup_{\substack{0 < \|f_{w_j}\|_F \le 1 \\ , f_{w_j}(x_i) \neq 0 \\ i,j \in \{1,2,\dots,n\}}} \sum_{k_1=1}^{\infty} \sum_{k_2=1}^{\infty} \cdots \sum_{k_n=1}^{\infty} w_{1k_1} w_{2k_2} \cdots w_{nk_n} \begin{vmatrix} x_{1k_1} & \cdots & x_{nk_1} \\[6pt] \vdots & \ddots & \vdots \\[6pt] x_{1k_n} & \cdots & x_{nk_n} \end{vmatrix} \\[12pt]&= \sup_{\substack{0 < \|f_{w_j}\|_F \le 1 \\ , f_{w_j}(x_i) \neq 0 \\ i,j \in \{1,2,\dots,n\}}} \sum_{k_1=1}^{\infty} w_{1k_1} E,\end{aligned} \end{document} ]]></tex-math></disp-formula><p>where <inline-formula><tex-math id="math-315"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle E = \sum_{k_{2}=1}^{\infty} \cdots \sum_{k_{n}=1}^{\infty} w_{2k_{2}} \cdots w_{nk_{n}} \left| \begin{array}{ccc} x_{1k_{1}} & \cdots & x_{nk_{1}} \\ \vdots & \ddots & \vdots \\ x_{1k_{n}} & \cdots & x_{nk_{n}} \end{array} \right| \end{document} ]]></tex-math></inline-formula>. By Hölder's inequality, we obtain</p><disp-formula id="equation-58"><tex-math id="math-316"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{aligned}&\|x_k|_{k=1}^n \|_{n\odot\ell^p}^G \\[8pt]&\quad \le \sup_{\substack{0 < \|f_{w_j}\|_F \le 1 \\ , f_{w_j}(x_i) \neq 0 \\ i,j \in \{1,2,\dots,n\}}} \left( \sum_{k_1=1}^{\infty} |E|^p \right)^{\frac{1}{p}} \left( \sum_{k_1=1}^{\infty} |w_{1k_1}|^q \right)^{\frac{1}{q}} \\[12pt]&\quad \le \sup_{\substack{0 < \|f_{w_j}\|_F \le 1 \\ f_{w_j}(x_i) \neq 0 \\ i \in \{1,\dots,n\} \\ j \in \{2,\dots,n\}}} \left( \sum_{k_1=1}^{\infty} \left| \left( \sum_{k_2=1}^{\infty} \cdots \sum_{k_n=1}^{\infty} w_{2k_2} \cdots w_{nk_n} \begin{vmatrix} x_{1k_1} & x_{2k_1} & \cdots & x_{nk_1} \\[6pt] x_{1k_2} & x_{2k_2} & \cdots & x_{nk_2} \\[6pt] \vdots & \vdots & \ddots & \vdots \\[6pt] x_{1k_n} & x_{2k_n} & \cdots & x_{nk_n} \end{vmatrix} \right) \right|^p \right)^{\frac{1}{p}} \\[12pt]&\quad = \|x_k|_{k=1}^n \|_{n\bullet\ell^p}^I.\end{aligned} \end{document} ]]></tex-math></disp-formula><p>Observe also that, by the triangle inequality and Hölder's inequality,</p><disp-formula id="equation-59"><tex-math id="math-317"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{aligned}|E| &\le \sum_{k_2=1}^{\infty} \cdots \sum_{k_{(n-1)}=1}^{\infty} |w_{2k_2}| \cdots |w_{(n-1)k_{(n-1)}}| |D| \\[8pt]&\le \left( \sum_{k_2=1}^{\infty} \cdots \sum_{k_{(n-1)}=1}^{\infty} \left( |w_{2k_2}| \cdots |w_{(n-1)k_{(n-1)}}| \right)^q \right)^{\frac{1}{q}} \left( \sum_{k_2=1}^{\infty} \cdots \sum_{k_{(n-1)}=1}^{\infty} |D|^p \right)^{\frac{1}{p}} \\[8pt]&\le \left( \sum_{k_2=1}^{\infty} \cdots \sum_{k_{(n-1)}=1}^{\infty} |D|^p \right)^{\frac{1}{p}}.\end{aligned} \end{document} ]]></tex-math></disp-formula><p>holds, where <inline-formula><tex-math id="math-318"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle D = \sum_{k_{n}=1}^{\infty} w_{nk_{n}} \left| \begin{array}{cccc} x_{1k_{1}} & x_{2k_{1}} & \cdots & x_{nk_{1}} \\ x_{1k_{2}} & x_{2k_{2}} & \cdots & x_{nk_{2}} \\ \vdots & \vdots & \ddots & \vdots \\ x_{1k_{n}} & x_{2k_{n}} & \cdots & x_{nk_{n}} \end{array} \right| \end{document} ]]></tex-math></inline-formula>. As a result,</p><disp-formula id="equation-60"><tex-math id="math-319"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| x_{k}|_{k = 1}^{n}\|_{n\bullet \ell^{p}}^{I} = \sup_{\substack{0 < \| f_{w_{j}}\|_{F}\leq 1\\ f_{w_{j}}(x_{i})\neq 0\\ i\in \{1,\dots ,n\} \\ j\in \{2,\dots ,n\}}}\left(\sum_{k_{1} = 1}^{\infty}|E|^{p}\right)^{\frac{1}{p}}\leq \sup_{\substack{0 < \| f_{w_{j}}\|_{F}\leq 1\\ f_{w_{j}}(x_{i})\neq 0\\ i\in \{1,\dots ,n\} \\ j\in \{2,\dots ,n\}}}\left(\sum_{k_{1} = 1}^{\infty}\sum_{k_{2} = 1}^{\infty}\dots \sum_{k_{(n - 1)} = 1}^{\infty}|D|^{p}\right)^{\frac{1}{p}}. \end{document} ]]></tex-math></disp-formula><p>Moreover, it can be observed that</p><disp-formula id="equation-61"><tex-math id="math-320"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{aligned}&\sup_{\substack{0 < \|f_{w_j}\|_F \le 1 \\ f_{w_j}(x_i) \neq 0 \\ i \in \{1,\dots,n\} \\ j \in \{2,\dots,n\}}} \left( \sum_{k_1=1}^{\infty} \cdots \sum_{k_{(n-1)}=1}^{\infty} |D|^p \right)^{\frac{1}{p}} \\[12pt]&= \sup_{\substack{0 < \|f_{w_j}\|_F \le 1 \\ f_{w_j}(x_i) \neq 0 \\ i \in \{1,\dots,n\} \\ j \in \{2,\dots,n\}}} \left( \frac{\displaystyle\sum_{k_1=1}^{\infty} \cdots \sum_{k_{(n-1)}=1}^{\infty} \left| \left( \sum_{k_n=1}^{\infty} w_{nk_n} \begin{vmatrix} x_{1k_1} & \cdots & x_{nk_1} \\[6pt] \vdots & \ddots & \vdots \\[6pt] x_{1k_n} & \cdots & x_{nk_n} \end{vmatrix} \right) \right|^p}{(n-1)!} \right)^{\frac{1}{p}} \\[6pt]&\quad \times ((n-1)!)^{\frac{1}{p}} \\[12pt]&= ((n-1)!)^{\frac{1}{p}} \|x_k|_{k=1}^n \|_{n\odot\ell^p}^I \le (n!)^{\frac{1}{p}} \|x_k|_{k=1}^n \|_{n\ell^p}.\end{aligned} \end{document} ]]></tex-math></disp-formula><p>So, we have</p><disp-formula id="equation-62"><tex-math id="math-321"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| x _ {k} | _ {k = 1} ^ {n} \| _ {n \bullet \ell^ {p}} ^ {I} \leq ((n - 1)!) ^ {\frac {1}{p}} \| x _ {k} | _ {k = 1} ^ {n} \| _ {n \odot \ell^ {p}} ^ {I} \leq (n!) ^ {\frac {1}{p}} \| x _ {k} | _ {k = 1} ^ {n} \| _ {n \ell^ {p}}. \end{document} ]]></tex-math></disp-formula><p>Accordingly, the four definitions of n-norms give rise to an inequality</p><disp-formula id="equation-63"><tex-math id="math-322"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| x _ {k} | _ {k = 1} ^ {n} \| _ {n \odot \ell^ {p}} ^ {G} \leq \| x _ {k} | _ {k = 1} ^ {n} \| _ {n \bullet \ell^ {p}} ^ {I} \leq ((n - 1)!) ^ {\frac {1}{p}} \| x _ {k} | _ {k = 1} ^ {n} \| _ {n \odot \ell^ {p}} ^ {I} \leq (n!) ^ {\frac {1}{p}} \| x _ {k} | _ {k = 1} ^ {n} \| _ {n \ell^ {p}}. \end{document} ]]></tex-math></disp-formula><p>The proof is complete.</p><p>With the results from Theorem <xref ref-type="custom" custom-type="reference-target" rid="anchor-ecfd7015-1adf-4f1a-8ed1-3fb9d777fd83">3.3</xref> and Proposition <xref ref-type="custom" custom-type="reference-target" rid="anchor-77497287-a2ad-417b-8130-f35eb23ae5f4">4.1</xref>, on <inline-formula><tex-math id="math-323"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^p \end{document} ]]></tex-math></inline-formula>, we get</p><disp-formula id="equation-64"><tex-math id="math-324"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| \cdot , \dots , \cdot \| _ {n \odot \ell^ {p}} ^ {G} \sim \| \cdot , \dots , \cdot \| _ {n \bullet \ell^ {p}} ^ {I} \sim \| \cdot , \dots , \cdot \| _ {n \odot \ell^ {p}} ^ {I} \sim \| \cdot , \dots , \cdot \| _ {n \ell^ {p}}.\tag{16} \end{document} ]]></tex-math></disp-formula><p>Using fixed linear independent vectors <inline-formula><tex-math id="math-325"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a_{1}, a_{2}, \cdots, a_{n} \in \ell^{p} \end{document} ]]></tex-math></inline-formula>, we also define</p><disp-formula id="equation-65"><tex-math id="math-326"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| x \| _ {\bullet \ell^ {p}} ^ {I} := \sum_ {\{k _ {1}, k _ {2}, \dots , k _ {(n - 1)} \} \subset \{1, 2, \dots , n \}} \| a _ {k _ {1}}, a _ {k _ {2}}, \dots , a _ {k _ {(n - 1)}}, x \| _ {n \bullet \ell^ {p}} ^ {I}.\tag{17} \end{document} ]]></tex-math></disp-formula><p>for every <inline-formula><tex-math id="math-327"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in \ell^p \end{document} ]]></tex-math></inline-formula>. Since (16) holds, <inline-formula><tex-math id="math-328"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \| \cdot \|_{\bullet \ell^p}^I \sim \| \cdot \|_{\ell^p} \end{document} ]]></tex-math></inline-formula>.</p><p><bold>Corollary 4.2. </bold><italic>The spaces </italic><inline-formula><tex-math id="math-329"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (\ell^p, \| \cdot, \cdots, \cdot \|_{n \bullet \ell^p}^I) \end{document} ]]></tex-math></inline-formula><italic> and </italic><inline-formula><tex-math id="math-330"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle (\ell^p, \| \cdot \|_{n \bullet \ell^p}^I) \end{document} ]]></tex-math></inline-formula><italic> are an n-Banach space and a Banach space respectively.</italic></p><p><italic>Proof</italic>. Use the method similar to the proof of Corollary <xref ref-type="custom" custom-type="reference-target" rid="anchor-28af6240-169b-4db9-9990-e2c92106223a">3.4</xref> and the proof of Corollary <xref ref-type="custom" custom-type="reference-target" rid="anchor-f1a79b32-cd16-4004-83bc-77b31de0925a">3.6</xref>. </p></sec><sec id="sec-7"><title>5. CONCLUDING REMARKS</title><p>We have defined several <italic>n</italic>-norms and norms on <inline-formula><tex-math id="math-331"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ell^{p} \end{document} ]]></tex-math></inline-formula> and demonstrated their interrelationships. This investigation could similarly be extended to <inline-formula><tex-math id="math-332"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X = \mathbb{L}^{p}(\mathbb{R}^{n}) \end{document} ]]></tex-math></inline-formula>, or more generally to <inline-formula><tex-math id="math-333"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> as a normed space with an appropriate set of bounded linear functionals. In such cases, new challenges may arise, potentially leading to different results.</p><p>The author is deeply thankful to the anonymous reviewer(s) for their constructive comments and recommendations, which greatly aided in refining this article.</p></sec></body><back><ack><title>Acknowledgement.</title></ack><ref-list><title>REFERENCES</title><ref id="BIBR-1"><element-citation publication-type="book"><article-title>Introductory Functional Analysis with Applications</article-title><person-group person-group-type="author"><name><surname>Kreyszig</surname><given-names>E.</given-names></name></person-group><year>1978</year><publisher-name>John Wiley &amp; Sons</publisher-name></element-citation></ref><ref id="BIBR-2"><element-citation publication-type="journal"><article-title>The space of p-summable sequences and its natural n-norm</article-title><source>Bulletin of the Australian Mathematical Society</source><volume>64</volume><person-group person-group-type="author"><name><surname>Gunawan</surname><given-names>H.</given-names></name></person-group><year>2001</year><page-range>137-147,</page-range><pub-id pub-id-type="doi">10.1017/S0004972700019754</pub-id></element-citation></ref><ref id="BIBR-3"><element-citation publication-type="journal"><article-title>n-inner product spaces</article-title><source>Mathematische Nachrichten</source><volume>140</volume><issue>1</issue><person-group person-group-type="author"><name><surname>Misiak</surname><given-names>A.</given-names></name></person-group><year>1989</year><page-range>299-319,</page-range><pub-id pub-id-type="doi">10.1002/mana.19891400121</pub-id></element-citation></ref><ref id="BIBR-4"><element-citation publication-type="journal"><article-title>On sequence spaces with elements in a sequence of real linear n-normed spaces</article-title><source>Applied Mathematics Letters</source><volume>23</volume><issue>9</issue><person-group person-group-type="author"><name><surname>Dutta</surname><given-names>H.</given-names></name></person-group><year>2010</year><page-range>1109-1113,</page-range><pub-id pub-id-type="doi">10.1016/j.aml.2010.04.045</pub-id></element-citation></ref><ref id="BIBR-5"><element-citation publication-type="journal"><article-title>On n-normed spaces</article-title><source>International Journal of Mathematics and Mathematical Sciences</source><volume>27</volume><issue>10</issue><person-group person-group-type="author"><name><surname>Gunawan</surname><given-names>H.</given-names></name><name><surname>Mashadi</surname><given-names>M.</given-names></name></person-group><year>2001</year><page-range>631-639,</page-range><pub-id pub-id-type="doi">10.1155/S0161171201010675</pub-id></element-citation></ref><ref id="BIBR-6"><element-citation publication-type="journal"><article-title>On n-inner products, n-norms, and the cauchy-schwarz inequality</article-title><source>Scientiae Mathematicae Japonicae</source><volume>55</volume><issue>1</issue><person-group person-group-type="author"><name><surname>Gunawan</surname><given-names>H.</given-names></name></person-group><year>2002</year><page-range>53-60,</page-range></element-citation></ref><ref id="BIBR-7"><element-citation publication-type="journal"><article-title>Strict convexity in linear n-normed spaces</article-title><source>Demonstratio Mathematica</source><volume>29</volume><issue>4</issue><person-group person-group-type="author"><name><surname>Kim</surname><given-names>S.S.</given-names></name><name><surname>Cho</surname><given-names>Y.J.</given-names></name></person-group><year>1996</year><page-range>739-744,</page-range><pub-id pub-id-type="doi">10.1515/dema-1996-0408</pub-id></element-citation></ref><ref id="BIBR-8"><element-citation publication-type="journal"><article-title>Bounded 2-linear operators on 2-normed sets</article-title><source>Glasnik Matematicki</source><volume>39</volume><issue>2</issue><person-group person-group-type="author"><name><surname>Lewandowska</surname><given-names>Z.</given-names></name></person-group><year>2004</year><page-range>303-314,</page-range><pub-id pub-id-type="doi">10.3336/gm.39.2.11</pub-id></element-citation></ref><ref id="BIBR-9"><element-citation publication-type="journal"><article-title>Lineare 2-normierte räume</article-title><source>Mathematische Nachrichten</source><volume>28</volume><person-group person-group-type="author"><name><surname>Gähler</surname><given-names>S.</given-names></name></person-group><year>1963</year><page-range>1-43,</page-range><pub-id pub-id-type="doi">10.1002/mana.19640280102</pub-id></element-citation></ref><ref id="BIBR-10"><element-citation publication-type="journal"><article-title>2-inner product spaces</article-title><source>Demonstratio Mathematica</source><volume>6</volume><person-group person-group-type="author"><name><surname>Diminnie</surname><given-names>C.R.</given-names></name><name><surname>Gähler</surname><given-names>S.</given-names></name><name><surname>White</surname><given-names>A.</given-names></name></person-group><year>1973</year><page-range>525-536,</page-range><pub-id pub-id-type="doi">10.1515/dema-1977-0115</pub-id></element-citation></ref><ref id="BIBR-11"><element-citation publication-type="journal"><article-title>2-banach spaces</article-title><source>Mathematische Nachrichten</source><volume>42</volume><issue>1–3</issue><person-group person-group-type="author"><name><surname>White</surname><given-names>A.G.</given-names></name></person-group><year>1969</year><page-range>43-60,</page-range><pub-id pub-id-type="doi">10.1002/mana.19690420104</pub-id></element-citation></ref><ref id="BIBR-12"><element-citation publication-type="journal"><article-title>Some remarks on $\ell^{p}$ as an n-normed space</article-title><source>Mathematical Sciences And Applications E-Notes</source><volume>2</volume><issue>2</issue><person-group person-group-type="author"><name><surname>Konca</surname><given-names>S.</given-names></name><name><surname>Gunawan</surname><given-names>H.</given-names></name><name><surname>Başarir</surname><given-names>M.</given-names></name></person-group><year>2014</year><page-range>45-50,</page-range><ext-link xlink:href="https://www.researchgate.net/publication/267623012" ext-link-type="uri" xlink:title="267623012">267623012</ext-link></element-citation></ref><ref id="BIBR-13"><element-citation publication-type="journal"><article-title>A contractive mapping theorem for the n-normed space of p-summable sequences</article-title><source>Journal of Mathematical Analysis</source><volume>4</volume><person-group person-group-type="author"><name><surname>Ekariani</surname><given-names>S.</given-names></name><name><surname>Idris</surname><given-names>M.</given-names></name><name><surname>Gunawan</surname><given-names>H.</given-names></name></person-group><year>2013</year><page-range>1-7,</page-range><ext-link xlink:href="https://www.ilirias.com/jma/repository/docs/JMA4-1-1.pdf" ext-link-type="uri" xlink:title="Docs">Docs</ext-link></element-citation></ref><ref id="BIBR-14"><element-citation publication-type="journal"><article-title>p-summable sequence spaces with 2-inner products</article-title><source>Contemporary Analysis and Applied Mathematics</source><volume>3</volume><issue>2</issue><person-group person-group-type="author"><name><surname>Konca</surname><given-names>S.</given-names></name><name><surname>Idris</surname><given-names>M.</given-names></name><name><surname>Gunawan</surname><given-names>H.</given-names></name><name><surname>Başarir</surname><given-names>M.</given-names></name></person-group><year>2015</year><page-range>213-226,</page-range><pub-id pub-id-type="doi">10.18532/caam.47117</pub-id></element-citation></ref><ref id="BIBR-15"><element-citation publication-type="journal"><article-title>Equivalence among three 2-norms on the space of p-summable sequences</article-title><source>Journal of Inequalities and Special Functions</source><volume>7</volume><issue>4</issue><person-group person-group-type="author"><name><surname>Konca</surname><given-names>S.</given-names></name><name><surname>Idris</surname><given-names>M.</given-names></name></person-group><year>2016</year><page-range>218-224,</page-range><ext-link xlink:href="https://www.ilirias.com/jiasf/repository/docs/JIASF7-4-15.pdf" ext-link-type="uri" xlink:title="Docs">Docs</ext-link></element-citation></ref><ref id="BIBR-16"><element-citation publication-type="journal"><article-title>New 2-norms formed on $\ell^{p}(\mathbb{R})$ by bounded linear functionals</article-title><source>Journal Advanced Studies: Euro-Tbilisi Mathematical Journal</source><volume>16</volume><issue>supplement issue 4</issue><person-group person-group-type="author"><name><surname>Konca</surname><given-names>S.</given-names></name><name><surname>Idris</surname><given-names>M.</given-names></name></person-group><year>2023</year><page-range>151-165,</page-range><pub-id pub-id-type="doi">10.32513/asetmj/1932200823413</pub-id></element-citation></ref><ref id="BIBR-17"><element-citation publication-type="journal"><article-title>Two equivalent n-norms on the space of p-summable sequences</article-title><source>Periodica Mathematica Hungarica</source><volume>67</volume><issue>1</issue><person-group person-group-type="author"><name><surname>Wibawa-Kusumah</surname><given-names>R.A.</given-names></name><name><surname>Gunawan</surname><given-names>H.</given-names></name></person-group><year>2013</year><page-range>63-69,</page-range><pub-id pub-id-type="doi">10.1007/s10998-013-6129-4</pub-id></element-citation></ref><ref id="BIBR-18"><element-citation publication-type="journal"><article-title>On the space of p-summable sequences</article-title><source>Matematicki Vesnik</source><volume>65</volume><issue>1</issue><person-group person-group-type="author"><name><surname>Idris</surname><given-names>M.</given-names></name><name><surname>Ekariani</surname><given-names>S.</given-names></name><name><surname>Gunawan</surname><given-names>H.</given-names></name></person-group><year>2013</year><page-range>58-63,</page-range><ext-link xlink:href="https://www.researchgate.net/publication/267659736" ext-link-type="uri" xlink:title="267659736">267659736</ext-link></element-citation></ref></ref-list></back></article>