scholarly journals An Alternative Proof of a Theorem on the Lebesgue Integral

1960 ◽  
Vol 43 ◽  
pp. 5-6
Author(s):  
B. D. Josephson

The theorem concerned is the following: iff is continuous in [a, b], and f exists and is finite except at an enumerable set of points and Lebesgue integrable in [a, b], then

1945 ◽  
Vol 35 ◽  
pp. 10-13 ◽  
Author(s):  
W. L. Edge

The pencil of quartic curveswhere x, y, z are homogeneous coordinates in a plane, was encountered by Ciani [Palermo Rendiconli, Vol. 13, 1899] in his search for plane quartic curves that were invariant under harmonic inversions. If x, y, z undergo any permutation the ternary quartic form on the left of (1) is not altered; nor is it altered if any, or all, of x, y, z be multiplied by −1. There thus arises an octahedral group G of ternary collineations for which every curve of the pencil is invariant.Since (1) may also be writtenthe four linesare, as Ciani pointed out, bitangents, at their intersections with the conic C whose equation is x2 + y2 + z2 = 0, to every quartic of the pencil. The 16 base points of the pencil are thus all accounted for—they consist of these eight contacts counted twice—and this set of points must of course be invariant under G. Indeed the 4! collineations of G are precisely those which give rise to the different permutations of the four lines (2), a collineation in a plane being determined when any four non-concurrent lines and the four lines which are to correspond to them are given. The quadrilateral formed by the lines (2) will be called q.


1966 ◽  
Vol 15 (1) ◽  
pp. 67-71 ◽  
Author(s):  
C. Sudler

In (7), Wright gives an enumerative proof of an identity algebraically equivalent to that of Jacobi, namelyHere, and in the sequel, products run from 1 to oo and sums from - oo to oo unless otherwise indicated. We give here a simplified version of his argument by working directly with (1), the substitution leading to equation (3) of his paper being omitted. We then supply an alternative proof of (1) by means of a generalisation of the Durfee square concept utilising the rectangle of dimensions v by v + r for fixed r and maximal v contained in the Ferrers graph of a partition.


1989 ◽  
Vol 32 (3) ◽  
pp. 483-494 ◽  
Author(s):  
Paul D. Humke ◽  
M. Laczkovich

Let C[0,1] be the Banach space of continuous functions defined on [0,1] and let C be the set of functions f∈C[0,1] mapping [0,1] into itself. If f∈C, fk will denote the kth iterate of f and we put Ck = {fk:f∈C;}. The set of increasing (≡ nondecreasing) and decreasing (≡ nonincreasing) functions in C will be denoted by ℐ and D, respectively. If a function f is defined on an interval I, we let C(f) denote the set of points at which f is locally constant, i.e.We let N denote the set of positive integers and NN denote the Baire space of sequences of positive integers.


2011 ◽  
Vol 95 (534) ◽  
pp. 407-413
Author(s):  
Li Zhou

In [1] Niven used the integralto give a well-known proof of the irrationality of π. Recently Zhou and Markov [2] used a recurrence relation satisfied by this integral to present an alternative proof which may be more direct than Niven's.Niven did not cite any references in [1] and thus the origin or Hn seems rather mysterious and ingenious. However if we heed Abel's advice to ‘study the masters’, we find that Hn emerged much more naturally from the great works of Lambert [3] and Hermite [4].


Author(s):  
M. S. P. Eastham

SynopsisThe differential equationin N dimensions is considered, where q(x) is periodic. When N = 1, it is known that the conditional stability set coincides with the spectrum and that these also coincide with two other sets involving eigenvalues of associated eigenvalue problems. These results have been proved by means of the Floquet theory and the discriminant. Here an alternative proof is given which avoids the Floquet theory and which applies to the general case of N dimensions.


1970 ◽  
Vol 11 (3) ◽  
pp. 381-383 ◽  
Author(s):  
W. D. Wallis

A (ν, κ, λ)-graph is defined in [3] as a graph on ν points, each of valency κ, and such that for any two points P and Q there are exactly λ points which are joined to both. In other words, if Si is the set of points joined to Pi, thenSi has k elements for any iSiSj has λ elements if i≠jThe sets Si are the blocks of a (v, k, λ)-configuration, so a necessary condition on v, k, and λ that a graph should exist is that a (v, k, λ)- configuration should exist. Another necessary condition, reported by Bose (see [1]) and others, is that there should be an integer m satisfying have equal parity. We shall prove that these conditions are not sufficient.


1970 ◽  
Vol 13 (3) ◽  
pp. 351-357
Author(s):  
Charles G. Costley

L2(a, b)1with the property2were originally defined by T. Carleman [4]. Here he imposed on the kernel the conditions of measurability and hermiticity,3for all x with the exception of a countable set with a finite number of limit points and4where Jδ denotes the interval [a, b] with the exception of subintervals |x - ξv| < δ; here ξv represents a finite set of points for which (3) fails to hold.


1994 ◽  
Vol 36 (1) ◽  
pp. 81-86
Author(s):  
S. Srinivasan

Here we extend an arithmetical inequality about multiplicative functions obtained by K. Alladi, P. Erdős and J. D. Vaaler, to include also the case of submultiplicative functions. Also an alternative proof of an extension of a result used for this purpose is given.Let Uk, for integral k, denote the set {1,2,…, k}, and Vk denote the collection of all subsets of Uk. In the following, all unspecified sets like A,…, are assumed to be subsets of Uk. Let σ = {Si} and τ = {Tj} be two given collections of subsets of Uk. SetandLet ′ denote complementation in Uk (but for in the proof of (3) where it denotes complementation in C). For any collection p of subsets of Uk, let p′ denote the collection of the complements of members of p.


1974 ◽  
Vol 39 (4) ◽  
pp. 661-664 ◽  
Author(s):  
Alasdair Urquhart

In [1] Diego showed that there are only finitely many nonequivalent formulas in n variables in the positive implicational propositional calculus P. He also gave a recursive construction of the corresponding algebra of formulas, the free Hilbert algebra In on n free generators. In the present paper we give an alternative proof of the finiteness of In, and another construction of free Hilbert algebras, yielding a normal form for implicational formulas. The main new result is that In is built up from n copies of a finite Boolean algebra. The proofs use Kripke models [2] rather than the algebraic techniques of [1].Let V be a finite set of propositional variables, and let F(V) be the set of all formulas built up from V ⋃ {t} using → alone. The algebra defined on the equivalence classes , by settingis a free Hilbert algebra I(V) on the free generators . A set T ⊆ F(V) is a theory if ⊦pA implies A ∈ T, and T is closed under modus ponens. For T a theory, T[A] is the theory {B ∣ A → B ∈ T}. A theory T is p-prime, where p ∈ V, if p ∉ T and, for any A ∈ F(V), A ∈ T or A → p ∈ T. A theory is prime if it is p-prime for some p. Pp(V) denotes the set of p-prime theories in F(V), P(V) the set of prime theories. T ∈ P(V) is minimal if there is no theory in P(V) strictly contained in T. Where X = {A1, …, An} is a finite set of formulas, let X → B be A1 →····→·An → B (ϕ → B is B). A formula A is a p-formula if p is the right-most variable occurring in A, i.e. if A is of the form X → p.


Sign in / Sign up

Export Citation Format

Share Document