Adjoints, Absolute Values and Polar Decompostions

Bridges, D.S; Richman, F; Schuster, P

dc.contributor.author	Bridges, D.S	en
dc.contributor.author	Richman, F	en
dc.contributor.author	Schuster, P	en
dc.date.accessioned	2009-04-16T23:12:02Z	en
dc.date.available	2009-04-16T23:12:02Z	en
dc.date.issued	1997-11	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-069 (1997)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/3578	en
dc.description.abstract	Various questions about adjoints, absolute values and polar decompositions of operators are addressed from a constructive point of view. The focus is on bilinear forms. Conditions are given for the existence of an adjoint, and a general notion of a polar decomposition is developed. The Riesz representation theorem is proved without countable choice.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial	en
dc.title	Adjoints, Absolute Values and Polar Decompostions	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::280000 Information, Computing and Communication Sciences	en
dc.rights.holder	The author(s)	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en